News for hackers. Stuff that matters.

A comment on Time, Randomness, and a $100k Prize to Forever Change Blockchain. Parent comment

Re:Time, Randomness, and a $100k Prize to Forever Change Blo... by superpermutat0r on Thursday August 01, 2019 @06:58PM (#20589147)
But squaring numbers is paralellizable. You pick an exponent you want and take a modulus only later. Iterative squaring is also trivial if exponent is a power of two. Calculating x^(2^t) mod n should take no time on any computer.

I think the rest of the puzzle is fairly hard to guess.

[ Parent | on HN ]
Re:Time, Randomness, and a $100k Prize to Forever Change Blo... by zodiac on Thursday August 01, 2019 @07:12PM (#20589236)
Iterative squaring is not paralellizable - to compute x^4 as (x^2)^2 you have to compute t = x^2 first before starting the computation of t^2. Calculating x^(2^t) mod n takes t squarings.
[ Parent | on HN ]