Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
41 commits
Select commit Hold shift + click to select a range
3cc1593
Prove in Lean that Palmer's 168 is a self-interpreter
a9lim Oct 20, 2026
f5c6315
Prove in Lean that the 165-bit interpreter is a self-interpreter
a9lim Oct 20, 2026
11e0aaa
Record the 165-bit self-interpreter: sources, searches and variants
a9lim Oct 20, 2026
cce583e
Rewrite the self-interpreter record around the 165
a9lim Oct 20, 2026
fcb94da
Carry the 165's reader into int4, ko2kp, nf and pairup_Kp
a9lim Oct 20, 2026
ea7313b
Record the reasoning consults on the 165: shape bounds, exclusions, a…
a9lim Oct 20, 2026
056ad0e
Drop the CLAUDE.md shim: Claude Code reads AGENTS.md directly
a9lim Oct 20, 2026
6e82029
Prove self-interpreter structure and add checked normal witnesses
a9lim Oct 20, 2026
c66a3f0
Record Scott-handler recursion and its adapter cost
a9lim Oct 20, 2026
8837d4c
Kernel-check the simply typed normal interpreter
a9lim Oct 20, 2026
7b750e1
Prove interpreter code copying and control obstructions
a9lim Oct 20, 2026
904ae39
Bound correlated selector handlers and eliminate neutral skips
a9lim Oct 20, 2026
cd511bd
Construct applicative remainder boxes and identify alias obstruction
a9lim Oct 20, 2026
706ba00
Bound whole-stream handlers and cheap-tail lambda counts
a9lim Oct 20, 2026
c6daebc
Prove scoped cheap-reader shape and compression constraints
a9lim Oct 20, 2026
5253956
Prove exact remainder parsing and beta wire costs
a9lim Oct 20, 2026
78a70bc
Credit OEIS A333479 for the BBλ values and drop the census bound past 35
a9lim Oct 20, 2026
6381bbb
Record the second golf round: 40 programs, 1,143 bits, upstream as tr…
a9lim Oct 20, 2026
071fa6f
PR kit: note the #13 summary comment is posted
a9lim Oct 20, 2026
917e4bf
Prove remainder nonlinearity and close self-applied skip bound
a9lim Oct 20, 2026
28fe2bd
Prove inert operand replacement and narrow whole-stream handlers
a9lim Oct 20, 2026
11df0c7
Prove head-clock monotonicity and remainder code growth
a9lim Oct 21, 2026
9755d09
Mechanize remainder growth components and narrow compressed readers
a9lim Oct 21, 2026
67af7cf
Prove unavoidable remainder code growth with source origins
a9lim Oct 21, 2026
ca07a01
Narrow normal and compressed cheap-reader shapes
a9lim Oct 21, 2026
f2ec96b
Complete the conditional cheap-reader lower bounds
a9lim Oct 21, 2026
0f2fae6
Construct a parser sharing its generator with value application
a9lim Oct 21, 2026
1032ea0
Prove a 70-bit suffix parser and sharpen interpreter structure bounds
a9lim Oct 21, 2026
a409a39
Prove nonlinear branching obstruction and record self-passed interpreter
a9lim Oct 21, 2026
1294c4a
Raise the self-interpreter floors to 37 handwritten and 27 in Lean
a9lim Oct 21, 2026
f13d3f3
Record the reviewed dispatch obstructions and NEXT dispatch catalogue
a9lim Oct 21, 2026
94c692c
Record the 162-bit self-interpreter, with 172 and 184 universal machines
a9lim Oct 21, 2026
5d27a33
Record the golf lanes on the 162: no sub-162, variants 163-196
a9lim Oct 21, 2026
da5b325
Record a second sub-165 architecture: a 164 with a dual skip operand
a9lim Oct 21, 2026
ae0f475
Archive the Claude NEXT-proof lane (unreviewed conditional 92)
a9lim Oct 21, 2026
33a9d8b
Carry the 162's reader to int4: 175 -> 172
a9lim Oct 21, 2026
a923af9
Archive the reader zoo: 44 bodies, 84 splices, nothing below 162
a9lim Oct 21, 2026
8e0a2bc
Record the 162's reader on the golf branch, and the PR edits for a9
a9lim Oct 21, 2026
798e37c
Polish the record after the 162
a9lim Oct 21, 2026
f635e4d
Release 3.0.1
a9lim Oct 21, 2026
9aa6f92
Prove in Lean that the universal machines are universal
a9lim Oct 21, 2026
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
The table of contents is too big for display.
Diff view
Diff view
  •  
  •  
  •  
