[p2p-hackers] Homomorphic hashing and fountain codes - implementation question

[Hal Finney]

Quick correction:

> There is a possible workaround.  You could choose a prime q which was
> just barely, barely, barely 257 bits long.  Let it be 2^257 plus some
> number less than 2^170 or so.

I should have said, let it be 2^256 plus some number less than...  In other
words, a 257 bit prime that is just barely bigger than 2^256.

Hal