Janus

A computer flat enough to prove.

Most of a computer's complexity is elective — core types, memory tiers, a boot master. Janus keeps only the non-uniformity physics forces, distance, and treats it as a cost, not a rank. What's left is one cell, repeated: minimal hierarchy and maximal provability turn out to be the same objective.

One proved cell and one ISA run everything — the branch-free dataflow kernels and the general, self-hosting control code alike, differing in workload, not in silicon. Its semantics, arithmetic proofs, and generated RTL are checked together by a single lake build; the RTL is rendered from a Lean model whose execute path is proved to refine the ISA.

Read the book

Today: a proof-checked book and a first generated single-cell RTL, proved against the ISA, with golden tests and recorded sky130 synthesis. No silicon yet — the mesh and self-hosting are the direction, not the claim.