1 change: 0 additions & 1 deletion CLAUDE.md

This file was deleted.

2 changes: 1 addition & 1 deletion Cargo.lock

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

2 changes: 1 addition & 1 deletion Cargo.toml
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
[package]
name = "blam"
version = "3.0.0"
version = "3.0.1"
edition = "2021"
rust-version = "1.87"
description = "Binary lambda calculus engine for algorithmic information theory: John Tromp's blc and uni, exhaustive term censuses, busy-beaver frontiers, exact Solomonoff/Kolmogorov measurements"
Expand Down
48 changes: 27 additions & 21 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -81,13 +81,14 @@ tools.
## Results

The classical census covers all 526,039,969 closed terms through 41 bits.
With kernel-checked adjudications of every program it leaves open at those
sizes, it establishes **BBλ(33) = 1,812**, **BBλ(34) = 327,686**, and
**BBλ(35) = 38,127,987,424,941 normal-form bits**, the last a symbolically
proved Church numeral 3^27; the exhaustive census itself remains a Rust
computation ([proof record](docs/classical/certificates/busy-beaver.md),
formalizing Tromp's hand arguments). It also gives
BBλ(41) ≥ 38,127,987,424,947 and the finite-range halting mass
With kernel-checked adjudications of every program it leaves open at 33–35
bits, it independently confirms Tromp's busy-beaver values
**BBλ(33) = 1,812**, **BBλ(34) = 327,686**, and
**BBλ(35) = 38,127,987,424,941 normal-form bits**
([OEIS A333479](https://oeis.org/A333479)), the last a symbolically proved
Church numeral 3^27; the exhaustive census itself remains a Rust computation
([proof record](docs/classical/certificates/busy-beaver.md), formalizing
Tromp's hand arguments). It also gives the finite-range halting mass

```text
Omega|<=41 in [0.124105086841, 0.124105091271]
Expand Down Expand Up @@ -116,18 +117,23 @@ proven.
and time spectra, with post-certificate open mass below 3.19×10⁻¹² on the β
clock.
- **The self-interpreter** ([interpreter](docs/classical/self-interpreter/interpreter.md)):
nothing below Sean Palmer's 168 bits in any searched space — exact let
structure, the βη component to +24, parametric and contextual slot
searches, joint two-hole searches, and over a hundred protocol changes —
and a conditional lower bound: each of its seven modules is the unique
minimum of its own law, and the minima sum to exactly 168. The universal
machine has nothing below Tromp's 178 (non-strict) and 190 (strict) in the
searched wirings ([universal](docs/classical/self-interpreter/universal.md)).
- **The rest of tromp/AIT** ([golf](docs/classical/golf.md)): the IOCCC
BLC8 universal machine shrinks from 43 bytes to 41 (strict) and 38
(non-strict), the bytewise BLC2 machine from 500 to 399 bits, the programs
behind the KP ≤ KO + c and symmetry-of-information constants by up to 77
bits, and 45 programs under certified β-golf alone.
162 bits, six below Sean Palmer's 168. Its reader applies the input stream
to the identity, so the first cell selects its own tail as the zero branch,
and passes the parser's second-bit stage as an operand that the variable
branch erases. Lean proves it correct for every closed program, as it does
the previous record, the 165, and the 168. Nothing smaller appears in its
let structure or its βη components. Every self-interpreter has at least 37
bits by a reviewed handwritten proof, and at least 27 kernel-checked in Lean
([global floor](docs/classical/self-interpreter/global-floor.md)). The same
reader gives universal machines of 172 (non-strict) and 184 (strict) bits,
against Tromp's 178 and 190, and Lean proves all four universal
([universal](docs/classical/self-interpreter/universal.md)).
- **The rest of tromp/AIT** ([golf](docs/classical/golf.md), sent upstream as
[tromp/AIT#13](https://github.com/tromp/AIT/pull/13)): 40 programs shrink by
1,159 bits in all. The IOCCC BLC8 universal machine goes from 43 bytes to 38
(strict) and 36 (non-strict), the bytewise BLC2 machine from 500 to 390
bits, KP(x) ≤ KO(x) + c from c = 615 to 540, the symmetry-of-information
constants by up to 132 bits, and Loader's number fits in 1781 bits.

The qBLC operator census covers the same population. Its successful mass is
`3424188513 / 2^40`; entangled successful outputs first occur at 41 bits.
Expand Down Expand Up @@ -353,7 +359,7 @@ says how to get them rather than pretending they do not exist.
| `qalc run` / `gram` / `compile` / `fixtures` | exact qALC evolution, Gram audits, the H/T/CNOT circuit compiler, and fixture regeneration |
| `qalc census` | exact finite-clock `p h t` census with Ω brackets, optional sparse `M` output, and the `--speed` arrival spectrum with certified Ω_speed brackets |
| `slots` *(lab)* | exhaustive self-interpreter slot searches |
| `selfint ctx` / `hole` / `wiring` *(lab)* | searches below the 168 and the universal machine: contextual slots, one- or two-hole sketches of any interpreter, every wiring around the parser |
| `selfint ctx` / `hole` / `wiring` *(lab)* | searches below the self-interpreter and the universal machine: contextual slots, one- or two-hole sketches of any interpreter, every wiring around the parser |

```bash
cargo build --release # everything not marked (lab)
Expand Down Expand Up @@ -430,7 +436,7 @@ guarantees, and records of what the measurements and searches establish.
| classical engine | [architecture](docs/classical/architecture.md), [running programs: notation, blc, uni](docs/classical/programs.md), [speed prior](docs/classical/speed.md) |
| classical results | [bits of Ω](docs/classical/omega.md), [coding theorem](docs/classical/coding.md), [AIT golf](docs/classical/golf.md) |
| certificates | [specification](docs/classical/certificates/specification.md), [frontier maps](docs/classical/certificates/frontier.md), [BB(33/34/35)](docs/classical/certificates/busy-beaver.md), [Lean](lean/README.md) |
| self-interpreter | [the 168](docs/classical/self-interpreter/interpreter.md), [universal machine](docs/classical/self-interpreter/universal.md), [slot searches](docs/classical/self-interpreter/slots.md) |
| self-interpreter | [the 162](docs/classical/self-interpreter/interpreter.md), [global floor](docs/classical/self-interpreter/global-floor.md), [universal machine](docs/classical/self-interpreter/universal.md), [slot searches](docs/classical/self-interpreter/slots.md) |
| qBLC | [architecture](docs/quantum/architecture.md), [frontier adjudication](docs/quantum/escalation.md), [Galois structure](docs/quantum/galois.md), [odd-sector search](docs/quantum/oddmin.md), [bisimulation](docs/quantum/bisimulation.md) |
| qALC | [architecture](docs/quantum-algebraic/architecture.md), [token machine](docs/quantum-algebraic/token.md), [kernel register](docs/quantum-algebraic/kernel.md), [instance identity](docs/quantum-algebraic/instance-identity.md), [objects](docs/quantum-algebraic/objects.md), [speed prior](docs/quantum-algebraic/speed.md), [Rust pillar](docs/quantum-algebraic/rust-pillar.md), [reference and proof records](qalc/README.md) |

Expand Down
Loading
Loading