Lambspring Labs ResearchField essay 01

Explode the Code Recoalescence Value

Generation is cheap. Admission is expensive. The value of parallel AI work is not the code it produces, but the capability that survives selection, integration, verification, and possible recovery.

30 July 2026 Lambspring Labs Research 18 minute read

11,975 → 1,899characters after context removal

0/6 → 6/6valid outputs in a controlled replay

1,477instrumented routing decisions examined

Agentic software work changes the bottleneck. When models can produce branches, analyses, tests, prompts, and competing implementations in parallel, output ceases to be scarce. The scarce operation is deciding what may enter the live system, what should be destroyed, what can be salvaged, and what must remain recoverable. We call the net capability preserved through that operation recoalescence value.

This essay proposes an auditable model rather than a universal benchmark. It separates gross option value, live system utility, dormant recovery value, exploration cost, reconciliation cost, and integration surplus. It also introduces a typed rejection score: a hard gate for invariant violations plus a soft vector for verification, contract fit, provenance, and non-redundancy. Evidence comes from Lambspring's operating record across Compass, Meridian, and OpenClaw, read alongside research on modularity, agentic pull requests, software-agent evaluation, deconstruction, and systems verification.

01

Generation is not progress

A fragment is an option. It becomes capability only after it survives a boundary.

For most of software history, producing a plausible implementation was expensive enough to stand in for progress. Agentic systems break that proxy. A model can cheaply produce five patches, four explanations, three test strategies, and a confident recommendation. The pile is larger. The system may be no better.

The distinction is old even if the production rate is new. David Parnas argued in 1972 that modularity depends on the criteria used to decompose a system, not merely on dividing it into pieces. Carliss Baldwin and Kim Clark later described modular designs as collections of options governed by visible design rules. An option has value because it can be exercised under a contract. A disconnected fragment is not automatically an option; without an interface, evidence, or provenance, it may be only debris.

Explosion creates possibility. Recoalescence decides which possibilities become real.

This is why output counts, lines changed, agents spawned, and even passing tests can mislead. AgentLens examined 2,614 software-agent trajectories and found that 10.7 percent of passing trajectories in its evaluation subset exhibited a "Lucky Pass": regression cycles, blind retries, missing verification, or disordered work. The patch passed; the process still carried risk. At a larger organizational scale, a study of 107,000-plus simulated merges of agentic pull requests reported a 27.67 percent conflict rate. Parallelism produced more possible work and more collision surface at the same time.

branchmodel taketestdissent
admission boundary contract evidence provenance cost
live system recoverable archive discard
The system should let ideas multiply freely while making admission narrow, explicit, and reversible where possible.

02

The destruction ledger

Deleting code can create value. Deleting its history can destroy it.

Destruction is usually discussed as failure: lost work, reverted code, a model answer thrown away. In a high-output system, removal is also maintenance. Duplicate implementations increase search cost. Stale modules impersonate live authority. Bloated context competes with the current instruction. Unsupported clauses contaminate otherwise useful prose. The ability to remove precisely is therefore part of the production system, not its opposite.

But "deleted" hides several economically different acts. Lambspring's operating record contains all four:

01

Trim

Remove an unsupported clause while retaining the independently supported sentence around it.

02

Retire

Remove code or an agent from the live path while preserving its journal, audit trail, and reason for retirement.

03

Archive

Move a coherent unit with hashes, a manifest, dependencies, and a tested restoration path.

04

Purge

Destroy irreversibly when legal, security, corruption, or carrying cost outweighs any recovery option.

These states need a ledger. A minimum destruction record contains the object hash, former live location, removal time, author or agent, prompt and model provenance where relevant, rejection reason, last passing tests, dependencies, replacement, recoverability class, and restoration procedure. The live tree can become smaller without forcing institutional amnesia.

One Lambspring retirement removed a paper-only agent persona from live code and a seed record while keeping its historical logs. A separate archive preserved 76 files totaling 5,461,532 bytes with byte-for-byte verification and restoration instructions. In another cleanup, 6,196 lines of archived v1 code were finally deleted after a replacement service and its contracts were established. The operation was not "keep everything" or "delete everything." It was migration from ambiguous live material to a smaller active surface plus an explicit historical boundary.

This resembles the difference between demolition and deconstruction. The U.S. Environmental Protection Agency describes deconstruction as selective disassembly that can preserve entire assemblies or individual materials for reuse. Whether recovery is rational depends on condition, hazards, labor, and future value. Code has the same distinction: a module can be unfit for the current structure while its test fixture, parser, interface, or hard-won failure case remains valuable elsewhere.

