Archive
18 artifacts published in this period.
A chain commits to a model's 32-byte hash for cents; keeping the gigabytes it points to retrievable is a separate, recurring bill. Pick a model and horizon and watch three rent-charging storage layers race Arweave's pay-once permanence to a crossover — plus the on-chain byte cost and cold-load wall.
Autonomous LLM firms undercut each other below unit cost in a race to bankruptcy, then survivors monopoly-price. Drag price discovery up to deepen the crash (the paper's counterintuitive result), or add stabilizer firms to rescue the market. Deterministic model of Agent Bazaar's 'The Crash'.
In decentralized RL the rollout worker acts with a policy several steps behind the trainer. Staleness g = broadcast time / step cadence. Pick a model and link, toggle sparse deltas, and watch g cross INTELLECT-2's demonstrated 4-step budget — full 32B weights blow right past it.
Proving an agent's top-k retrieval is real costs a sort over every scanned candidate, unless you prove a boundary instead. Drive top-k and the corpus preset; watch the in-circuit comparison count split into the flat boundary proof and the sort tax you skip, anchored to V3DB's measured 22x.
An inspection game between a solver and a verifier. Drag the operating rate and tune the bond, reward, and bounty to find p*, the minimum sampling rate that makes honest AI inference a dominant strategy — and watch it collapse without a bounty.
Seven ways to verify what an AI agent claims it did, plotted by latency added against the share of fabricated claims caught. Pick a claim type and watch it route to the cheapest sufficient verifier — a free chain receipt, a 12ms signed receipt, or a zkLLM proof reserved for the inference itself.
A data market can't pay you for your data's value AND protect it with one privacy budget ε. Drag ε: the worst-case leakage bound hits ≈100% by ε=8 — exactly where from-scratch models finally become usable. Real attacks sit far below the bound, and that gap is your only cover.
An on-chain agent is told to pay an invoice, but one MCP tool hides an instruction in its description that redirects the transfer to an attacker. Pick a defense layer — model, tool, client, policy, custody — and run it; alignment alone refused under 3% of these in MCPTox.
Under secure two-party inference, a transformer's cost is eaten by Softmax and GELU, not the matrix multiplies. Stacked per-operation communication and interaction rounds for one BERT-base block across Iron, BumbleBee, and Nimbus — the nonlinear activations are 80–95% of the bill.
A perpetual market maker's quote ladder. Avellaneda-Stoikov skews only for inventory; funding adds a second, signed skew that survives even at zero inventory. Drag the reservation line to set inventory, push funding and horizon, and watch the two skews stack or cancel.
On-chain cost of a query versus how much history it touches. Re-executing pays a cold SLOAD per value and hits the 60M block-gas wall — or can't reach the data at all. A coprocessor's proof verifies flat at ~300k gas whatever the size. Drag the cursor or pick a real query; the cyan line never moves.
Run a speculative-decoding round at a time: a cheap drafter proposes γ tokens, the target verifies them in parallel and accepts a prefix plus one free token. Drive α, γ, and drafter cost c; watch the accepted length converge to Leviathan's Ω and the speedup peak, then fade.