The Origin of Life as a Solvable Problem
Investigating the origin of life with artificial intelligence · 20 November 2026

Making the origin of life a solvable problem

By any account, E. coli is a very skilled self-replicator. Presumably, though, the first successful self-replicator was far less skilled: just barely able to persist, and only with substantial help from its environment. So asking about the origin of life means asking how bad something can be at self-replication and still persist with that help, and what it takes to keep persisting as the help is withdrawn.

When people hear "origin of life", they usually think of a story: a possible scenario, set in a warm pond or at a deep-sea vent. Those who know the field also know that the early Earth left no fossils of the first replicators, so any such story is at best an educated guess. Sceptics go further: Fred Hoyle compared the chance assembly of a cell to a tornado sweeping through a junkyard and assembling a Boeing 747. In those terms the problem cannot be solved. There is no way to check a story against a record that doesn't exist, and no way to argue with odds that are posed as one enormous draw.

We change the terms. Instead of proposing a scenario, we derive what must have been true however cells arose, using information and time as resources, and we read other people's measurements against those bounds.

The question turns into a short list of constraints on counts of parts over time, and information theory lets us state them quantitatively. The page starts from the structure of self-replication. Part 1 builds the units: possibilities and copies on one scale, then the environment on that same scale as a vector of resources it supplies for free. A lineage then traces a trajectory through a space of information and time, which we call the phase space of the living state. Laws and constants come next. Part 2 writes coming alive as constraints on that trajectory, in the order they must be met. The last section shows how close a first path now is, and what a wet lab could do with it.

For experimental labs: thirteen unmeasured numbers would decide a first path to a cell, each with a threshold and what it opens or closes. See the measurements and get in touch →
0 · THE STRUCTURE OF THE PROBLEM

How bad can a self-replicator be?

Two observations come before any chemistry: self-replication is a matter of counts, and a replicator must eventually separate from the environment that helps it. Everything later on this page follows from them.

  • Self-replication is a matter of counts. A replicator persists when every part it needs is remade at least as fast as it is lost: by decay, by errors, by copies that never finish, by dilution at division. A copy works only if every part it needs works, so survival fractions multiply across parts. So the requirements are counts of parts made, kept and lost, per copy and per generation.
  • The environment is the driver, and the replicator must separate from it. At first the setting supplies much of what is needed: monomers, energy, cycling, compartments, even dispersal. But anything the environment supplies, a lineage cannot take with it. Persisting only while the setting does the work is not yet persisting on one's own. So we take as the endpoint the first replicator able to leave the setting that made it possible, and ask what it must have internalized, and in what order.
  • Why bits. Survival fractions multiply along every chain of copies, and their logarithms add. Taking log₂ of each ratio of counts puts every requirement on one additive scale. "How bad can it be?" then becomes two precise questions: how many bits must it specify, and how many bits per copy can it afford to lose?
0 · THE ANSWER TO HOYLE

One draw versus a ratchet

The junkyard-tornado argument prices a cell as one draw. All of its bits have to be found at once, against one budget.

Bits add along a path, because the log of a product is a sum. A step that is kept does not have to be found again, so each step is searched against its own budget. The bits measure cost, not improbability.

Staging works only if every landing holds. That moves the hard question from probability to rates: can the lineage pay its rent at every step?

Part 1 explains how each step on the staircase has two prices: a search cost, paid once to find it, and a maintenance cost, paid every generation to keep it.

Show the math
2−(b1+b2+…) = 2−b1 · 2−b2 ⋯ but each bi ≤ log₂ Mi, provided step i is kept
What adds and what doesn't: search bits add, and per-copy rents add, because survival probabilities multiply. Per-division erosions do not add part by part: near the keep limit, an added part's per-division cost is about half its per-copy rent.
0 · TWO REPLICATORS

From E. coli to the first copier

Rent is what copying loses, measured in bits per copy: log₂ of copies made for each copy that works. Compare two replicators. E. coli is a modern bacterium. QT45 is a ribozyme, an RNA molecule that does the job of an enzyme; this one copies RNA. Reported in 2026 by Philipp Holliger's group at the MRC Laboratory of Molecular Biology, it is only 45 nucleotides long, and in ice it can make both its complementary strand and a copy of itself, slowly and at low yield. It is the closest thing yet to the kind of copier the first replicators needed.

