{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:C2BYJ6ND3UVPLFK34NJ362JGWR","short_pith_number":"pith:C2BYJ6ND","schema_version":"1.0","canonical_sha256":"168384f9a3dd2af5955be353bf6926b4430815598454708e7e04bfc9a9a95176","source":{"kind":"arxiv","id":"2604.06579","version":2},"attestation_state":"computed","paper":{"title":"SonicDB S6: A Storage-Efficient Verkle Trie for High-Throughput Blockchains","license":"http://creativecommons.org/licenses/by/4.0/","headline":"SonicDB S6 cuts live Verkle Trie storage 98% and archive storage 95% by exploiting a non-forking blockchain.","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Bernhard Scholz, Herbert Jordan, Lorenz Schuler, Luigi Crisci","submitted_at":"2026-04-08T02:07:12Z","abstract_excerpt":"The Ethereum state database uses Merkle Patricia Trie (MPT), which suffers from large witness proof sizes and high storage overhead. Verkle Tries have been proposed as a replacement, offering witness proofs below 150 bytes through vector commitments and Inner Product Argument aggregation. However, deploying a Verkle Trie in a high-throughput, short block-time blockchain such as Sonic, which produces a block every 300 milliseconds, introduces substantial engineering challenges related to storage efficiency, commitment computation costs, and the need to serve both live and historical state queri"},"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":"2604.06579","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-04-08T02:07:12Z","cross_cats_sorted":[],"title_canon_sha256":"abb8b0b507678260f799a714881af1d745a425250bd1a186815e536802c07577","abstract_canon_sha256":"c35438eab6ceacf228922605f2cd8d000f2d4ec39e47668831581c54fd13b7a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:30.946644Z","signature_b64":"gp56iJ5PVIayozqyg697SUdx3DU7WrJOG5qoi0ri0dZCbtLMS8wctn+ufq9i1DfQa96G3b40+rwObBgzCPbpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"168384f9a3dd2af5955be353bf6926b4430815598454708e7e04bfc9a9a95176","last_reissued_at":"2026-05-20T00:04:30.945871Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:30.945871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SonicDB S6: A Storage-Efficient Verkle Trie for High-Throughput Blockchains","license":"http://creativecommons.org/licenses/by/4.0/","headline":"SonicDB S6 cuts live Verkle Trie storage 98% and archive storage 95% by exploiting a non-forking blockchain.","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Bernhard Scholz, Herbert Jordan, Lorenz Schuler, Luigi Crisci","submitted_at":"2026-04-08T02:07:12Z","abstract_excerpt":"The Ethereum state database uses Merkle Patricia Trie (MPT), which suffers from large witness proof sizes and high storage overhead. Verkle Tries have been proposed as a replacement, offering witness proofs below 150 bytes through vector commitments and Inner Product Argument aggregation. However, deploying a Verkle Trie in a high-throughput, short block-time blockchain such as Sonic, which produces a block every 300 milliseconds, introduces substantial engineering challenges related to storage efficiency, commitment computation costs, and the need to serve both live and historical state queri"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"SonicDB S6, a production Rust Verkle Trie database for the Sonic blockchain, leverages its non-forking property to enable aggressive storage optimizations. Occupancy-aware node specializations, selected via an O(kn2) dynamic program, reduce live storage by 98%. Delta nodes that record only changed slots reduce archive storage by 95%. Batched updates, multi-threaded commitment computation, and homomorphic Pedersen caching yield 2.85x higher throughput than a persistent Geth Verkle baseline while sustaining production block-rate performance.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The Sonic blockchain's non-forking property can be safely leveraged to apply aggressive storage optimizations such as delta nodes for historical states without compromising real-time query serving or overall correctness.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"SonicDB S6 implements occupancy-aware node specializations via dynamic programming and delta nodes in a Verkle Trie to achieve major storage reductions and throughput gains for high-throughput blockchains.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"SonicDB S6 cuts live Verkle Trie storage 98% and archive storage 95% by exploiting a non-forking blockchain.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"866ccae93601741b65e746a4897600cf1176a56af032f41bd257e652687162ce"},"source":{"id":"2604.06579","kind":"arxiv","version":2},"verdict":{"id":"658ccfc3-6714-4926-b2df-32c7163cdc16","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T17:43:03.421010Z","strongest_claim":"SonicDB S6, a production Rust Verkle Trie database for the Sonic blockchain, leverages its non-forking property to enable aggressive storage optimizations. Occupancy-aware node specializations, selected via an O(kn2) dynamic program, reduce live storage by 98%. Delta nodes that record only changed slots reduce archive storage by 95%. Batched updates, multi-threaded commitment computation, and homomorphic Pedersen caching yield 2.85x higher throughput than a persistent Geth Verkle baseline while sustaining production block-rate performance.","one_line_summary":"SonicDB S6 implements occupancy-aware node specializations via dynamic programming and delta nodes in a Verkle Trie to achieve major storage reductions and throughput gains for high-throughput blockchains.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The Sonic blockchain's non-forking property can be safely leveraged to apply aggressive storage optimizations such as delta nodes for historical states without compromising real-time query serving or overall correctness.","pith_extraction_headline":"SonicDB S6 cuts live Verkle Trie storage 98% and archive storage 95% by exploiting a non-forking blockchain."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.06579/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":"2604.06579","created_at":"2026-05-20T00:04:30.945996+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.06579v2","created_at":"2026-05-20T00:04:30.945996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.06579","created_at":"2026-05-20T00:04:30.945996+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2BYJ6ND3UVP","created_at":"2026-05-20T00:04:30.945996+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2BYJ6ND3UVPLFK3","created_at":"2026-05-20T00:04:30.945996+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2BYJ6ND","created_at":"2026-05-20T00:04:30.945996+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C2BYJ6ND3UVPLFK34NJ362JGWR","json":"https://pith.science/pith/C2BYJ6ND3UVPLFK34NJ362JGWR.json","graph_json":"https://pith.science/api/pith-number/C2BYJ6ND3UVPLFK34NJ362JGWR/graph.json","events_json":"https://pith.science/api/pith-number/C2BYJ6ND3UVPLFK34NJ362JGWR/events.json","paper":"https://pith.science/paper/C2BYJ6ND"},"agent_actions":{"view_html":"https://pith.science/pith/C2BYJ6ND3UVPLFK34NJ362JGWR","download_json":"https://pith.science/pith/C2BYJ6ND3UVPLFK34NJ362JGWR.json","view_paper":"https://pith.science/paper/C2BYJ6ND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.06579&json=true","fetch_graph":"https://pith.science/api/pith-number/C2BYJ6ND3UVPLFK34NJ362JGWR/graph.json","fetch_events":"https://pith.science/api/pith-number/C2BYJ6ND3UVPLFK34NJ362JGWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2BYJ6ND3UVPLFK34NJ362JGWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2BYJ6ND3UVPLFK34NJ362JGWR/action/storage_attestation","attest_author":"https://pith.science/pith/C2BYJ6ND3UVPLFK34NJ362JGWR/action/author_attestation","sign_citation":"https://pith.science/pith/C2BYJ6ND3UVPLFK34NJ362JGWR/action/citation_signature","submit_replication":"https://pith.science/pith/C2BYJ6ND3UVPLFK34NJ362JGWR/action/replication_record"}},"created_at":"2026-05-20T00:04:30.945996+00:00","updated_at":"2026-05-20T00:04:30.945996+00:00"}