O(1) Lab · Technical research
Cryptographic protocols, verifiable-state architectures and research results produced during the development of ParanO(1)d.
01 · Latest
This analysis evaluates committed ParanO(1)d production parameters under the classical conventions published by Plonky2, RISC Zero and ethSTARK. It separates conjectured scores from finite theorem-backed bounds and pins every reported value in executable Rust calculations. Each value is compared only within its named metric.
A three-column committed trace reduces an entire batch of Poseidon2b executions with two constraint sumchecks.
HistoryStep is the recursive proof of a block's state transition. B64 handles up to 64 user transaction pages and meets the preparation budget on the reference laptop; B255 extends the same relation to the 255-page block limit. Measurements found no useful operating range for a third class.
An early design accepted a block first and produced its recursive proof later in the background. The canonical chain could therefore move ahead of the HistoryStep-proven tip, forcing nodes to persist and recover a second queue. The production design accepts the block and its matching HistoryStep together: one atomic object, one canonical height and no deferred proof backlog.
HistoryStep binds every semantic header field under a nonce-free domain. PoW can vary the nonce without rebuilding the transition proof.
A joining node validates headers, verifies one recursive transition proof at a finalized boundary, installs exact live State and applies no more than eighteen recent blocks.
A monotone creation identifier inside the existing value lane invalidates stale slot openings without a second consensus root or reuse quarantine.
02 · Selected work