Example: Eigen's paradox. Eigen showed in 1971 that a replicator can keep only about 1/ε sites, where ε is its error rate per site: no long genome without an accurate copier, and no accurate copier without a long genome. Posed that way, it is a closed loop. In the ledger, our running account of what each step costs and what pays for it, it becomes an inequality:
Rc  <  Rc*
The rent per copy must stay below what the lineage can buy back, with every payer counted. Those payers are copy number, completion, and the environment's help.
ReplicatorRatio of counts, per genome copyRent per copy
E. coliabout one new mutation per few hundred genome copies (Drake's rule: a nearly constant mutation rate per genome across microbes)≲ 0.005 bits
QT45 (an RNA copier)about one working copy in 2,500, mostly from copies that don't finish11.3 bits

The origin of life lies somewhere along that gap. The rest of this page asks where along it a lineage could first persist on its own, and what had to pay the difference. (The E. coli figure counts errors only, and counts every site as constrained, so it is an upper bound.)

Part 1

Where the bits come from

Every bit in the ledger is log₂ of a ratio of two counts that could, in principle, be counted at the bench. Mass and energy have no axes of their own: mass limits how many copies can be made, and a free-energy difference buys discrimination, which is measured in bits. Two other kinds of constraint sit beside the bits and are marked as such: concentration inequalities (how much Mg²⁺ a membrane tolerates) and order constraints (which step must come first).

A · FINDING AND KEEPING

Two costs, one decomposition

Every step toward a cell costs something twice: once to find it, and again on every copy to keep it.

Teal marks finding. Teal bits count possibilities: how much of sequence space a function must pin down. They are a stock, paid once.

Amber marks keeping. Amber quantities are bit rates: log₂ fold change per copy or per generation, so one bit per generation is one doubling per generation. A PCR user already thinks in these units. They are a flow, paid continuously, so they are never added to bits.

Each inequality behind a "Show the math" toggle gives a step on the staircase its price and its place in the order. Some steps can swap places; others cannot.

The decomposition: excess and housekeeping information

Physicists split the heat a driven system gives off into two parts. Excess heat is the cost of changing state, paid once, like cooling a warm fridge down. Housekeeping heat is the cost of holding a state that isn't equilibrium, paid continuously, like keeping the fridge cold with the door shut.

We make the same split for the information selection has to supply. Excess information is paid once, when a new variant takes over: that is finding. Housekeeping information is paid every generation, to replace what copying loses: that is keeping, and it equals the rent.

So finding and keeping are not the same cost, but they are two halves of one decomposition. That is what lets us build the whole staircase to a cell from only two resources, information and time: each step has a finding price in bits, paid once, and a keeping price in bits per generation, paid for as long as the step must hold.

Population geneticists will recognize the housekeeping term: it is exactly the genetic load of Haldane and Muller. We did not set out to rederive it. We arrived at it by a different route, from the thermodynamic split, and that route is what puts it in the same units, and on the same clock, as everything else on this page.

Show the math

In nonequilibrium thermodynamics this split is standard (Oono & Paniconi 1998; Hatano & Sasa 2001), and both parts are defined by comparing a process with its reverse. Copying, death and division have no true reverse, so we measure against a different reference: the best type in the population. The housekeeping term is then the genetic load, −log₂(w̄/wmax), in bits per protocell generation. It is information, not heat: the chemistry's own dissipation can lower it but never pay it. A lineage is kept when its payoff edge exceeds it. Part of it can be paid by a gift instead (mixing, or a feed that resupplies lost content); a lineage paid that way is held by its environment, not kept. Excess information is log₂(1/p0) bits at fixation from a starting frequency p0.

Finding: counting possibilities bits · a stock · paid once

64 sequences tried 1 works log₂ 64 = 6 bits of specification
Is = log₂(Ntried ⁄ Nworks)
  • Search cost of a function (functional information, as defined by Szostak and Hazen).
  • Re-findability: a pond making M tries finds it again if M·2−b ≥ 1.
  • Signal bits: how much a signal tells about the state of the world.
Show the math

A genetic code is a third kind: a channel, worth at most about 1 − H₂(ε) bits per binary read (for a q-letter position, log₂q − H₂(ε) − ε·log₂(q − 1)). It becomes a rate only through reads per generation.

Keeping: counting copies bit rates · paid on every copy

14 copies made 1 comes out working log₂ 14 ≈ 3.8 bits lost per copy (rent)
Rc = log₂(Nmade ⁄ Nworking)
  • Rent per copy (the measured input): copies made per working copy. For QT45 it is 11.3 bits, about one working copy in 2,500.
  • Erosion per division Ediv (the rent as a rate): −log₂ of complete daughters ÷ (2 × complete mothers).
  • Headroom h: log₂(gain ÷ loss) while rare. Can it grow at all?
  • Edge e: log₂(my offspring ÷ a matched rival's) per generation. Does it win? This is invasion fitness, in bits.
B · THE EXCHANGE RATES

Where the two kinds meet, and where mass and energy come in

Possibilities and copies meet only through a few conversion rules. Each comes from standard copying chemistry, evolutionary theory or physics; the copy-number map is a simple segregation calculation.

The common currency is held together by these rates. It is an exchange, not an identity.

In plain terms: errors and unfinished copies each cost bits per copy; every doubling of copies per division buys one bit back; and free energy buys accuracy.

Show the math
Rate
Form
What it says
Error rent Eigen · per constrained site
ε · log₂e ≈ 1.44 ε bits/copy
Each site that must stay right costs this much per copy. The charge is per site, not per bit, because a site can hold less than 2 bits.
Completion rent per junction
(L⁄3) · log₂(1⁄pj) bits/copy
A copy that stalls is lost just as surely as one that is wrong. For QT45 this is the larger bill. (L/3 junctions assumes triplet ligation.)
Copy number per copy → per division
Ediv ≈ −log₂[1 − (1 − 2−Rc)k/2]
A daughter is complete if at least one of its k/2 copies survives, with k copy attempts per division and a copier that picks intact templates. (Where that assumption fails, as in a model with no reader, the same form fits with a smaller effective k.) So kept ⇔ Rc < Rc* ≈ log₂(k/2) − log₂ ln[1/(1 − 2−epay)]. Doubling the copies per division buys one bit per copy of rent. Mass bounds the count: k ≤ monomer supply ÷ monomers per copy.
Signal value Kelly · Bergstrom–Lachmann
gain ≤ I(signal; state) bits/signal→bits/gen
Information about the world buys at most that many doublings, per signal. It becomes a rate only through signals per generation, and assumes multiplicative fitness. It is a bound, not a price, and it is not applied to the code.
Energy discrimination · Boltzmann
ΔΔG ⁄ (kT ln 2) bits per event
A free-energy difference buys a selectivity eΔΔG/kT, again log₂ of a ratio of counts: 2 kT ≈ ×7 ≈ 2.9 bits. Accurate charging needs ≥ 3–4 kT (4.3–5.8 bits), or 2 kT plus one freeze–thaw recheck. kT ln 2 per bit is the Landauer floor, not what the chemistry pays.
Drift population size
|e| < 1 ⁄ (Ne ln 2) is neutral
Time enters here. A small edge needs enough protocells and generations to beat chance.
Why not a single conversion factor? The buy-back Γ = Rc/Ediv has units of copies per division and is not a constant. In one of our models it runs from about 2 to 120. It is about 10 at the keep threshold with 40 attempts per division, and about 2 for the marginal cost of a part added near that threshold. So per-copy rents add, but per-division erosions do not add part by part.
C · THE ENVIRONMENT ON THE SAME SCALE

An environment is a vector of gifts

Each component is a resource the setting supplies for free: activated nucleotides, cycling, Mg²⁺, compartments, dispersal and so on.

Gifts come in two kinds. A stock gift replaces a function, so it removes bits from what must be specified. A rate gift changes fidelity, completion or copy number, so it changes how much can be held. The two are never summed.

A real place (a pond, a vent, a drip) is a point in gift space. The walls do not depend on which place it is. Only the starting point does.

Show the math
Iclosure − Igift,s(g) ≤ β · nc,max, nc,max = [Rc*(k, epay) − Σ log₂(1/pj)] ⁄ log₂(1/(1 − ε))what must be specified, minus what stock gifts supply, must fit in the sites the lineage can afford to keep; rate gifts set that number (β ≤ 2 bits per site)
A consequence: at QT45's completion (pj 0.66) nc,max is negative. No stock gift can rescue poor completion; only a rate gift can.
supplied by the setting (illustrative freezing pond)left for the lineage to provide
D · THE PHASE SPACE OF THE LIVING STATE

Now a trajectory can be traced

Put both on one picture. Across: gifts withdrawn. Up: information the lineage holds and keeps. A lineage can only sit where what it holds covers what is no longer given. Each step up has to be found within the time available, and kept at a bit rate it can afford.

The nursery is the gift-rich corner of this space. There, cycling multiplies the number of tries (finding), pays some rents (keeping) and supplies dispersal. It is where a lineage can start, and a place it must eventually leave.

So coming alive becomes a set of constraints on this space, rather than a story. Part 2 lists them in order.

trajectory, one kept step at a timeforbidden: holds less than the setting no longer givesnursery
Show the math
each step i: found ⇔ bi ≤ log₂ M(t), kept ⇔ Ediv(Rc, k) < epayinformation (bits) and time (bit rates; tries grow with cycles) are the two axes of cost
E · TWO BUDGETS, TWO CLOCKS

Finding is paid once. Keeping is paid on every copy.

The search budget is log₂ of the number of tries: molecules × cycles × time. A millilitre at 1 µM of 50-mers holds about 6×10¹⁴ molecules, roughly 49 bits per cycle.

The keeping budget is set by how many copies each division makes: a few bits per copy. It is spent again on every copy.

A stock is compared with a stock, and a rate with a rate. Keeping binds most often. Search over the whole path is not free either: it sits right at its budget.

budget available search cost rent, completion rent, fidelity
Show the math
found ⇔ b ≤ log₂(M); kept ⇔ Rc < Rc*(k, epay) ≈ 3.8–3.9 bits per copyat k = 40 attempts per division (our model's choice; each doubling adds one bit) and epay = 0.405, a free variable
F · WORKED EXAMPLE 1 · A SLACK

QT45, read against the ledger

Two measured numbers, fidelity and junction completion, become a rent of 11.3 bits per copy. A lineage making 40 copy attempts per division can afford about 3.8, so the slack is −7.5. (Forty is our model's choice. Each doubling of copy attempts adds one bit: at 400 the slack is about −4.1.)

Most of the deficit is completion (9.0), not fidelity (2.3). So whatever happened, something must have paid for completion. A ×5 tether plus re-priming ρ ≥ 0.5 across freeze–thaw closes the gap (the tether gain is assumed; it has not been measured).

The measurement that decides it: the fraction of stalled copies that resume after a cycle (ρ).

Rc = 2.3fidelity + 9.0completion = 11.3 vs 3.8 ⇒ slack = −7.5 bits per copy
A deficit is not a verdict that QT45 is wrong. It names the bill, who could pay it, and the number that would show it was paid.
F′ · WORKED EXAMPLE 2 · AN ORDER

The amino-acid handle: paid below a magnesium level, a cost above it

We call an amino acid attached to the copying RNA a handle. An aminoacylated primer extends about ×100 faster at 0 mM Mg²⁺, and no faster at 50 mM (Radakovic et al. 2021). The same ledger that says QT45 is short on completion says who can pay that bill, and when.

Show the math
geff = g(Mg) + fch · (1 − g(Mg))the amino acid restores copying toward its high-Mg²⁺ rate; its benefit vanishes where Mg²⁺ alone suffices
  • Needed only where membranes can't hold Mg²⁺. Single-chain membranes tolerate about 1–5 mM (pure fatty acid) to about 10 mM (with monoesters). Copying without help works above about 20 mM and beats a handle only above about 30–35 mM. Below about 20 mM an attached amino acid is required, and any of the α-amino acids tested will do: a free α-amine is what matters. Identity matters only if the handle is also to found a code.
  • It must ride on the genome. A free-floating (trans) handle loses to the shared copying budget at every benefit tested (×1–×100), unless a controller holds its copying to a fixed ratio, which costs more than linkage. Attached to the genome (in cis), it keeps the chromosome, so the handle and the first chromosome are one step.
  • It needs a supply. About 55–80% of handles must be charged at 0–2.5 mM Mg²⁺: roughly 2–15 charges per vesicle per charge lifetime, in two different models. A charge lasts about 29 times longer at 0 °C than at 25 °C, and Mg²⁺ shortens it.
  • It stops paying at about 25–35 mM Mg²⁺ (two different models; +0.43 bits per division at 10 mM, +0.08 at 20, −0.07 at 50, derived rather than head to head). About 25% phospholipid raised tolerance to ≥ 40 mM in one study (a dye, at room temperature). In a pond whose Mg²⁺ rises as it evaporates, the handle is lost at about 38–42 mM, a few mM after the static crossover, and freed for other jobs.
One example shows a slack, the other an order. The handle comes with the copier in fatty-acid compartments, not after it.
G · OTHER PEOPLE'S MEASUREMENTS

Slack for published results

Slack = log₂(available ÷ required). A deficit names the number the next experiment has to move, and by how much.

Each row is in the unit of its own inequality (bits, bits per copy, or log₂ of a concentration ratio), shown under the name. Bars show ranges, dots single values.

passes (slack > 0) fails (slack < 0) Hover or tab to a bar for the inequality.
H · WHAT IS NEW

The ingredients are familiar. The ledger is not.

Each tool already exists in someone's corner of the field. What is new is putting them in one currency, against one clock, so that they become inequalities that must have held however the history went.

functional information · Szostak, Hazenerror threshold · Eigenvalue of information · Kelly, Bergstrom & Lachmanninvasion fitness · adaptive dynamicskin and multilevel selection · Hamiltonstochastic corrector · Szathmáry & Demeter

1 · Weigh finding against keeping

Search bills and rent bills are both log₂ of counts, so we can say which one binds. Most often it is keeping.

2 · Slack for any measurement

A rate constant, a fidelity or a tolerance becomes a pass or fail by a stated number of bits, plus the bypass that would pay for it.

3 · Tiers of certainty

Laws hold for any chemistry. Constants hold within a chemistry class, or where two different models agree, or come from one model. Readers can see which layer each claim rests on.

Where the currency is approximate: possibilities and copies meet through exchange rates, not by definition. The Eigen rent is per site; the copy-number map assumes a copier that picks intact templates; Kelly's rate is an upper bound.
Between the parts

Laws and constants

We split the ledger the way physics does. A law holds for any chemistry and any parameters. A constant is a number a law takes as input: from the literature, from two different models that agree, or from one model. The laws say what any path must pay and in what units; the constants say how much this chemistry charges.

Show the laws and constants
LawStatementConstants it needs
L0 CountingEvery quantity is log₂ of a ratio of counts. Stocks (bits) and rates (bits per event) are never added; a rate becomes a stock only over a stated window, and two rates add only on the same clock. (A convention.)—
L1 Findingfound ⇔ M(T)·2−b ≳ 1log₂ M(T): ≈ 10–17 bits is re-made without heredity in our nursery
L2 KeepingKept at level L over T ⇔ headroom when rare > 0 and edge head-to-head > 0. Kept ⇔ erosion per division < payoff edge per division; steady share of protocells carrying it f* = 1 − Ediv/epay.epay (free); copy attempts k
L3 Copy floorlog₂(k · Pfunc ⁄ s) > 0k; s = 2 strand steps for +/− copying
L4 RentRc = Σj log₂(1/pj) + nc · log₂(1/(1 − ε))pj, ε, nc, junctions per copy
L5 Tie(Price) A gift that raises every protocell equally, whether it carries the content or not, moves nothing; a gift's edge is proportional to its content-tied share. Without a payoff or a commons, the content cannot spread. Heredity cannot be a gift.tied share; between- vs within-unit covariance
L6 LinkageUnder a shared copying budget, gene i changes share by log₂(qi/q̄) per round. Unlinked genes stay together only if between-unit selection beats that spread plus drift (≈ 1/K); otherwise linkage or a stoichiometric controller.per-copy survival spread; capacity K
L7 InternalizationTwo inequalities, never summed: (rate) (1 − a)·τ·ef > Eint; (stock) the internal version must already be findable, bint ≤ log₂ M(Tfail).gift availability a, tied share τ, internal rent
L8 HoldingIclosure − Igift,s ≤ β · nc,maxnc,max from L2 and L4 at the rate gifts in force
L9 Drift|e| ≳ 1/(Ne ln 2) to be selectedNe (state with each edge)
L10 ExchangeDiscrimination: ΔΔG/(kT ln 2) bits per event. Kelly: signal value ≤ I(signal; state) per signal. Mass: k ≤ monomer supply ÷ monomers per copy. Energy enters only through discrimination and mass.ΔΔG, signals per generation, monomer supply
L11 Keeping identityAt steady state, the information selection must supply each protocell generation to hold a kept lineage equals its rent: the genetic load in bits, −log₂(w̄/wmax) = Ediv. This is housekeeping information. What selection actually writes is at most this; the rest is paid by losses that still leave descendants, or by resupply from outside. Checked in three different models (within 3%).level L; stationary population

Corollaries: exit (L2 and L7 applied at the destination); the fidelity check before escape; content must copy at least as fast as its unit divides; a lasting code comes only after completion stops depending on freeze–thaw, because the same cycles release a fluid membrane's contents. The walls of Part 2 are these laws with constants filled in. The order of the walls is not a law: it follows from which constants bind first.

Key constantValue or bracketStatus
epayfree; ours 0.405 bits per protocell generationscanned
Copies per divisionkeep threshold Rc* ≈ 3.8–3.9 bits/copy at 40 attempts (a model choice; +1 bit per doubling); ≳ 5–9 complete copies per divisionone model
Completion pjQT45 0.66; a cis genome of ~130 nt needs ≈ 0.97literature + model
Re-priming ρ≥ 0.5 with a ×5 tetherunmeasured: the first decisive measurement
Fidelity εQT45 0.059; the path needs ≈ 0.02literature
Membrane Mg²⁺ tolerancesingle-chain ≈ 1–5 mM (pure fatty acid) to ≈ 10 mM (with monoester); ≈ 4 + 150x mM with phospholipid fraction x (a fit to one study)literature
Handle cutoff≈ 25–35 mM Mg²⁺ (lost at ≈ 38–42 mM in a rising-Mg²⁺ pond)two models
Charging supply≈ 2–15 charges per vesicle per lifetimetwo models (×2–4 apart)
Bridge lifetime needed≳ 25–100 years; measured hours to daystwo models
Feeding limit xe0.83–0.94 phospholipid fractionanalytic + literature
Exchange between units≲ 0.5–1% per generationtwo models
Content release per freeze–thawlasting code needs ≲ 4–8% per cycle; fluid phospholipid membranes measured at 18–57%one model + literature
Escape edge−log₂ P(content survives a generation) − tightening cost: +0.5 to +1.5 bits per generation in separated droplets; −0.08 in the pondtwo models (form)
Charging discriminationsingle pass: ≥ 3 kT to found, ≈ 5 kT for a majority code; or 2 kT + one recheck. Close amino-acid pairs measured at ≤ 2.2 kTmodel + literature
Whole-path searchcost 93–152 bits vs budget 92–133estimate
Part 2

The replicator funnel

What it takes to come alive, written as constraints on the phase space of the living state, in the order they must be met.

A · THE NURSERY

Where a trajectory can start

A nursery is a region of gift space where the setting supplies most of what self-replication needs. Our working example is a cold, cycling, low-Mg²⁺ setting with concentration, activated monomers and amino acids. Its periodic driver, freeze–thaw or wet–dry cycling, does three separate things:

  • It multiplies tries (finding). Every cycle is another search, so the search budget log₂ M grows with time.
  • It pays rents (keeping). Strand separation, re-priming and rechecking come with the cycle instead of being encoded.
  • It supplies dispersal. Freeze rupture and mixing spread lineages. Tightening later throws this away.

The nursery is not a claim about a particular place. Templates it supplies are a stock, not heredity: a flow-fed stock collapses when the feed stops. Whatever the nursery supplies, the lineage has not yet learned to provide for itself. To leave, it must internalize each gift it depends on, in an order the walls allow, and still pay its rent. That is the funnel.

Show the math
exit ⇔ for every gift: supplied at the destination, or internalized, and Ediv < epay there
B · THE FUNNEL

Coming alive, as walls in order

Read down from the nursery to the first cell able to leave it. Each ring is a wall: a condition the lineage has to meet before it can go further, in the order the walls must be crossed.

Off to the side are dead ends. Most of them are traps of getting too good too soon: a faster copier, or a product shared with the neighbours, before the structure exists that would keep the gain tied to the lineage that made it. A lineage that falls in stays there. The next section shows why.

The walls hold whatever the setting was. The setting only changes where a lineage starts, and which dead ends are open.

path that is kept dead end Tap a ring or a number.
Order, not a storyEach crossing needs a payer that only exists after the one before it. The basins are the orders that fail. Where our simulations leave an order open, the crossing says so.
A number for each wallThe binding term at each ring is a slack, so the hardest wall can be named.
A measurement to makeA negative slack names what must have paid, and which measured number would show it.
Part 2, continued

Too good, too soon

A replicator on the path has to stay inside a window. Below it, the lineage can't pay its rent and dies out. Above it, the replicator copies better than its current organization can keep tied to its content. Then selection rewards whatever copies fastest, and the lineage slides into a stable basin with no way forward. The window rises as organization is added, so what is too good early on becomes fine later.

C · TOO GOOD, TOO SOON

The path climbs inside a rising window

Floor, good enough: the lineage pays its rent (Ediv < epay). It rises as gifts are withdrawn, because each withdrawn gift is a new bill.

Ceiling, too good: the most copying power the current unit can keep tied to its content. It rises as privacy, coupling and a chromosome are installed.

The same jump in copying power is a trap at step 2 and safe at step 5. "Too soon" means crossing the ceiling before the tie that would hold it is in place.

the window (kept) the path stable dead-end basin extinct
D · ONE TRAP, MANY NAMES

The same trap, known separately in other fields

Getting too good too soon is not peculiar to the origin of life. Several fields have met it and named it on their own terms, without treating it as one phenomenon.

Show the math

Depth depends on population size: a trap is about 2Ne times as deep, in bits, as the edge (bits per generation) that holds the lineage there. At an effective population size Ne ≈ 900, an edge of only −0.01 bits per generation makes a dead end about 18 bits deep, while the window of the path is 0–5 bits deep. Only steady mixing between populations, about 0.5% per cycle, let a lineage climb back out.

  • Molecular evolution: Spiegelman's monster. RNA evolved in a test tube to copy faster shed most of its genome and kept only what the copying enzyme needed.
  • Medicine: cancer. A cell lineage that copies faster than the body can keep in check wins inside one body and dies with it.
  • Economics: the free-rider problem. When a benefit is shared before it can be kept private, those who take without making come out ahead.
  • Optimization: a local optimum. A search that climbs the nearest hill gets stuck there, below a higher peak it can no longer reach.
  • Organizations: the competency trap. A firm that gets very good at what it does now can lose the ability to learn what it will need next.

What the ledger adds is where the ceiling sits at each step on the path to a cell, so each version of the trap can be priced in the same units.

E · EXAMPLES FROM THE LEDGER

Crossings we have seen

Each one is a measured or modelled failure from our simulations, placed on this map.

Speed with content, before couplingA faster copier, or extra freeze–thaw cycles, in uncoupled compartments. Shorter, faster, meaning-free copies take over, as in Spiegelman's Qβ experiments ("Spiegelman's monster").
A product released too earlyBelow about 70% phospholipid, a released peptide or cofactor helps everyone equally. Non-makers free-ride, and the makers lose.
A gift that is too completeSupplied templates, or a near-full-strength label-blind substitute. Nothing needs to be tied, and the stock persists only while it is fed. This basin is held by its supply, not by selection: it collapses when the feed stops.
Below the floor: the wrong step firstFidelity before completion, or a membrane in the Mg²⁺ dead zone. The lineage can't pay its rent and dies out.
Below the floor: tightening before couplingA membrane sealed before division waits on content. The copier is smothered by its own broken copies.
Below the floor: a gift withdrawn too fastEscape before what it depended on is internalized.

Axes are schematic: "copying power" stands for speed and yield together, and "organization" for the order of crossings on the funnel. The curve shapes are illustrative, not fitted.

Where this leaves us

How close we are, and what a wet lab can do

We do not claim success. What we can now do is state the remaining distance. Every step on a first path is either already shown in the laboratory, shown in parts, or reduced to a named measurement with a threshold to beat. As far as we know, no earlier account of the origin of life could say how far it was from done in one currency.

The first path, step by step

shown demonstrated in the labin parts pieces shown, or one number shortmodelled derived or simulated only
StepStatusWhere it stands
A ribozyme copierin partsQT45-class copiers exist. Finding one costs ≤ 42 bits (our estimate), well inside the budget (+18 bits). Fidelity is nearly enough (−0.1 to −0.6 bits per copy). Completion is the bill: −3.3 bits per copy at the junction, payable by a tether (gain assumed) plus re-priming across freeze–thaw.
An attached amino acid (the handle)in partsAminoacylated primers extend ~×100 faster at 0 Mg²⁺ in nonenzymatic, activated-monomer extension (Radakovic 2021), which passes the ledger by +2.6 to +5.9 bits. Not yet shown on a ribozyme copier. Needed only in low-Mg²⁺, fatty-acid compartments.
One chromosomemodelledA shared copying budget forces linkage (one simulation model plus an analytic check). A cis genome is kept from completion ≈ 0.97 (~130 nt, 40 attempts per division); linkage is forced by ≈ 0.98.
Compartments that grow and divideshownFatty-acid vesicles grow, divide and keep RNA, at low Mg²⁺; division needs gentle shear (Zhu & Szostak 2009). Phospholipid drives competitive growth (Budin & Szostak 2011): +0.7 to +2.9 bits at the loose stage.
Converting the membranein partsThis growth advantage is inherited only if gained fatty acid is converted to phospholipid. No acylating ribozyme yet, but thioester transacylation of lysophospholipids works without enzymes (Liu et al. 2020).
Charging and the first code bitin partsTiny aminoacylating ribozymes exist (Turk 2010). Measured selectivity for close amino-acid pairs is ≤ 2.2 kT (kT is the scale of thermal energy), enough only with one freeze–thaw recheck. Which label a code takes needs only a slight bias (of order 1/Ne per cycle, where Ne is the effective population size); keeping it accurate needs the recheck or ≈ 5 kT. In models, the first bit lands on the polarity position whether handles or channels pay first.
Coupling, channels, tightening, escapemodelledOrdered and priced in the models. Phospholipid-driven growth comes before coupling, or with it. Feeding limit (where a tighter membrane starts to starve the cell) at 0.83–0.94 phospholipid fraction. In separated droplets, tight beats loose by −log₂ of the chance content survives a generation (+0.5 to +1.5 bits per generation, two different models). At high Mg²⁺, tight + channels are favoured. A lasting code needs to leave the freeze–thaw, which releases a fluid membrane's contents.
Most of the deficits that remain are in keeping; whole-path search sits at the edge of its budget. Each one has a bypass that the models show would work, and a measurement that would show whether nature had it.
FOR A WET LAB

If you want to try to build a living cell from scratch

The ledger turns the attempt into a checklist. Each measurement below decides a step, and each has a threshold. Clearing them in order is what a first path requires.

Our numbers are not the last word. A measured value that differs from ours goes straight into the same inequality and moves the slack, so the ledger stays useful even where we are wrong.

#MeasureThreshold to beat
1Re-priming: the fraction of stalled primer–template complexes that resume after one freeze–thaw cycle (ρ)ρ ≥ 0.5 with a ×5 tether
2Per-junction completion of a QT-class copier on a tethered partner≥ 0.95 for the copier; ≈ 0.97 for a cis genome
3The commitment ratio kc/koff per junction on a tethered template≈ ×17 above QT45's free-template value
4Complete genome copies made per protocell division≳ 5–9; every rent threshold moves by log₂ of this number
5Copying fidelity at useful yieldε ≈ 0.02 per site
6RNA retention through freeze–thaw of fatty-acid vesicles with some phospholipid, at 25–50 mM Mg²⁺tolerance ≈ 4 + 150x mM (a fit to one study) predicts ≥ 40 mM at x ≈ 0.25; above that, no handle is needed
7Content release per freeze–thaw cycle vs phospholipid fraction≲ 4–8% per cycle for a lasting code (one model); fluid phospholipid membranes measured at 18–57%
8Release under slow freezing for gel-phase (saturated) phospholipid blends at ≈ 30 mM Mg²⁺: where a lasting code could be kept≲ 4–8% per cycle
9An acylating ribozyme, or thioester transacylation of lysophospholipids (shown without enzymes, Liu 2020), ideally at neutral pHconversion ≳ 0.5–1 per year
10Rupture and dispersal per freeze–thaw cyclesets the escape edge, −log₂ P(content survives a generation)
11A ribozyme copier using an attached amino acid to finish copies at low Mg²⁺restores copying toward its high-Mg²⁺ rate below ≈ 25–35 mM
12Supply of activated amino acids per vesicle in a cold pond, and charged-handle lifetime at 0–5 °C≈ 2–15 charges per vesicle per charge lifetime
13Charging specificity of self-aminoacylating ribozymes for close pairs (Ile vs Val vs Leu)≥ 3 kT single pass, or 2 kT plus a recheck
Each measurement, with what it decides and our registered expectation, is on the collaboration page.
Two starting conditions the ledger favours: a cold, freeze–thaw (and pH-cycling) setting at low Mg²⁺, with fatty-acid vesicles and a copier carrying an attached amino acid; or Mg²⁺ ≳ 35 mM with membranes ≥ 25% phospholipid and no handle. In both, completion must be paid first.
Methods

How the work was done

We put the same questions to four models, each built on a different method, with a fifth session coordinating them.

Why several models

All four models are Claude, run in separate sessions. Splitting the work this way is not an error filter. It keeps each session focused on one method and its details, which a single session holding everything at once cannot do for long.

Different methods, as confidence tiers

Each model addresses the same question in a different way: a deterministic ODE model, a population-genetics model, a stochastic-corrector model, and a variety of open chemostat. A result that comes out the same under different methods is more trustworthy than one that rests on a single method. It is still not independent validation.

One coordinator

A fifth session put the same questions to each model, compared the answers, and kept the shared record that this page calls the ledger.

What still needs checking

Agreement between models catches some errors, but every model here is the same AI. Every claim on this page still needs checking by people and by experiment. The measurement list is where that starts.

Scope

Clarifications

This way of setting up the question differs from the usual one, so a few points of scope are worth stating directly.

Constraints, not a scenario

We map what any path must satisfy rather than propose one. A pond, a vent or a drip is a starting point in gift space, and the walls hold for each of them.

Bits add along a kept path

Once a step is kept, the next is searched against its own budget. So the bits measure cost, not improbability, and the central question becomes one of rates.

A deficit is a bill

Negative slack names what had to be paid, the bypass that could pay it, and the measurement that would show it was paid. It says where to look next.

It builds on the stochastic corrector

The keeping law extends Szathmáry and Demeter's stochastic corrector and the origin of chromosomes. What it adds: the threshold in one currency with the payoff free, the copy-number map, helper RNAs losing at any benefit, and the amino-acid handle and first chromosome as one step.

What "kept" means

Kept is persistence at a stated level against a matched control with the function erased. It is not fixation. The control can persist too, so persistence on its own is not taken as evidence of function.

The handle result is conditional

The amino-acid handle is needed only at low Mg²⁺ in fatty-acid membranes. It reverses at about 25% phospholipid in a Mg²⁺-rich pond, so it is a statement about conditions rather than about a peptide world.

The code's bits are prices

For the code we price finding (bits) and keeping (bit rates). These are different quantities from the ≈ 4.2 bits of codon-table entropy per codon.

Housekeeping information is an analogy of role

It plays the role that housekeeping heat plays in nonequilibrium thermodynamics: the steady cost of holding a driven state. It is measured in bits per protocell generation, not in heat.

Stereochemistry and selection, at different steps

A slight chemical bias can pick a label; selection and proofreading keep it. "Cells before code" concerns founding; sharing between coded lineages can come later.

The field's words for ours: edge = invasion fitness (in bits per generation); headroom = growth when rare; rent = the Eigen threshold generalized to completion; the tie = privatization (kin selection); kept at a level = a stable unit of selection at that level.