{"id":13619448,"url":"https://github.com/neocarmack/STARK","last_synced_at":"2025-04-14T16:31:34.379Z","repository":{"id":207359550,"uuid":"719056062","full_name":"neocarmack/STARK","owner":"neocarmack","description":"Arithmetization of the execution trace of a circuit(represents some computation), and generate off-chain STARK proof for public verification. ","archived":false,"fork":false,"pushed_at":"2023-11-17T07:20:48.000Z","size":418,"stargazers_count":7,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"main","last_synced_at":"2024-05-22T03:09:22.292Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/neocarmack.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null}},"created_at":"2023-11-15T11:03:05.000Z","updated_at":"2024-04-26T18:15:22.000Z","dependencies_parsed_at":null,"dependency_job_id":"cd161fde-a3a5-4c7d-bf34-0b943793cdec","html_url":"https://github.com/neocarmack/STARK","commit_stats":null,"previous_names":["neocarmack/stark"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/neocarmack%2FSTARK","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/neocarmack%2FSTARK/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/neocarmack%2FSTARK/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/neocarmack%2FSTARK/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/neocarmack","download_url":"https://codeload.github.com/neocarmack/STARK/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248916637,"owners_count":21182845,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-08-01T21:00:40.946Z","updated_at":"2025-04-14T16:31:30.477Z","avatar_url":"https://github.com/neocarmack.png","language":null,"funding_links":[],"categories":["Resources"],"sub_categories":["Potential Use Case"],"readme":"# Abstract\nWe 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.\n\n# The paper\n\n[STARK proof for BitVM circuit execution](https://github.com/neocarmack/STARK/blob/main/STARK%20proof%20for%20BitVM%20circuit%20execution.pdf)\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fneocarmack%2FSTARK","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fneocarmack%2FSTARK","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fneocarmack%2FSTARK/lists"}