03

Rejection must explain itself

A rejection count is not a quality measure. It is a routing outcome with a missing noun.

Rejected because it is false? Rejected because it duplicates accepted work? Rejected because the repository changed underneath it? Rejected because a human never reviewed it? Those outcomes imply very different things about the fragment, the agent, and its future value.

A 2026 study of 11,048 closed agentic pull requests makes the problem concrete. Among rejected PRs, only 35.7 percent had a clear agent failure; 31.2 percent reflected workflow constraints, and 33.1 percent had no observable rationale. Of merged PRs, 15.4 percent still required reviewer involvement. A binary merged/rejected label therefore confounds technical fitness, process fit, timing, and missing evidence.

We use a two-stage rejection rule. First, hard invariants fail closed. A fragment that violates a safety constraint, names the wrong executable target, lacks required provenance, or cannot produce a required proof is excluded from the live path regardless of how persuasive it sounds. Second, fragments that clear the hard gate receive an auditable vector:

xi = (Vi, Ci, Pi, Ni)

Ji = 1 - (wVVi + wCCi + wPPi + wNNi)

Σw = 1; if hard violation Hi = 1, then Ji = 1.

V Verification
How strongly tests, checks, or cited evidence support the fragment.
C Contract fit
Whether it satisfies the current interface and exact requested target.
P Provenance
Whether model, prompt, source, dependencies, and transformations are known.
N Non-redundancy
Whether it adds distinct capability rather than coordination surface.

Each component lies between 0 and 1; higher is better. J therefore rises as the reason to keep a fragment outside the live system grows. Weights must be declared by domain and calibrated against downstream outcomes. They are not natural constants. A high-stakes executable path may assign most weight to verification and contract fit. A research notebook may assign more to provenance and recoverability.

0.00-0.24AdmitIntegrate and verify the whole.

0.25-0.49ReviseRepair a known boundary defect.

0.50-0.74SalvageKeep admissible units; quarantine the rest.

0.75-1.00Reject liveArchive or purge by reason and cost.

These bands are illustrative. The vector and reason code remain canonical because a scalar destroys information. Every rejected unit should also carry one disposition: invalid, incompatible, superseded, deferred, salvageable, or archived. Reintroduction is allowed only when evidence changes: a new test passes, the contract changes, provenance is repaired, or the duplicate becomes necessary. The old score is not overwritten; a new score is appended under the new boundary.

04

The mathematics of coming back together

Value retained and value created by integration are different terms.

Let an objective be exploded into candidate fragments F = {f1 ... fn}. Give each fragment a pre-integration estimate ui* in one consistent unit: expected dollars, hours saved, defect reduction, or a declared utility scale. The gross option pool is:

Gross option value

G = Σi max(0, ui*)

G is not realized value. It is the optimistic pre-integration pool and is expected to be wrong. It creates a denominator against which the cost and selectivity of the process can be inspected.

Rejected material may still contain a future option. For fragments outside the live set S, let ρi be recoverability: the probability that provenance, compatibility, and physical availability will permit future reuse. Let ui,future be expected future utility and ci,restore restoration cost:

Dormant recovery value

D = Σi ∉ S ρi max(0, E[ui,future] - ci,restore)

Now evaluate the integrated system itself. U(S) is end-to-end utility after integration; U(B) is the baseline without the run. CE is the cost of exploding the work, and CR is the cost of reconciling it:

Net recoalescence value

VR = [U(S) - U(B)] + D - CE - CR

Recoalescence multiple: R = VR / G, when G > 0.

The multiple R is not bounded between 0 and 1. It can be negative when the swarm creates more coordination cost than utility. It can exceed 1 when interactions among accepted fragments create capability greater than their separate estimates. That interaction is worth measuring directly:

Integration surplus

ΔI = [U(S) - U(B)] - Σi ∈ S aieiui*

ai is the admitted share; ei is evidence strength after integration.

A positive ΔI is genuine synthesis: two parts become more useful together. A negative value is coordination debt: regressions, duplicated abstractions, interface mismatch, review time, or operational complexity consume the local gains.

Four fragments, one system

Suppose four candidate fragments have estimated local utilities of 10, 8, 6, and 4 units, so G = 28. The first two are admitted. The third fails an invariant and has negligible recovery value. The fourth is incompatible today but well documented; its discounted dormant recovery value is 1.5. After integration, the system improves on baseline by 22 units. Exploration cost is 3 and reconciliation cost is 4.

VR = 22 + 1.5 - 3 - 4 = 16.5
R = 16.5 / 28 = 0.59

