Quote from: piotr_n on January 29, 2014, 04:47:54 PM

Quote from: BurtW on January 29, 2014, 04:39:25 PM

That looks like great/fun/useful? research into the properties of the RNG used to generate the data.

As I said, I suck at math, but my understanding of this project is that it is a statistical analysis of how the value of the least significant 32 bits of... something (but which has definitely nothing to with RNG), can be projected into the most efficient set of a specific randezvouz point, to be (eventually) used for bruteforcing secp256k1 keys.

Exactly, RNG has nothing to do with it, which is often overlooked because people are used to faulty RNG being the usual suspect. RNG quality on machines generating the triplets is unimportant, because all generated private keys are sieved against an array of predefined values, and if matched is later used in the analysis.

Edit: X EC coordinate (first half of the public key) is calculated, and if last 1/4 of that X-coord matches any value in the array produced triplet is submitted.

Quote from: piotr_n on January 29, 2014, 04:38:44 PM

Quote from: itod on January 29, 2014, 04:23:32 PM

Dozens off us with many machines are helping him gather this data, we'll see the results in the paper.

Exactly. It is a highly valuable project, because even if it fails, it still proves something.

Unlike the "there is nothing suspicious about secp256k1 params" or "your tool cannot crack my key" approach - which is totally useless and may be even dangerous, since it strengthens confidence in the technology that uses assumptions, which no sane mathematician would bet his life on.

+1