Nodes, indexers, RPCs, GPUs, and the operational backbone of AI and chain systems.
Ethereum's 12-second slot clock creates a hard lower bound on AI agent state freshness. Here's what that means for liquidators, arbitrageurs, and yield rebalancers — and how to engineer around it.
Five builders now win 96.7% of Ethereum blocks. Their edge isn't compute — it's exclusive orderflow: 12% of transactions that generate 54.59% of block value. AI agents transacting in public have to understand where they sit in that hierarchy — and when a preconfirmation changes the math.
DeepSeek-R1 emits 8,400 thinking tokens before a 341-token answer on hard math. Every existing on-chain verification scheme — TEE, optimistic, ZK, sampling — was designed when computation and output were proportional. They aren't anymore.
Cross-chain bridges have lost $2.5B to hacks because receiving contracts accept messages they cannot cryptographically verify. AI agents operating across chains inherit this exact problem. Here are the four trust models, their real security parameters, and a principled agent policy.
MORPH shows that a TPU v6e8 pod runs NTT at 40× CPU — 10× faster than an H100. The same silicon that accelerates AI inference now accelerates ZK proof generation, and the math that explains it is the same in both cases.
Long-context AI's real bottleneck isn't proof overhead — it's the KV cache. At 128K tokens, Llama 3.1 8B's KV state equals its own weights (15 GiB), pinned to one node per request. The formula, the GPU math, and why prefix caching demands stickiness that decentralized routing can't provide.
ZKLoRA lets a LoRA seller prove adapter compatibility with your base model without exposing the weights. The verifier checks in 1–2 s — but the prover bears 31–74 s per module, and the protocol is interactive, which puts trustless on-chain settlement just out of reach.
An AI inference that runs inside a TEE proves it with an attestation quote. A smart contract can check that quote — for ~4-5M gas naively, down to a flat ~290k once a zkVM compresses it. But every gas unit buys a chip vendor's signature, and in 2025 a $1,000 interposer forged one.
Frontier open models are now Mixture-of-Experts — cheap to serve in a datacenter, nearly impossible across the internet. The all-to-all expert shuffle moves ~9.5 MiB/token and caps decode at ~67 tok/s even on 400G InfiniBand; on internet links it falls to seconds per token.
Speculative decoding lets a small, even adversarial, drafter propose tokens that a big model verifies in parallel — and the output is provably the big model's, unchanged. Real drafters land at α ≈ 0.6–0.8 for a ~2× win. But the verifier still runs every token, so it's a latency win, not a trust win.
An on-chain agent acts on facts it reads from an RPC it has to trust. ZK coprocessors swap that trusted read for a proof — and the punchline is succinctness: proving a query over a year of blocks verifies for the same flat ~300k gas as one slot. The mechanism, the anchor problem, real-time proving.
Decentralized AI networks have to turn many validators' subjective quality scores into one reward number. Bittensor's Yuma Consensus uses a stake-weighted median and clips the rest — robust to a <50% bloc. Then a parasite shows up: copying the consensus pays better than producing it.