Verifiable computation for Nostr Data Vending Machines.
Nostr DVMs are the future:
- free market
- censorship resistant
- standardised
What if we could bring ZKPs to make the computations of DVMs provable ?
Here you, with Askeladd :
- NIP-90 compliant.
- Uses STWO prover to generate Circle STARK proofs.
- In-browser proof verification using Web assembly STWO verifier.
For the user it's very simple:
- Submit the job via a web page signing a Nostr message (with any NIP-07 compatible extension)
- Get the result and verify the proof in the browser directly
Try it yourself: https://askeladd.org