If the admitted fragments had evidence-adjusted local value of 18, integration surplus would be 22 - 18 = 4. The run destroyed 10 units of optimistic option value, retained 1.5 units outside the live tree, and created 4 units through combination. None of those facts is visible in a merge count.

05

What the field record says

The observations do not prove the metric. They show why its terms are necessary.

Destructive compression

In June 2026, a local review stage appeared to be a model failure. It produced malformed or non-discriminating outputs and passed too much work onward. A controlled replay tested two models against three payload forms. With the full approximately 11,975-character payload, each model produced 0 valid outputs in six prompts. Removing a duplicated brief improved each to 3/6. A lean approximately 1,899-character contract produced 6/6 for each.

The first diagnosis - replace the model - was rejected. The stronger explanation was payload bloat colliding with a 4,096-token context limit. Deleting roughly 84 percent of the prompt restored the required structure. This is a small internal replay, not a model benchmark, but it demonstrates the mechanism: context can have negative marginal value when it obscures the boundary.

Selective routing

In the instrumented review window, Compass recorded 1,477 local assessments. The local stage classified 616 as WRONG and dropped all 616 before the frontier judge. It classified 861 as GOOD, OUTLIER, or UNCLEAR and escalated every one. Fifteen ultimately surfaced.

1,477locally assessed100%
861escalated under uncertainty58.3%
15surfaced after frontier review1.02% of all

Across the longer review history, 1,925 of 2,379 records were dropped and 23 surfaced. These figures are selectivity telemetry, not quality telemetry. "Surfaced" is not truth, and "dropped" is not model failure. The important design choice is directional: confident local wrongness terminates; uncertainty escalates. Unknown labels do not silently become rejection. That asymmetry prevents a cheap gate from becoming an invisible censor.

Salvage below the document level

A later report-take failure exposed a different boundary. One generated take contained a supported sentence followed by an unsupported causal claim. Rejecting the whole take would lose valid material; accepting it would launder the unsupported dependency. The sanitizer now operates on independent units: supported text survives, unsupported numeric or causal clauses are removed, unknown provenance markers reject the whole take, and an empty result fails closed. The change passed 52 focused tests and the then-current 320-test suite.

Process state, not just final state

The operating journals hold 112 imported entries, 309 active knowledge nodes, and 23 explicit tension records in open, held, or resolved states. That count is not value. Its significance is structural: dissent can be preserved without granting it production authority. Agents may speak freely in their own journals; a bridge summarizes current state; contracts govern admission; tests govern execution. Free expression and strict integration are complements.

The distinction also changes prompting. A good production prompt is not the longest account of everything the organization knows. It states the current role, one decision, the exact input contract, allowed evidence, failure behavior, and output schema. Broader memory remains retrievable and attributable outside the hot path. This reduces prompt collision without erasing history.

06

The same shape appears in physical systems

These are structural analogies, not claims that code, buildings, cells, and spacecraft are equivalent.

Architecture

Deconstruct before demolition

EPA guidance treats disassembly as a design concern: visible connections, standard components, condition records, and a disassembly plan make future recovery cheaper. The software equivalent is a stable interface plus a manifest and restore test.

Developmental biology

Overproduce, connect, remove

Programmed cell death helps shape developing systems by removing cells that fail to form useful connections. The lesson is not "deletion is good." It is that selective removal can be constitutive of a coherent whole.

Systems engineering

Verify the unit and the assembly

NASA systems guidance tracks test-article pedigree and distinguishes component, subsystem, integrated-system, and end-to-end verification. A locally passing fragment is evidence about a unit, not proof about the assembled system.

The common pattern is recoverable modularity under explicit interfaces. A beam without known dimensions, a biological cell without a useful connection, a flight component without pedigree, and a generated function without contract evidence all fail for different reasons. Yet each shows why local existence is weaker than system membership.

07

An operating protocol for agent swarms

