https://github.com/neocarmack/STARK

Arithmetization of the execution trace of a circuit(represents some computation), and generate off-chain STARK proof for public verification.
https://github.com/neocarmack/STARK

Last synced: 3 months ago
JSON representation

Arithmetization of the execution trace of a circuit(represents some computation), and generate off-chain STARK proof for public verification.

• Host: GitHub
• URL: https://github.com/neocarmack/STARK
• Owner: neocarmack
• Created: 2023-11-15T11:03:05.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2023-11-17T07:20:48.000Z (about 1 year ago)
• Last Synced: 2024-05-22T03:09:22.292Z (9 months ago)
• Size: 408 KB
• Stars: 7
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

• awesome-bitvm - STARK proof for BitVM circuit execution

README

        
# Abstract

We arithmetize the execution trace of the BitVM circuit(represents some computation), and generate off-chain STARK proof for public verification. If the prover can not generate a correct proof, then the verifier only needs to challenge once (open one arbitrary gate) to get the BTC in the 2-sig address. If the prover can generate a correct proof, then he can get BTC by one response. The method in this paper avoids a large amount of on-chain transactions in the challenge-response process, but the amount of off-chain computation will be relatively large, mainly because generating STARK proof will consume more computing resources.

# The paper

[STARK proof for BitVM circuit execution](https://github.com/neocarmack/STARK/blob/main/STARK%20proof%20for%20BitVM%20circuit%20execution.pdf)