Parano1d v2. From live value to live rights.
Post-quantum, proof-native smart contracts: programmable rights that remain verifiable after their interaction history is pruned.
Research archive
All research
Papers, protocol notes, engineering studies and their results. Ordered by the date each research result was recorded.
↗
ONETHICS ①
Verify the present. Know your rights. Keep your proofs. Build for those who come after us.
Live Agents. Autonomy without trusted APIs.
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.
September Security Report
New papers on Poseidon2b, matrix backdoors, recursive Fiat-Shamir and soundness bounds, checked against Parano1d's production parameters.
Parano1d v2. Capacity and consensus
Two block classes, one contract core and a 30-second target. The computational budget becomes an explicit network profile.
Parano1d v2. Tokenomics
Height advances issuance. Occupancy prices live storage. Why the original monetary clock changed, and what remains worth conserving.
Decentralization Across Time
A network should not become less decentralized simply because it gets older.
Poseidon2b Is Secure!
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.
The Present Must Prove the Past
Can a blockchain validate its current state without replaying the entire execution history from genesis?
Parano1d meets NIST PQC Category 1
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.
FS-FRI security in Parano1d: a Block–Tiwari analysis
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: a global trace protocol for batched Poseidon2b
FROST-GKR turns a complete batch of Poseidon2b into one three-column committed trace: 472 constraint sumchecks become 2.
Why a block is accepted only with its recursive proof
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.
Prove the block once, then search the nonce
HistoryStep binds every semantic header field under a nonce-free domain. PoW can vary the nonce without rebuilding the transition proof.
Bootstrapping from proof-carrying State
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.
Replacing a consensus quarantine with UTXO incarnations
A monotone creation identifier inside the existing value lane invalidates stale slot openings without a second consensus root or reuse quarantine.
One proof format across four hardware paths
PCLMUL, VPCLMUL, AVX-512 and PMULL execute the same GF(2¹²⁸) arithmetic without changing witness layout or proof bytes.
One global Poseidon walk replaces nine verifier walks
Three Link groups and six Block groups share one ordered ragged 66-layer Poseidon2b walk instead of materializing nine verifier traces.
AuthStream: bounding a block-wide authorization workload
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.
The proof got 20% smaller and 68% slower
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, one authorization proof
One owner produces one witness-hiding authorization capsule for a complete logical spend, while HistoryStep proves its transparent State transition.
Source binding for compact mixed openings
A Poseidon2b source cap, authenticated tensor folds and one shared query set connect every compact FRI opening to its committed columns.
Three polynomial-commitment experiments and the bottlenecks they exposed
Ladder FRI exposed proof-byte cost, FRI-Binius exposed source binding, and BaseFold exposed the cost of putting a verifier inside its successor.
No research matches this filter.