Governance

Rapidblocks with split proofs: execution proofs that outlive their state

Read full article at source ↗

Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 14/10/2026, 12:17:28 UTC.

Briefings

The article proposes 'split proofs' for the rapidblocks consensus model, dividing execution proofs into three parts: one for inputs, one for outputs, and one for the expensive EVM execution. This approach allows the proof to commit to block inputs rather than a pre-state root, enabling validity across state changes that miss those inputs. The authors outline a pipelined consensus where validators re-execute blocks before voting, and a window vote determines block values per slot. Key parameters include a slot time of 2 seconds, a network bound of 0.5 seconds, a window size of 4, and a vote cadence of 1 round.

Key points

• Split proofs divide execution proofs into three components: inputs, outputs, and the expensive EVM execution, allowing the proof to commit to block inputs instead of a pre-state root.
• The proposed parameters for the rapidblocks model include a slot time of 2 seconds, a network bound of 0.5 seconds, a window size of 4, and a vote cadence of 1 round.

Context and limitations

The design remains unproven; no simulation or measurement of the design itself exists. The block-level rules pass property tests in a small executable model, but none of it is formally proven.

Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 15/10/2026, 03:50:36 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.

View archived briefing on IPFS
bafybeihfodf6ok4deqdwgrfal4hgyvwbjhdpmxdujt4a544z6b7sontzhm