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
Abdel / A₿del ∞/21M 🐺 - 🐱
npub1hr…w2e29
2024-08-01 08:31:22
Author Public Key
npub1hr6v96g0phtxwys4x0tm3khawuuykz6s28uzwtj5j0zc7lunu99snw2e29Published at
2024-08-01 08:31:22Event JSON
{
"id": "c25238d06ed51769aa4351974b24d5fe3c4004b8a8a9f59d8c540e0ab4fd8f4d",
"pubkey": "b8f4c2e90f0dd667121533d7b8dafd77384b0b5051f8272e5493c58f7f93e14b",
"created_at": 1722501082,
"kind": 1,
"tags": [],
"content": "Verifiable computation for Nostr Data Vending Machines.\n\nNostr DVMs are the future:\n- free market\n- censorship resistant\n- standardised\n\nWhat if we could bring ZKPs to make the computations of DVMs provable ?\n\nHere you, with Askeladd :\n- NIP-90 compliant.\n- Uses STWO prover to generate Circle STARK proofs.\n- In-browser proof verification using Web assembly STWO verifier.\n\nFor the user it's very simple:\n- Submit the job via a web page signing a Nostr message (with any NIP-07 compatible extension)\n- Get the result and verify the proof in the browser directly\n\nhttps://m.primal.net/Jkvk.mp4 \n\nTry it yourself: https://askeladd.org",
"sig": "cf17987b3906ad08f7160440d8563aea308df943719b067e5b6861dccd8fa90687f86d8d5247b08cb6579327f28354b55807d1ff83505035f57c472f219cf744"
}