{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VAIKOW3A6S6BNHMAFZ5ZRMTQVI","short_pith_number":"pith:VAIKOW3A","schema_version":"1.0","canonical_sha256":"a810a75b60f4bc169d802e7b98b270aa26ef50cfd3a9a8bf63bfb24fe0d750ae","source":{"kind":"arxiv","id":"2203.03054","version":3},"attestation_state":"computed","paper":{"title":"Verification of Bitcoin Script in Agda using Weakest Preconditions for Access Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LO","cs.SI"],"primary_cat":"cs.SC","authors_text":"Anton Setzer, Arnold Beckmann, Bogdan Lazar, Fahad F. Alhabardi","submitted_at":"2022-03-06T21:07:28Z","abstract_excerpt":"This paper contributes to the verification of programs written in Bitcoin's smart contract language SCRIPT in the interactive theorem prover Agda. It focuses on the security property of access control for SCRIPT programs that govern the distribution of Bitcoins. It advocates that weakest preconditions in the context of Hoare triples are the appropriate notion for verifying access control. It aims at obtaining human-readable descriptions of weakest preconditions in order to close the validation gap between user requirements and formal specification of smart contracts.\n  As examples for the prop"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2203.03054","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2022-03-06T21:07:28Z","cross_cats_sorted":["cs.CR","cs.LO","cs.SI"],"title_canon_sha256":"5d5053d49ff82e49ecc43c2534c7906c4b9ae3d3d004208f2a3522b552ade945","abstract_canon_sha256":"7c499fcaaef94f93c32eee1aae0389360ef1b9f64c97f2f16ff9b8fde5a5e3bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:09.872994Z","signature_b64":"atzN8IsLmyh7lV6o82hfnwLj0K/3jGdPk8g5GQN8yGLBO4ilKrT5yDXllPNxpUaUBsyor7Q85/VL6Wjx6YXnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a810a75b60f4bc169d802e7b98b270aa26ef50cfd3a9a8bf63bfb24fe0d750ae","last_reissued_at":"2026-07-05T05:17:09.872523Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:09.872523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verification of Bitcoin Script in Agda using Weakest Preconditions for Access Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LO","cs.SI"],"primary_cat":"cs.SC","authors_text":"Anton Setzer, Arnold Beckmann, Bogdan Lazar, Fahad F. Alhabardi","submitted_at":"2022-03-06T21:07:28Z","abstract_excerpt":"This paper contributes to the verification of programs written in Bitcoin's smart contract language SCRIPT in the interactive theorem prover Agda. It focuses on the security property of access control for SCRIPT programs that govern the distribution of Bitcoins. It advocates that weakest preconditions in the context of Hoare triples are the appropriate notion for verifying access control. It aims at obtaining human-readable descriptions of weakest preconditions in order to close the validation gap between user requirements and formal specification of smart contracts.\n  As examples for the prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.03054","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.03054/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2203.03054","created_at":"2026-07-05T05:17:09.872580+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.03054v3","created_at":"2026-07-05T05:17:09.872580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.03054","created_at":"2026-07-05T05:17:09.872580+00:00"},{"alias_kind":"pith_short_12","alias_value":"VAIKOW3A6S6B","created_at":"2026-07-05T05:17:09.872580+00:00"},{"alias_kind":"pith_short_16","alias_value":"VAIKOW3A6S6BNHMA","created_at":"2026-07-05T05:17:09.872580+00:00"},{"alias_kind":"pith_short_8","alias_value":"VAIKOW3A","created_at":"2026-07-05T05:17:09.872580+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18098","citing_title":"IsabeLLM: Automated Theorem Proving Applied to Formally Verifying Consensus","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VAIKOW3A6S6BNHMAFZ5ZRMTQVI","json":"https://pith.science/pith/VAIKOW3A6S6BNHMAFZ5ZRMTQVI.json","graph_json":"https://pith.science/api/pith-number/VAIKOW3A6S6BNHMAFZ5ZRMTQVI/graph.json","events_json":"https://pith.science/api/pith-number/VAIKOW3A6S6BNHMAFZ5ZRMTQVI/events.json","paper":"https://pith.science/paper/VAIKOW3A"},"agent_actions":{"view_html":"https://pith.science/pith/VAIKOW3A6S6BNHMAFZ5ZRMTQVI","download_json":"https://pith.science/pith/VAIKOW3A6S6BNHMAFZ5ZRMTQVI.json","view_paper":"https://pith.science/paper/VAIKOW3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.03054&json=true","fetch_graph":"https://pith.science/api/pith-number/VAIKOW3A6S6BNHMAFZ5ZRMTQVI/graph.json","fetch_events":"https://pith.science/api/pith-number/VAIKOW3A6S6BNHMAFZ5ZRMTQVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VAIKOW3A6S6BNHMAFZ5ZRMTQVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VAIKOW3A6S6BNHMAFZ5ZRMTQVI/action/storage_attestation","attest_author":"https://pith.science/pith/VAIKOW3A6S6BNHMAFZ5ZRMTQVI/action/author_attestation","sign_citation":"https://pith.science/pith/VAIKOW3A6S6BNHMAFZ5ZRMTQVI/action/citation_signature","submit_replication":"https://pith.science/pith/VAIKOW3A6S6BNHMAFZ5ZRMTQVI/action/replication_record"}},"created_at":"2026-07-05T05:17:09.872580+00:00","updated_at":"2026-07-05T05:17:09.872580+00:00"}