NTH

AI with Authority, from Application to Silicon

AuthorsJason Hickey

August 31, 2026 2 min read
Watch on YouTube
The one-line take

One researcher uses AI agents and machine-checked verification to move from software ideas to a taped-out RISC-V chip without writing RTL by hand.

Key results

2,087
Mathematics commits

Commits produced across 37 days in the mathematics repository.

0
Incorrect proofs reaching record

No incorrect proofs entered the formal record because the Lean 4 kernel rejected them.

31.9%
Kernel-emitted flip-flops

288 of 902 sequential flip-flops in the measured silicon submission were emitted from Lean-checked artifacts.

28.07M
Metered output tokens

Output tokens recorded across 36,844 deduplicated requests during the preregistered 4.86-day window.

What the paper found

The paper presents the Salt method, a workflow for directing autonomous AI engineering under machine-checked authority rather than trusting model output. Using five agent seats and consumer subscriptions running Claude-family models from Anthropic, one researcher spent five weeks building a verified stack from application code through a compiler, multitasking executive, and RISC-V processor design submitted to a community silicon shuttle, without human-written RTL or human review of proofs. Each task produces an implementation, specification, Lean 4 kernel-checked proof, adversarial tests, and a weaker certificate for human-readable review; mathematical claims are checked by Lean 4 against mathlib, while hardware correspondence and synthesis links use SAT-based equivalence checking in Yosys. The demonstration generated 2,087 mathematics commits in 37 days and recorded 0 incorrect proofs reaching the formal record, while an error ledger numbered catches through #256. At the silicon boundary, 288 of 902 sequential flip-flops in the measured submission were emitted from kernel-checked Lean artifacts, or 31.9 percent; the design was submitted, not yet physically fabricated. A preregistered 4.86-day meter captured 28.07M output tokens across 36,844 deduplicated requests and 56,951 inserted Lean lines. The central result is economic and organizational: when generative models produce artifacts rapidly but unreliably, formal verification becomes the enabling control layer, reserving human attention for requirements, designs, and irreversible rulings rather than routine proof inspection.

Original abstract

For sixty years, machine verification has been a major cost overhead, affordable only for exceptional artifacts. Here we report that generative AI inverts this relationship: at AI speed, machine verification is not only economical but essential to productivity --- it is the incorruptible referee that lets one person safely direct autonomous machine work at scale. In five weeks, one researcher on consumer AI subscriptions directed a small fleet of AI agents from application code, through a verified compiler and executive, to a RISC-V processor taped out on a community silicon shuttle; no proof passed through human review, and no RTL was written by a human. The working discipline --- the Salt method --- rests on a proof kernel no hallucinated proof can pass: mathematical claims travel between agents as kernel-checked artifacts, and human attention is reserved for statements, designs, and rulings. Verification is stated link by link, from the Lean 4 kernel to SAT-checked equivalence at the silicon boundary. We publish the complete accounting: theorem provenance, a pre-registered token meter, floor-bounded human time, and an error ledger whose catch numbering runs to #256 --- a monotone counter over the mathematics campaign's append-only flags ledger, maintained 2026-07-07 to 2026-07-20 (one number, #79, was never assigned; later catches are recorded un-numbered) --- against zero incorrect proofs reaching the record.

Read the original paper

More in AI Hardware

Browse all 34 papers →