memoscan
← all memos

Memo 0x0a1197d1…f2368f on Ethereum

Those who were the first 1/sqrt(2) to reveal a number out of those with an ID 1/sqrt(2)^n of the population, get to reveal 1+n more numbers. n is number of times it has been repeated. Maximum number of votes  is 4x population. The cycles get period/2^n time allocated. Practically, time runs out before log2(population) repetitions. Total votes possible will approximate 4x population.