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.
-
Notifications
You must be signed in to change notification settings - Fork 1
neocarmack/STARK
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Arithmetization of the execution trace of a circuit(represents some computation), and generate off-chain STARK proof for public verification.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published