> The client's algorithm: > Input: C > > 1. Select N, E > > 2. Calculate S = equix_solve(C || N || E) > > 3. Calculate R = blake2b(C || N || E || S) > > 4. if R * E > UINT32_MAX, go back to step 1) > > 5. Submit C, N, E, S (68 bytes total)
It looks like all the 40320 permutations of the 16-bit words in S are equix solutions. Are steps 3 to 5 supposed to be repeated for all the permutations? _______________________________________________ tor-dev mailing list [email protected] https://lists.torproject.org/cgi-bin/mailman/listinfo/tor-dev
