3 ms·
If it indeed points to a n^100 algorithm (or p!=np), I’d do it. It’d greatly expedite collecting the Clay’s prize money to have someone recognizable validate th
by baq 5y ago
If it indeed points to a n^100 algorithm (or p!=np), I’d do it. It’d greatly expedite collecting the Clay’s prize money to have someone recognizable validate the proof ;)
If it was n^10, well, likely different story, involving three letter agencies, I’m afraid.
- bryanrasmussen 5y ago>I’d do it. It’d greatly expedite collecting the Clay’s prize money to have someone recognizable validate the proof yeah, but in my case (and presumably the previous commenter's case) I don't know who Zaik on HN is and if they are recognizable in the field. That they asked increases my feeling that it is likely they are recognizable but surely anyone who solves p!=np isn't going to just follow something as irrational as a feeling.
- bawolff 5y agoI mean its still a million dollars, and money makes people do crazy things. I'd, i don't know, figure out some way to cryptographically timestamp a hash of the proof first at least.
- bryanrasmussen 5y agofinally the killer app for the blockchain! Before I release my proof I will of course have to develop my ethereum app to verify origins of mathematical proofs.
- BoorishBears 5y agoor like... tweet the SHA256 of the proof text.
- bawolff 5y agoNot really a new application for bitcoin. Trusted timestamping has been considered a secondary use case for bitcoin for a ling time. There's even services lìke https://en.m.wikipedia.org/wiki/OpenTimestamps https://en.m.wikipedia.org/wiki/OpenTimestamps
- sterlind 5y agoif you proved P=NP, time-stamping a hash might not be too secure :)