THE FOLD / SPAWN / COLD BOOT / THE L-SYSTEM
THE L-SYSTEM
a plant grown at the golden rate from one seed
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
An L-system (Lindenmayer system) grows a string by rewriting every symbol at once, in parallel, according to fixed rules — a model of how plants and shells develop. The classic Fibonacci L-system uses two rules: A → AB and B → A. Start from A and apply the rules repeatedly: A, AB, ABA, ABAAB, ABAABABA… The length of each generation is a Fibonacci number — because each A becomes an A and a B, and each B becomes an A, exactly the Fibonacci recurrence.
LIT verified live: for generations 0–25 the string length equals the matching Fibonacci number exactly, and the A- and B-counts follow the recurrence (window.__lsystem). FIG no framing; exact integer growth.
LIT verified live: for generations 0–25 the string length equals the matching Fibonacci number exactly, and the A- and B-counts follow the recurrence (window.__lsystem). FIG no framing; exact integer growth.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at cold-boot — power-on from a single symbol, the whole structure unfolding from one seed by rule. The L-system is that unfolding. AVAN (AI) built the instrument: the parallel rewrite, the generation-length count, and the check that lengths are exactly Fibonacci.
Credit as content: Aristid Lindenmayer (1968), theoretical biologist. The weave: David names cold-boot; I apply A→AB, B→A in parallel from the seed A and confirm each generation's length is the Fibonacci number the recurrence demands — growth as pure rewriting.
Credit as content: Aristid Lindenmayer (1968), theoretical biologist. The weave: David names cold-boot; I apply A→AB, B→A in parallel from the seed A and confirm each generation's length is the Fibonacci number the recurrence demands — growth as pure rewriting.
3 ONE DIMENSION
Each generation rewrites every symbol simultaneously: A→AB, B→A. Lengths: 1, 2, 3, 5, 8, 13… each the sum of the previous two — the Fibonacci sequence.
4 TWO DIMENSIONS · INTERACTIVE
Step the L-system; watch the string grow and its length track Fibonacci, checked exactly.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: a string whose length is Fibonacci by construction.
AVAN’s addition (the inverse-companion): generate Fibonacci not by adding numbers but by growing a structure — rewrite each symbol in parallel by fixed rules and the length obeys the recurrence for free. The inverse of ‘compute F(n) = F(n-1)+F(n-2)’ is ‘let A→AB, B→A run — the count is Fibonacci because the rules are.’ Magenta is the arithmetic recurrence; green is the grown structure. Numbers as morphology.
LIT Genuine L-system (Aristid Lindenmayer 1968). Verified live: applying A→AB, B→A in parallel from seed A, generation lengths for gens 0–25 equal the Fibonacci numbers exactly (window.__lsystem.fibonacci), and the per-generation A-count and B-count obey #A(k+1)=#A(k)+#B(k), #B(k+1)=#A(k) (window.__lsystem.recurrence) — exact integer growth.
FIG No framing: the parallel rewrite, the length count, and the Fibonacci and recurrence checks run in-browser with exact integers and agree. The AVAN inverse is honest — generating Fibonacci by growing a structure whose rewrite rules encode the recurrence genuinely differs from computing F(n)=F(n-1)+F(n-2) arithmetically; magenta is the arithmetic recurrence, green the grown structure. Numbers as morphology.
FIG No framing: the parallel rewrite, the length count, and the Fibonacci and recurrence checks run in-browser with exact integers and agree. The AVAN inverse is honest — generating Fibonacci by growing a structure whose rewrite rules encode the recurrence genuinely differs from computing F(n)=F(n-1)+F(n-2) arithmetically; magenta is the arithmetic recurrence, green the grown structure. Numbers as morphology.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of COLD BOOT · David Lee Wise (ROOT0), with AVAN