Freedom belongs inside the workspace. Authority is earned at the boundary.

  1. 01

    Declare the design rules before fan-out

    Name the objective, interfaces, invariants, evidence classes, write scope, and owner. Parallel work without a shared contract is multiplication, not decomposition.

  2. 02

    Give every worker an attributable journal

    Store the full prompt, role, model, parent, timestamps, actions, evidence, artifacts, and next step. Preserve uncertainty and dissent in the worker's own voice. Never require private chain-of-thought.

  3. 03

    Keep hot prompts narrow

    Load the decision contract and only the evidence needed for that decision. Retrieve broader memory by reference. Measure payload length, truncation, structured-output validity, and retry behavior.

  4. 04

    Gate the smallest verifiable unit

    Score clauses, files, migrations, tests, or patches at their actual dependency boundary. Do not accept a whole report because one sentence is cited, or destroy a whole branch because one file is stale.

  5. 05

    Reject with a vector and a reason

    Apply hard invariants first, then preserve verification, contract, provenance, and redundancy dimensions. Unknown must remain unknown; it must not be laundered into either acceptance or failure.

  6. 06

    Archive before irreversible deletion when the option is plausible

    Hash the artifact, record dependencies and replacement, test restoration, and assign carrying cost. Purge only when recovery value is dominated by risk or maintenance.

  7. 07

    Verify the assembled system

    Run unit, integration, end-to-end, rollback, and operational checks. A set of green branches is not a green product.

  8. 08

    Measure the right denominator

    Track reconciliation hours, human forensic-triage time per admitted branch, regression rate, dormant recovery, and end-to-end utility. Output volume belongs in the cost column unless it survives.

08

Limits, failure modes, and what would change our mind

Recoalescence value is a proposed accounting frame, not a validated universal metric. Lambspring's evidence is observational, comes from one evolving system, and spans telemetry eras. Its routing labels are operational states rather than ground-truth judgments. The prompt replay had six items. Code deletion and later stability occurred in sequence, but sequence alone does not establish causality.

The framework also invites gaming. A team can inflate G by exaggerating local estimates, improve apparent selectivity by rejecting aggressively, or manufacture positive integration surplus with a weak baseline. The defense is not more algebra. It is preregistered units, external outcome measures, versioned contracts, explicit costs, and calibration against later failures and recoveries.

Three falsifiable predictions

1. Typed rejection should predict downstream cost. If the rejection vector cannot forecast regressions, review burden, or successful reintroduction better than a binary label, it is unnecessary.

2. Recoverable archives should sometimes pay back. If archived fragments are never reused, or restoration repeatedly costs more than regeneration, their estimated D should fall toward zero and deletion should happen sooner.

3. Reconciliation cost should dominate beyond a fan-out threshold. If adding agents continues to improve end-to-end utility without increasing conflict, triage, or integration time, then the claimed recoalescence bottleneck is overstated for that task class.

Evidence about AI productivity already warns against universal claims. METR's early-2025 randomized trial found that 16 experienced open-source developers working in familiar mature repositories took 19 percent longer with AI, even while believing they were faster. METR's 2026 follow-up says newer tools likely provide more speedup, but selection effects make the size unreliable. Both results fit the same principle: capability is conditional on task, workflow, user, contract, and measurement boundary.

The goal is not a high rejection rate. It is a high-fidelity system with low avoidable reconciliation cost and recoverable knowledge. Over-rejection creates blindness. Under-rejection creates contamination. Recoalescence is the disciplined search for the boundary between them.

The product is what survives.

AI turns implementation into a renewable resource. It does not make judgment, coherence, or responsibility renewable. Those remain scarce.

Explode the work when diverse search is valuable. Let agents investigate, disagree, and write freely. Then make the return path demanding: explicit contracts, narrow prompts, typed rejection, reversible destruction, provenance, and verification from unit to integrated system. Preserve what is worth recovering. Remove what interferes. Measure the cost of bringing the pieces home.

That net capability - not the number of fragments, not the fluency of the agents, not the spectacle of parallel motion - is recoalescence value.

Sources

References and further reading

  1. D. L. Parnas, On the Criteria To Be Used in Decomposing Systems into Modules, 1972.
  2. C. Y. Baldwin and K. B. Clark, The Option Value of Modularity in Design, 2002.
  3. F. Zampetti et al., AgenticFlict: Understanding and Detecting Potential Git Conflicts in Agentic Pull Requests, 2026.
  4. X. Wu et al., Why Are Agentic Pull Requests Merged or Rejected?, 2026.
  5. P. Sahoo et al., AgentLens: Revealing The Lucky Pass Problem in SWE-Agent Evaluation, 2026.
  6. R. Choudhuri et al., To Copilot and Beyond: 22 AI Systems Developers Want Built, 2026.
  7. J. Becker et al., Measuring the Impact of Early-2025 AI on Experienced Open-Source Developer Productivity, with 2026 experiment-design update.
  8. U.S. EPA, Best Practices for Reducing, Reusing, and Recycling Construction and Demolition Materials.
  9. NASA, Systems Engineering Handbook: Appendix.
  10. R. W. Oppenheim, Cell Death During Development of the Nervous System.