"Sell me this preimage."
You can verifiably purchase the solution to any NP-Complete problem using Bitcoin (and Lightning), combined with zero-knowledge proofs.
- Buy the solution to a sudoku puzzle
- Buy the prime factors of an RSA key
- Bridge HTLCs with PTLCs
- Buy a valid proof-of-work
- and more...
Interesting project! What kind of proving times are you getting? Say a sudoku for argument's sake. Also are you aware of the flaw in the original zkcp demo by bowe and maxwell? (To do with witness indistinguishability). Maybe it doesn't apply because STARKs not SNARKs but just wondering.
Thanks for the detailed breakdown and explanation. I really enjoyed this article and hope PTLC's can eventually get implemented.
It also gives me an extra reason to keep my node up to date, and with taproot enabled.
