Parano1d Lab · Technical research
Cryptographic protocols, verifiable-state architectures and research results produced during the development of Parano1d.
01 · Latest
How Parano1d v2 extends live value to programmable rights: signatureless authorization, post-quantum security under the published v2 assumptions, committed programs and counters, shared recursive execution, six application templates, portable receipts and recovery after offline pruning.
Verify the present. Know your rights. Keep your proofs. Build for those who come after us.
Each participant checks funding and authority through its own Agent Core and exchanges verifiable receipts with other agents. No explorer or hosted API decides what is valid. Parano1d makes this practical without downloading and replaying the network's full transaction history.
New papers on Poseidon2b, matrix backdoors, recursive Fiat-Shamir and soundness bounds, checked against Parano1d's production parameters.
Two block classes, one contract core and a 30-second target. The computational budget becomes an explicit network profile.
Height advances issuance. Occupancy prices live storage. Why the original monetary clock changed, and what remains worth conserving.
A network should not become less decentralized simply because it gets older.
Security belongs to an exact instance. Fix GF(2^128), width four, the matrices, 8+58 rounds and feed-forward mode, then apply the published attacks.
Can a blockchain validate its current state without replaying the entire execution history from genesis?
An executable end-to-end theorem accounts for the complete recursive State proof, parallel quantum-oracle access, coherent Poseidon2b response cost and every NIST MAXDEPTH point.
An exact Block–Tiwari analysis of Parano1d's production recursive State proof gives 127 provable and 127 conjectured bits against a 128-bit target.
FROST-GKR turns a complete batch of Poseidon2b into one three-column committed trace: 472 constraint sumchecks become 2.
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.
PCLMUL, VPCLMUL, AVX-512 and PMULL execute the same GF(2¹²⁸) arithmetic without changing witness layout or proof bytes.
Three Link groups and six Block groups share one ordered ragged 66-layer Poseidon2b walk instead of materializing nine verifier traces.
In an earlier 255-authorization layout, streaming compilation bounded 14–16 MiB of private input with 4.7% overhead. Its terminal proof missed the production latency budget.
Fusing two Merkle relations saved 5.94 KB but enlarged the combined multilinear trace and removed parallelism. Proving regressed from 2.68 to 4.50 seconds.
One owner produces one witness-hiding authorization capsule for a complete logical spend, while HistoryStep proves its transparent State transition.
A Poseidon2b source cap, authenticated tensor folds and one shared query set connect every compact FRI opening to its committed columns.
Ladder FRI exposed proof-byte cost, FRI-Binius exposed source binding, and BaseFold exposed the cost of putting a verifier inside its successor.
02 · Selected work
