Hello, I have some questions about the process of computing a chain point according to the first format dp15k32.
1) In order to find a distinguished point, first we compute the a51 part(64 steps majority clock) and then 64 steps round function(lfsr 64 bits wide). Afterwards the result is xor-ed and if it is a distinguished point the result is the first valid chain point and the whole process is repeated until we have 32 valid chain points. If it is not a distinguished point then which part do we repeat( for 64 times) until we find one? The a51 part or the round function part? 2) What is considered distinguished point?The lsb 15 bits or any consecutive 15 bits have to be all zero ? Thank you in advance for your answers.
_______________________________________________ A51 mailing list [email protected] http://lists.lists.reflextor.com/cgi-bin/mailman/listinfo/a51
