{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:EP4UJQ5C3U6N36VX6INFAFKVBC","short_pith_number":"pith:EP4UJQ5C","canonical_record":{"source":{"id":"2512.21137","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-12-24T12:07:25Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"db610e299948e8780635ef2b2da8ad23045e37747bb3d7d5cbed306f32505e37","abstract_canon_sha256":"a45073e022c0761b22f65f181b76b501e2f86c32f251fd251303b51e864dcfce"},"schema_version":"1.0"},"canonical_sha256":"23f944c3a2dd3cddfab7f21a501555089c13af592fd740488ff6575255fb9684","source":{"kind":"arxiv","id":"2512.21137","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.21137","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"arxiv_version","alias_value":"2512.21137v3","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.21137","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"pith_short_12","alias_value":"EP4UJQ5C3U6N","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"EP4UJQ5C3U6N36VX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"EP4UJQ5C","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:EP4UJQ5C3U6N36VX6INFAFKVBC","target":"record","payload":{"canonical_record":{"source":{"id":"2512.21137","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-12-24T12:07:25Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"db610e299948e8780635ef2b2da8ad23045e37747bb3d7d5cbed306f32505e37","abstract_canon_sha256":"a45073e022c0761b22f65f181b76b501e2f86c32f251fd251303b51e864dcfce"},"schema_version":"1.0"},"canonical_sha256":"23f944c3a2dd3cddfab7f21a501555089c13af592fd740488ff6575255fb9684","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:12.122999Z","signature_b64":"7dHQnQtTXyxu0X5UmtxVfnGNm/wEx2HuTWPMJUn6yYrsqnO7BbLEvKFQLIl6LemmHK2oxeQUD3pDhbAMMTDyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23f944c3a2dd3cddfab7f21a501555089c13af592fd740488ff6575255fb9684","last_reissued_at":"2026-05-18T02:45:12.122431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:12.122431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2512.21137","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WbgpkvwkyhEdDjlgsjK0wUyl6odOO0amfllL+u04a4lJREhuBwnzHhiNMBlPc7FPtW4PAH3cbbzg8OgPgtvJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:22:09.566365Z"},"content_sha256":"989810bfcc2bc1ebe797b16467e1f39377352dd885edb70ad4079b513fa4860a","schema_version":"1.0","event_id":"sha256:989810bfcc2bc1ebe797b16467e1f39377352dd885edb70ad4079b513fa4860a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:EP4UJQ5C3U6N36VX6INFAFKVBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Declarative distributed algorithms as axiomatic theories in three-valued modal logic over semitopologies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Distributed algorithms admit declarative axiomatizations in three-valued modal logic over semitopologies.","cross_cats":["cs.DC"],"primary_cat":"cs.LO","authors_text":"Murdoch J. Gabbay","submitted_at":"2025-12-24T12:07:25Z","abstract_excerpt":"We illustrate how to formally specify distributed algorithms as declarative axiomatic theories in a modal logic, using as illustrative examples a simple voting protocol, a simple broadcast protocol (Bracha Broadcast), and a simple agreement protocol (Crusader Agreement). The methods scale well and have been used to find errors in a proposed industrial protocol.\n  The key novelty is to use modal logic to capture a declarative, high-level representation of essential system properties -- the logical essence of the algorithm -- while abstracting away from explicit state transitions of an abstract "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We illustrate how to formally specify distributed algorithms as declarative axiomatic theories in a modal logic... using as illustrative examples a simple voting protocol, a simple broadcast protocol (Bracha Broadcast), and a simple agreement protocol (Crusader Agreement). The proofs in this paper have been formalised in Lean 4.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That three-valued modal logic over semitopologies can faithfully capture the essential correctness and resilience properties of the target distributed algorithms without omitting critical behavioral details that only appear in concrete executions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Distributed algorithms are expressed as axiomatic theories in three-valued modal logic over semitopologies, with examples including Bracha broadcast and Crusader agreement, and all proofs formalized in Lean 4.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Distributed algorithms admit declarative axiomatizations in three-valued modal logic over semitopologies.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2c1452a786757f2df7f246f6dd62852ebbf48a981dde8258d0f2d24bbd9cfc2d"},"source":{"id":"2512.21137","kind":"arxiv","version":3},"verdict":{"id":"5e90855c-1b7b-46e2-b2e0-ecb1a85026d2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T19:48:45.345253Z","strongest_claim":"We illustrate how to formally specify distributed algorithms as declarative axiomatic theories in a modal logic... using as illustrative examples a simple voting protocol, a simple broadcast protocol (Bracha Broadcast), and a simple agreement protocol (Crusader Agreement). The proofs in this paper have been formalised in Lean 4.","one_line_summary":"Distributed algorithms are expressed as axiomatic theories in three-valued modal logic over semitopologies, with examples including Bracha broadcast and Crusader agreement, and all proofs formalized in Lean 4.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That three-valued modal logic over semitopologies can faithfully capture the essential correctness and resilience properties of the target distributed algorithms without omitting critical behavioral details that only appear in concrete executions.","pith_extraction_headline":"Distributed algorithms admit declarative axiomatizations in three-valued modal logic over semitopologies."},"references":{"count":36,"sample":[{"doi":"","year":2011,"title":"Ofer Arieli, Arnon Avron, and Anna Zamansky, Ideal paraconsistent logics, Studia Logica 99 (2011), no. 1-3, 31--60","work_id":"a5bd9eb4-eaae-415d-9f26-11a6704b4a31","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Ittai Abraham, Naama Ben-David, and Sravya Yandamuri, Efficient and adaptively secure asynchronous binary agreement via binding crusader agreement, Proceedings of the 2022 ACM Symposium on Principles ","work_id":"fd7120de-2c35-411c-99e6-4aa79d99fcd5","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"184, Schloss Dagstuhl - Leibniz-Zentrum f \\\" u r Informatik, 2020, pp","work_id":"6d263d6d-7c5b-4534-bfda-2627e1202ce7","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"253, Schloss Dagstuhl - Leibniz-Zentrum f \\\" u r Informatik, 2022, pp","work_id":"adcf8f18-8e1a-4daa-ad98-b29c6a4cdac7","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Orestis Alpos, Christian Cachin, Bj \\\" o rn Tackmann, and Luca Zanolini, Asymmetric distributed trust, Distributed Computing 37 (2024), no. 3, 247--277","work_id":"714fcea5-77b6-4ab8-88b2-350c26440da7","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":36,"snapshot_sha256":"7075bf1f308fcb00cf836844a967c85b38cbf84e860446d2a9c2bef2af9ddb95","internal_anchors":0},"formal_canon":{"evidence_count":3,"snapshot_sha256":"550418395becdf57129f122ca0b48b7fe55c9c45312b93db142eb381d10cc822"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"5e90855c-1b7b-46e2-b2e0-ecb1a85026d2"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oSA8n/pEfBAfy6GbB6r4MsPQiK15hEQEIRwDk6xX/U3G9DFQ+1j7wvhX4yscYT4uNFULdFdg92aiUwotLlDcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:22:09.566981Z"},"content_sha256":"dad934d0766e2428be7d423fa85dc8a472b016163203099b2023871dee004b2c","schema_version":"1.0","event_id":"sha256:dad934d0766e2428be7d423fa85dc8a472b016163203099b2023871dee004b2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EP4UJQ5C3U6N36VX6INFAFKVBC/bundle.json","state_url":"https://pith.science/pith/EP4UJQ5C3U6N36VX6INFAFKVBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EP4UJQ5C3U6N36VX6INFAFKVBC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T23:22:09Z","links":{"resolver":"https://pith.science/pith/EP4UJQ5C3U6N36VX6INFAFKVBC","bundle":"https://pith.science/pith/EP4UJQ5C3U6N36VX6INFAFKVBC/bundle.json","state":"https://pith.science/pith/EP4UJQ5C3U6N36VX6INFAFKVBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EP4UJQ5C3U6N36VX6INFAFKVBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:EP4UJQ5C3U6N36VX6INFAFKVBC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a45073e022c0761b22f65f181b76b501e2f86c32f251fd251303b51e864dcfce","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-12-24T12:07:25Z","title_canon_sha256":"db610e299948e8780635ef2b2da8ad23045e37747bb3d7d5cbed306f32505e37"},"schema_version":"1.0","source":{"id":"2512.21137","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.21137","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"arxiv_version","alias_value":"2512.21137v3","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.21137","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"pith_short_12","alias_value":"EP4UJQ5C3U6N","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"EP4UJQ5C3U6N36VX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"EP4UJQ5C","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:dad934d0766e2428be7d423fa85dc8a472b016163203099b2023871dee004b2c","target":"graph","created_at":"2026-05-18T02:45:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We illustrate how to formally specify distributed algorithms as declarative axiomatic theories in a modal logic... using as illustrative examples a simple voting protocol, a simple broadcast protocol (Bracha Broadcast), and a simple agreement protocol (Crusader Agreement). The proofs in this paper have been formalised in Lean 4."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That three-valued modal logic over semitopologies can faithfully capture the essential correctness and resilience properties of the target distributed algorithms without omitting critical behavioral details that only appear in concrete executions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Distributed algorithms are expressed as axiomatic theories in three-valued modal logic over semitopologies, with examples including Bracha broadcast and Crusader agreement, and all proofs formalized in Lean 4."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Distributed algorithms admit declarative axiomatizations in three-valued modal logic over semitopologies."}],"snapshot_sha256":"2c1452a786757f2df7f246f6dd62852ebbf48a981dde8258d0f2d24bbd9cfc2d"},"formal_canon":{"evidence_count":3,"snapshot_sha256":"550418395becdf57129f122ca0b48b7fe55c9c45312b93db142eb381d10cc822"},"paper":{"abstract_excerpt":"We illustrate how to formally specify distributed algorithms as declarative axiomatic theories in a modal logic, using as illustrative examples a simple voting protocol, a simple broadcast protocol (Bracha Broadcast), and a simple agreement protocol (Crusader Agreement). The methods scale well and have been used to find errors in a proposed industrial protocol.\n  The key novelty is to use modal logic to capture a declarative, high-level representation of essential system properties -- the logical essence of the algorithm -- while abstracting away from explicit state transitions of an abstract ","authors_text":"Murdoch J. Gabbay","cross_cats":["cs.DC"],"headline":"Distributed algorithms admit declarative axiomatizations in three-valued modal logic over semitopologies.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-12-24T12:07:25Z","title":"Declarative distributed algorithms as axiomatic theories in three-valued modal logic over semitopologies"},"references":{"count":36,"internal_anchors":0,"resolved_work":36,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Ofer Arieli, Arnon Avron, and Anna Zamansky, Ideal paraconsistent logics, Studia Logica 99 (2011), no. 1-3, 31--60","work_id":"a5bd9eb4-eaae-415d-9f26-11a6704b4a31","year":2011},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Ittai Abraham, Naama Ben-David, and Sravya Yandamuri, Efficient and adaptively secure asynchronous binary agreement via binding crusader agreement, Proceedings of the 2022 ACM Symposium on Principles ","work_id":"fd7120de-2c35-411c-99e6-4aa79d99fcd5","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"184, Schloss Dagstuhl - Leibniz-Zentrum f \\\" u r Informatik, 2020, pp","work_id":"6d263d6d-7c5b-4534-bfda-2627e1202ce7","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"253, Schloss Dagstuhl - Leibniz-Zentrum f \\\" u r Informatik, 2022, pp","work_id":"adcf8f18-8e1a-4daa-ad98-b29c6a4cdac7","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Orestis Alpos, Christian Cachin, Bj \\\" o rn Tackmann, and Luca Zanolini, Asymmetric distributed trust, Distributed Computing 37 (2024), no. 3, 247--277","work_id":"714fcea5-77b6-4ab8-88b2-350c26440da7","year":2024}],"snapshot_sha256":"7075bf1f308fcb00cf836844a967c85b38cbf84e860446d2a9c2bef2af9ddb95"},"source":{"id":"2512.21137","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-16T19:48:45.345253Z","id":"5e90855c-1b7b-46e2-b2e0-ecb1a85026d2","model_set":{"reader":"grok-4.3"},"one_line_summary":"Distributed algorithms are expressed as axiomatic theories in three-valued modal logic over semitopologies, with examples including Bracha broadcast and Crusader agreement, and all proofs formalized in Lean 4.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Distributed algorithms admit declarative axiomatizations in three-valued modal logic over semitopologies.","strongest_claim":"We illustrate how to formally specify distributed algorithms as declarative axiomatic theories in a modal logic... using as illustrative examples a simple voting protocol, a simple broadcast protocol (Bracha Broadcast), and a simple agreement protocol (Crusader Agreement). The proofs in this paper have been formalised in Lean 4.","weakest_assumption":"That three-valued modal logic over semitopologies can faithfully capture the essential correctness and resilience properties of the target distributed algorithms without omitting critical behavioral details that only appear in concrete executions."}},"verdict_id":"5e90855c-1b7b-46e2-b2e0-ecb1a85026d2"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:989810bfcc2bc1ebe797b16467e1f39377352dd885edb70ad4079b513fa4860a","target":"record","created_at":"2026-05-18T02:45:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a45073e022c0761b22f65f181b76b501e2f86c32f251fd251303b51e864dcfce","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-12-24T12:07:25Z","title_canon_sha256":"db610e299948e8780635ef2b2da8ad23045e37747bb3d7d5cbed306f32505e37"},"schema_version":"1.0","source":{"id":"2512.21137","kind":"arxiv","version":3}},"canonical_sha256":"23f944c3a2dd3cddfab7f21a501555089c13af592fd740488ff6575255fb9684","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23f944c3a2dd3cddfab7f21a501555089c13af592fd740488ff6575255fb9684","first_computed_at":"2026-05-18T02:45:12.122431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:12.122431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7dHQnQtTXyxu0X5UmtxVfnGNm/wEx2HuTWPMJUn6yYrsqnO7BbLEvKFQLIl6LemmHK2oxeQUD3pDhbAMMTDyCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:12.122999Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.21137","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:989810bfcc2bc1ebe797b16467e1f39377352dd885edb70ad4079b513fa4860a","sha256:dad934d0766e2428be7d423fa85dc8a472b016163203099b2023871dee004b2c"],"state_sha256":"ec4d88f58210b3ccac6a4ba6e11a989bd0a4b7607bb3960e1c87d260048fd47f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kFYTDkVeJ/P3998BmRioiqlF0xYnwIsWAl+4DhjI9pr8aBNU5ZoAvR6472NWSfce6AD3/yiyqwg8SifGWp10Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:22:09.570517Z","bundle_sha256":"bb349baf74fe1c25b3b0ada4f5d7d30732463cfa90ee11cfc56a5bcb5b00673b"}}