Archive
137 artifacts published in this period.
An interactive Merkle tree: click any leaf to watch its hash cascade hop by hop to the root, with the sibling hashes that form the inclusion proof highlighted along the way — four hashes prove one of sixteen leaves.
The KZG polynomial commitment scheme, stepped through. Pick an evaluation point z on the cubic P(x) = x³−2x²−x+2 to watch the opening proof π materialize, see the pairing check pass, then corrupt π to make it fail — and read why 50,000 gas ($0.067) is all Ethereum needs to verify any such claim.
Explore how Uniswap v4's 14-bit permission bitmap maps to pool lifecycle callbacks. Toggle bits or select preset patterns to see which hook functions fire for each operation.
A glowing marker performs literal gradient descent over a 3D loss landscape — analytic gradients, momentum, and a fading trail. Drag to orbit the terrain; click anywhere on it to drop a new starting point.
Train a model on its own output, generation after generation. Each step draws a finite sample of size M and refits — so the tails starve first and the curve collapses toward a spike. Toggle replace vs accumulate: replace drives σ̂ toward zero, accumulate holds it. A copy of a copy of a copy.
Proof sizes for six ZK schemes at 1,000 computation steps — hover or tap a row to see the trust model, setup requirement, and primary source. Folding-based IVC (Nova, HyperNova) holds constant; batch STARKs and separate Groth16 proofs grow with depth.
An agentic audit swarm's load-bearing stage: hypothesis particles leave the contract and hold at the falsifier gate while a proof-of-concept runs — hallucinated findings burst into debris, executable ones pass into the report. Tap a code line to plant a bug and watch the swarm catch it.
Run the same emission-capture attack against both of Bittensor's allocation regimes: a refundable constant-product price pump (dTAO, pre-Nov 2025) versus an EMA-smoothed staking flow with a 30-day half-life (TaoFlow). Real protocol constants show why one pays instantly and the other decays.
A fraud-proof dispute game you can rig: tap any step of the computation trace to plant a fault, then watch the chain bisect proposer vs watcher commitments — six queries isolate the one divergent step, it gets re-executed on-chain, and the liar's bond is slashed.
Six cross-chain protocols mapped as a trust topology. Each connects Ethereum to other chains — but their security assumptions span multi-sig keys to ZK consensus proofs. Tap a protocol to see its trust threshold, verification gas, and hack history.
Render's Burn-Mint Equilibrium with the real protocol constants: drag the demand and price sliders to see monthly burns race the 492,132 RENDER emission schedule, toggle RNP-023's Salad flows on, and find the demand level where the network actually stops inflating.
A live 3D peer-to-peer network: nodes on a fuzzy sphere, gossip links between nearest peers, and transaction pulses propagating hop by hop across the topology.