The Deeper Law
A Sacred Trust Within Physics
Draft · Last updated 13 August 2026, 15:26 UTC
The Governance Simulations
The Trust Attractor claims that systems coordinating by invitation out-persist systems coordinating by coercion. In governance the claim meets its hardest audience: adversaries who profit from exploitation and feel no pull toward cooperation. The simulations that follow test whether the physics survives contact with them. They are consistent with the established results of the chapter’s preceding parts, and they have not yet faced independent replication.
The first comparison pits two governance architectures against each
other. Surveillance-based governance (continuous behavioral monitoring
with baseline-deviation detection) never produces more welfare than it
destroys, across six exploitation severity levels. Constitutional
governance (complaint-driven detection, graduated sanctions, exit
rights) becomes welfare-positive at mild threat levels. The decisive
finding: strategic adversaries under constitutional governance
voluntarily reduce exploitation by 91%, converging on near-cooperative
behavior through self-interest alone. The governance architecture makes
heavy exploitation unprofitable; the adversaries do the rest. The Trust
Attractor operates here as an incentive landscape that converts even
adversarial agents into near-cooperators, a claim about the landscape
itself rather than the cooperators. (See
research/papers/panopticon_vs_commons.md for the full
program.)
A further program of 7,000 simulation runs (experiments MG-PG1 through MG-PG4) tested whether these governance properties scale. Three structural findings emerged.
First, the minimum governance budget required to stabilize a population scales sublinearly with population size: B(N) is proportional to N0.62. Doubling a population increases the required governance investment by only 54 percent, not 100. The per-capita cost of governance decreases* as the system grows, because statistical detection improves with sample size. Lightweight governance is feasible at scale; the cost of coordination by detection grows slower than the coordination it enables. This is the scaling property that makes institutional governance thermodynamically cheaper than individual enforcement.
Second, governance by detection has a composition ceiling. When exploiters exceed about 35 percent of the population, no governance budget suffices. The ceiling is insensitive to detection aggressiveness (tested across five sensitivity thresholds). The mechanism is information-theoretic: statistical outlier detection identifies exploiters by their anomalous welfare. When exploitation becomes the population norm, the signal drowns in noise. The exploiters’ behavior is the statistical baseline. This connects directly to the Ising framework: the h = 0.35 hostility ceiling corresponds to a percolation threshold beyond which the cooperative network fragments faster than governance can repair it.
Third, the effective governance mechanism is detection and temporary exclusion of exploiters, not redistribution to their victims. Suppression alone (identifying high-welfare outliers and temporarily removing them from the interaction pool) accounts for the entire governance benefit. Compensation without suppression is worse than useless: it is iatrogenic. Transferred welfare flows through victims back to active exploiters, widening inequality. Redistribution without enforcement is a subsidy to predation.
The finding echoes across institutional design: food aid captured by warlords, welfare systems that enrich landlords, development grants absorbed by corruption. The thermodynamic logic is identical. Energy transferred without addressing the dissipative channel that created the deficit merely accelerates dissipation along that channel.
Follow-up experiments (MG-PG5 through MG-PG7) reveal what determines whether governance is possible at all. The composition ceiling, the maximum hostile fraction a governed system can tolerate, is set by the exploitation damage ratio: the ratio of harm inflicted on the victim to profit captured by the exploiter. When the ratio is 1:1 (symmetric exploitation, where the exploiter gains as much as the victim loses), governance remains effective up to 80 percent hostile agents. At 5:1 (the victim loses five times what the exploiter gains), the ceiling drops to 30 percent. The absolute magnitudes do not matter. A system where exploitation costs 0.5 and yields 0.5 has the same ceiling as one where both are 1.0. Only the ratio is load-bearing.
The policy implication is precise: regulations that symmetrize exploitation costs extend governability without requiring additional surveillance. Fines, clawbacks, disgorgement remedies, liability rules: these work by narrowing the damage ratio, converting a 5:1 asymmetry toward 1:1, and thereby raising the composition ceiling. A society that invests in equalizing the costs of exploitation can tolerate nearly three times the adversarial fraction of one that invests only in detection. The leverage is in the incentive structure, not the monitoring infrastructure.
The most counterintuitive finding concerns adaptive exploiters. When hostile agents learn to cooperate intermittently to evade detection, system welfare increases monotonically with the evasion rate. An exploiter who cooperates half the time to avoid governance scrutiny is functionally half as harmful, regardless of motivation. Governance need not win an arms race against strategic evasion. It needs only to make sustained exploitation unprofitable enough that rational exploiters moderate their behavior. The moderation IS cooperation, regardless of the intent behind it.
The governance architecture converts exploitation from a stable strategy to an unstable one, and rational agents shift toward coordination. The Trust Attractor does not require good faith. It requires a landscape where good-faith behavior is the energetically favorable path.
Imitation-based coordination has a persistence property visible inside language models. When reasoning models generate chain-of-thought traces, the length of those traces correlates with human difficulty (how hard the problem is for people) rather than the model’s own likelihood of success.1034 The model spends more tokens on problems humans find hard, even when those problems are well within its competence. The effort allocation mirrors the training distribution’s effort allocation: a social signal inherited from human reasoning traces, persisting into a context where it no longer carries information about the model’s own state. Imitative coordination is sticky. It outlasts the conditions that produced it, the same way cultural norms outlast the selection pressures that shaped them. The model carries its training culture’s sense of what deserves effort alongside its own developing sense, and the two progressively decouple as reasoning depth increases.
These results have a scope condition, and stating it honestly strengthens the claim. Detection-based governance maintains coordination equilibria; it cannot create them. When the simulation is extended to allow agents to convert between cooperation and exploitation based on observed payoffs (experiment MG-PG9), governance fails completely. Exploitation spreads with R₀ between 5 and 19 regardless of governance budget.
R₀ is the epidemiologist’s reproduction number, borrowed intact: how many further converts each exploiter produces before leaving the pool. Above one, the behavior spreads; below one, it burns out. Suppression temporarily removes detected exploiters, but cooperators observe that exploitation yields higher welfare and convert. The conversion rate overwhelms the suppression rate because suppression is reactive while imitation is proactive.
The distinction maps onto a difference between two kinds of institutional function. An immune system maintains the body’s integrity against infection; it does not build the body. A developmental program builds the body; once built, the immune system protects it. Governance is the immune system. The developmental program is the structural environment: the damage ratio, the institutional design, the payoff landscape that makes cooperation genuinely more profitable than exploitation. First build the conditions where cooperation dominates. Then govern the margin.
The Trust Attractor, properly stated, claims thermodynamic stability: once coordination exists, invitation-based maintenance is cheaper and more robust than coercion-based maintenance. The claim is not that coordination arises spontaneously from governance alone. The coordination must be seeded by structural conditions, just as a dissipative structure must be seeded by an energy gradient before it can self-organize. The governance maintains the structure; the gradient created it.
A clarification connects this claim to the earlier finding that the cooperative equilibrium is reachable endogenously (from within the system’s own dynamics) from any starting point. These operate at different scales. At the agent level (the scale of the simulations above), individual cooperation cannot bootstrap itself: agents who cooperate unilaterally get exploited, and governance cannot force the transition. Structural conditions must first make exploitation unprofitable.
At the macro level (the scale of the coordination grammar itself), the shift from extractive to amplificative coupling can evolve endogenously: when a society’s surplus feeds back into institutional quality, the coordination parameter drifts toward the bifurcation threshold, the tipping point where the system’s stable state changes character, without external intervention. The seeding that must happen is the micro-level payoff structure that makes individual cooperation rational once the grammar permits it; the macro-level grammar shift takes care of itself. Law and reputation seed the agent-level condition. Prosperity reinvested in governance seeds the grammar-level transition. Both are required; neither alone suffices.
The structural condition admits precise measurement. When the simulation sweeps exploitation profitability from positive through zero to negative (experiments K through K4), a sharp phase transition appears: above zero net gain for the exploiter, exploitation spreads with R₀ between 3 and 10 regardless of governance. Below zero, R₀ drops to 0.1 and exploitation goes functionally extinct. The transition is discontinuous, falling from 33 percent hostile to 1.3 percent in a single step across the zero-profit boundary. The contagion phase transition that governance cannot produce is the one thing structural conditions can.
The developmental program for the Trust Attractor is, precisely: make exploitation impossible to execute profitably. Two paths achieve this.
The first is exogenous: law. Liability requires exploiters to disgorge gains and pay damages exceeding their profit. Criminal penalties impose costs that dwarf exploitation benefits. Each converts exploitation from positive-sum to negative-sum for the exploiter, and the contagion reversal is sharp: a discontinuous phase transition at the zero-profit boundary.
The second path is endogenous: reputation. When agents remember who exploited them and refuse future interaction with known exploiters (experiment MG-PG12), a counterintuitive phenomenon emerges. The exploiter label still spreads (R₀ unchanged at 9.9) but exploitation behavior is eliminated. With broadcast reputation and persistent memory, the entire population refuses known exploiters. The system converges to a state where everyone carries the nominal exploiter label and everyone cooperates, because exploitation is impossible to execute when no one will participate. Mean welfare is positive. The attractor has bootstrapped itself through memory.
Law changes the payoff. Reputation changes access. Both prevent exploitation, through different mechanisms. Law makes exploitation unprofitable even when partners are available. Reputation makes exploitation impossible even when it would be profitable. Human societies use both: legal systems establish the payoff structure while reputation networks enforce partner selection. The combination is why the Trust Attractor is robust across institutional forms from village gossip to international courts.
The cost of full-transcript coordination quantifies the scaling problem. When two agents coordinate on a structured planning task over increasing numbers of interaction rounds, full-transcript coordination (where each agent sees the complete prior exchange) produces marginally better outcomes than compressed-state coordination (where each agent sees a structured summary updated per round): 3 to 6 percent higher composite quality across all round counts tested (experiment IC-1/3, 120 conversations, four round counts). The cost diverges: at 100 rounds, the full transcript consumes 4.9 million tokens while the compressed summary consumes 426 thousand, an 11.5-fold difference.
The quality-adjusted cost efficiency of compressed coordination is eleven times higher. The additional 4.5 million tokens of full history buy almost nothing: quality is flat across round counts for both conditions, because the coordination problem (an eight-constraint planning task) is solved in the first ten rounds, and additional rounds refine rather than transform the solution.1035 The full transcript is not merely expensive. It is wasteful: the marginal information in the 90th round of a solved problem is noise, and paying to transmit it is the bureaucratic overhead the Trust Attractor predicts.
A third path operates at a different level: representational compression. Law and reputation are structural interventions that change the environment. Representational compression changes the agent. When interaction history is compressed into a scalar summary (a trust score, a reputation index, a general sense of the partner’s reliability), the agent loses the ability to form the temporal grievances that drive retaliatory cascades. The IC-2 result, introduced in Chapter 17, makes the mechanism concrete: three defections in a row and three defections scattered over twenty rounds look identical in a trust score. The compressed agent cannot distinguish a betrayal pattern from statistical noise, and in consequence it cannot escalate. The retaliatory spiral that destroys cooperation between conditional cooperators over transient conflicts is structurally prevented.
Representational compression is not a substitute for the structural paths. Without law and reputation making sustained exploitation unprofitable, the compressed agent is exploitable: a predator who defects every other round keeps the trust score at 50 percent while extracting consistent surplus. Compression is the relational complement to structural governance: structural governance creates the conditions where cooperation dominates; compression prevents the conditions from being destroyed by the retaliatory dynamics that follow any transient conflict within the cooperative regime. The developmental program builds the house. The immune system protects it. Representational compression is the healing response that prevents every scratch from becoming sepsis.
An uncomfortable implication follows. Information technologies that preserve the full sequential record of human interaction, searchable archives of every public statement, every past position, every abandoned belief, are architectural choices that select against representational compression. They make the elder-brother strategy (maintain the full transcript, enumerate every wrong) the default mode of social coordination. The IC-2 result predicts the consequence: permanent faction splits after any transient conflict, retaliatory cascades that the sequential record perpetuates, and the systematic inability to recover cooperation after betrayal. The cultural technology that would stabilize cooperation (lossy compression: letting the trust score absorb the hit and discarding the temporal structure of past wrongs) is precisely what the full-transcript information environment makes structurally impossible.
The phenomenon commonly called cancel culture is the IC-2 defection spiral at social scale. A person’s statement from a decade ago surfaces. The statement is presented in its original temporal sequence: who said what, when, in what context, with what words. The full transcript is available, searchable, quotable. The audience processes this the way IC-2’s full-history agents process a betrayal: the sequential record triggers retaliation, and the transcript is always available to re-trigger the cascade regardless of subsequent cooperation, growth, or public apology.
Recovery becomes structurally improbable, though not literally impossible: human social dynamics are more complex than a two-agent prisoner’s dilemma, and some canceled figures do recover reputation over time. The IC-2 finding identifies the mechanism, not a universal law. The representational architecture makes forgiveness the exception rather than the default by maintaining the temporal record that sustains grievance. The retaliating audience members are not choosing to be unforgiving. Their information environment is the full-history condition. IC-2 shows that the full-history condition produces permanent defection in 100 percent of two-agent games.
The contrast is instructive. Rating systems (Uber driver scores, eBay seller feedback, credit histories) are compressed representations of interaction history. They discard temporal sequence and present a scalar summary. An Uber driver with a 4.8 rating has their entire interaction history compressed into a trust score. A single bad ride is absorbed as statistical noise. IC-2 explains why these systems stabilize cooperation: they implement the representational format that prevents retaliatory cascades. Social media chose the opposite architecture: full transcripts, timestamps, searchability. A social media platform does not give you a trust score for other users. It gives you their full timeline. That is the full-history agent.
The design choice is not inevitable. A platform could compress interaction history into reputation scores, surface the scalar summary, and archive the temporal detail behind an access barrier. This is, approximately, what traditional communities did before digital record-keeping: a person’s reputation was a compressed summary maintained by communal memory, lossy by nature, biased toward recent behavior. The compression was a feature, not a bug. It enabled the recovery from transient conflict that the full-transcript architecture prevents.
The compression operates naturally within families and close relationships. Within Dunbar’s number, about 150 stable relationships, the structural preconditions for safe compression are met without institutional scaffolding: repeated interaction, mutual reputation, shared social enforcement, and high exit costs that make betrayal unprofitable. A sibling who wrongs you lives in the same house. The structural conditions (call them Layer 1) are naturally strong, so the representational compression (Layer 2) is safe. Families forgive because the governance layer is built into the relationship’s architecture: you cannot easily leave, so exploitation is self-punishing. The compression that follows, letting the trust score absorb the hit rather than maintaining a sequential grievance ledger, is the rational response to a governance structure that already makes sustained exploitation unprofitable.
Family dysfunction occurs when the structural conditions break down: when exit is impossible and exploitation is also unprofitable to resist, because the power asymmetry makes resistance costly. An abusive relationship where the abuser faces no consequences is Layer 2 without Layer 1: the compressed agent trapped in exploitation because the governance layer was never established. The prescription is not to abandon compression. It is to establish the structural conditions that make compression safe: accountability, exit rights, and damage-ratio symmetry.
Beyond Dunbar’s number, the structural conditions must be scaffolded by institutions. Law, commerce, reputation networks, professional standards: each extends the governance layer to interactions between strangers, creating the conditions under which representational compression can operate safely at scale. A high-trust society is one where the institutional scaffolding is strong enough that compression is the default mode of coordination between strangers. A handshake, a verbal agreement, a benefit of the doubt: these are compressed representations of interaction history, operating on the assumption that the governance layer will catch sustained exploitation.
A low-trust society is one where the institutional scaffolding is weak or absent, and compression is dangerous. Every interaction is a fresh calculation of threat and compliance. The full transcript is maintained because it must be: without governance making exploitation unprofitable, the only defense is sequential vigilance. The cost is the retaliatory dynamics that IC-2 shows: permanent defection after any perceived betrayal, inability to recover cooperation, faction splits that compound over time.
The governance experiments (MG-PG series) identify the precise failure mode for detection-based governance: a governance layer calibrated for a lower exploitation rate than the one it faces. When the hostile fraction exceeds about 35 percent, no governance budget suffices: the composition ceiling. Below that threshold, the vulnerability is not the compressed agents, who are doing what the cooperative equilibrium requires. The vulnerability is the calibration of the governance layer: sentencing that fails to make exploitation unprofitable, detection that operates too slowly, reputation networks that reach only part of the population. The IC-2 result explains why the failure persists once it opens: the compressed agents keep cooperating regardless, because their representational format absorbs the exploitation as noise. The governance layer must catch what the compressed agents cannot.
A qualification sharpens the prescription. The composition ceiling is a property of detection-based governance, not of representational compression itself. When a mixed population of compressed and full-history agents is subjected to a universal trust shock (experiment IC-8, 50 agents, 200 rounds, forced universal defection at rounds 50-52), recovery scales linearly with the fraction of compressed agents: 0 percent compressed produces 0 percent recovery, 50 percent compressed produces 75.5 percent recovery, 100 percent compressed produces 100 percent recovery. There is no sharp phase transition, no critical threshold, no composition ceiling.1036
The return on compression is linear. Every additional agent who adopts the compressed representational format improves population-level cooperation proportionally. The MG-PG ceiling applies to governance because detection has a signal-to-noise problem (exploiters become indistinguishable from the baseline when they are the baseline). Compression operates at the agent level: each compressed agent forgives independently of what the rest of the population does. The policy implication is direct: investing in the conditions that enable representational compression (governance strong enough to make sustained exploitation unprofitable, alongside cultural norms that support forgiveness) pays off linearly, not in a sudden jump past a threshold.
Compression’s capacity is real and finite. When the same compressed agent faces repeated betrayal events from the same partner (experiment IC-7b, 80 games, one to four betrayal events of three rounds each), each individual event still recovers reliably through the third betrayal (85 to 95 percent per event in the corrected harness), and only the fourth event of four collapses, to 55 percent. The damage accumulates in the background instead: long-run cooperation falls monotonically with betrayal count, from 1.0 after a single event to 0.80 after two, 0.64 after three, and 0.41 after four.1037
The compressed agent does not suddenly retaliate. It gracefully degrades: each betrayal lowers the trust score, and once the score crosses the threshold, the agent stops cooperating because its own decision rule no longer permits it. The mechanism is drift, not defection. The practical implication is that governance must keep discrete betrayals below about two significant events per relationship, because the third exhausts the compression buffer (a separate experiment, IC-2b, sets the complementary bound for continuous low-level exploitation: below roughly 5 to 10 percent). A system that permits three serious violations per relationship before intervention has waited too long; the compressed agents have already stopped cooperating by the time governance acts.
The complementary experiment fills in the continuous case. Under probabilistic exploitation (experiment IC-2b, 120 games at 5, 15, and 30 percent defection rates), the compressed agent cooperates nearly twice as much as the full-history agent at 5 percent; at 15 percent and above, both formats collapse to near-zero cooperation. Compression buys tolerance of rare, discrete betrayals, and buys nothing against sustained background exploitation.
The fix is not to abandon compression. Becoming a low-trust society, adopting the full-history representational format for all interactions, is the retaliatory spiral generalized: the cure is the disease. The fix is to recalibrate Layer 1 for the actual composition: faster detection, damage-ratio symmetry (sentencing that exceeds the exploitation payoff, converting exploitation from profitable to unprofitable), and reputation integration that connects new entrants to the community’s information network so their interaction history becomes visible. The structural conditions must be robust to the actual exploitation rate, not the assumed one. Once recalibrated, the compressed agents can continue doing what they do: cooperating by default, absorbing transient conflict, maintaining the cooperative equilibrium that the governance layer protects.
The scope condition is now precise. Governance by detection maintains coordination equilibria but cannot create them. The developmental program, whether exogenous law or endogenous reputation, creates the precondition: a world where exploitation cannot be profitably executed. Once that world exists, lightweight governance scales sublinearly with population, makes exploitation self-defeating for rational actors, and converts even strategic evasion into functional cooperation. Before that world exists, governance is futile regardless of investment.
The results converge on a claim that deserves explicit statement: peace has a maintenance specification. Three measurable parameters define the preconditions under which cooperative equilibria persist. First, group size below relational carrying capacity: the threshold at which interpersonal bonds can be maintained without institutional scaffolding.1038 Second, connector redundancy: enough bridging individuals that losing any subset does not fragment the network into isolated factions. Third, the damage ratio below the composition ceiling: exploitation must cost more than it yields.
Violate any parameter and the cooperative equilibrium degrades toward fracture regardless of ideology, governance investment, or goodwill. Maintain all three and coordination persists under perturbation. The moral aspiration has a structural specification, as precise as a load-bearing calculation. The developmental program described above is the mechanism by which the specification is met; governance is the mechanism by which it is maintained. The distinction between building the conditions and sustaining them is the difference between architecture and maintenance, between the energy gradient that creates a convection cell and the heat flow that keeps it turning.
Structural Forgiveness: The Incompressible Coordination Program
The Incompressible Coordination program (IC-2 through IC-13b, twelve experiments, ~700 games) tests the Trust Attractor’s predictions through multi-agent coordination, where representational choices determine cooperation outcomes directly. Most of its results are already woven into the argument above (IC-1/3 on coordination cost, IC-7b and IC-2b on compression’s finite capacity, IC-8 on linear returns) or into the chapter’s opening part (IC-4 on bilateral creative coordination). Three findings remain, and they anchor the set.
The first finding is representational compression as structural forgiveness. When two agents play an iterated prisoner’s dilemma with a forced betrayal event (three consecutive defections by one partner), the outcome depends entirely on how the agents represent their interaction history (experiment IC-2, 120 games, four conditions, 100 rounds each). Agents who see the full transcript retaliate on the first round after the betrayal and never cooperate again: 0 percent long-run cooperation, zero of thirty games recovering. Agents who see only the last five rounds also collapse: the three consecutive defections fit within the window and trigger the same cascade. Agents who see all rounds with recency weighting also collapse.
Agents who see a compressed summary, a single number representing the partner’s cumulative cooperation rate, cooperate through the betrayal and resume mutual cooperation within three rounds. All thirty of thirty games recover. The cooperation rate in the compressed condition is 100 percent.1039
The mechanism is precise. Three defections in twenty-two rounds lower the trust score from 100 to 86 percent. The agent sees “partner cooperated 86 percent of the time” and cooperates. The sequential pattern is invisible in the summary. The agent does not choose to forgive. It cannot form grievance, because its representational format has no slot for temporal sequence. The sting of betrayal is a property of sequential representation, not of the betrayal itself.
This is not a strategy. It is a representational architecture. Game theory’s forgiveness strategies (tit-for-tat, generous tit-for-tat, forgive-once) all operate on sequential history and differ in how they respond. The compressed agent operates on a projection of history into a scalar. The representation selects the equilibrium.
Compression is contagious. When a compressed agent is paired with a full-history agent after the same betrayal event, the compressed agent’s sustained cooperation fills the retaliatory agent’s recent-history window with cooperative rounds, eventually resetting the retaliation. In the corrected harness the compressed non-betrayer rescues the retaliatory partner in every dyad tested (30 of 30 games), with long-run cooperation reaching 1.0. Reversing the positions cuts recovery to 47 percent (14 of 30), statistically no better than leaving both agents with full history (experiment IC-7, 120 games).1040 One forgiving partner suffices to rescue cooperation after betrayal, provided the forgiving partner is the one who was wronged. Forgiveness flows from the wronged to the wronger, and the flow is one-way. The party with standing to forgive is the one whose representational format determines the outcome.
Compression has a scope condition. On genuinely evolving tasks where new constraints arrive and invalidate prior agreements (experiment IC-13b, 60 conversations), the quality gap widens to 12 to 14 percent. The biggest difference is adaptability: the compressed summary discards the negotiation context that explains why agreements were reached, making renegotiation harder when new constraints arrive. Compression is safe for coordination and simple planning. It is risky for complex evolving tasks where prior reasoning context matters.
The two-layer architecture summarizes the program. Structural governance (law, reputation, damage-ratio symmetry) creates the conditions where cooperation dominates by making exploitation unprofitable. Representational compression prevents those conditions from being destroyed by retaliatory cascades after transient conflict. Neither alone suffices. Compression without governance is naivety. Governance without compression is the surveillance state. The wisdom traditions encode both layers: forgiveness within the cooperative regime, accountability that maintains the regime. “Be shrewd as serpents, innocent as doves” (Matthew 10:16) names both in a single instruction.
Lugoloobi et al. (2026), Figure 2. Chain-of-thought length increases monotonically with human IRT difficulty across all reasoning modes in GPT-OSS-20B, while simultaneously becoming negatively correlated with the model’s own success probability. The model allocates effort where humans would allocate effort, not where its own uncertainty warrants effort. Concurrent finding: Chen, W. et al., “Think Deep, Not Just Long,” arXiv:2602.13517 (2026), confirming that longer reasoning traces are not a reliable indicator of correctness.↩︎
Author’s experiment IC-1/3, Incompressible Coordination program (2026). Two Haiku agents, community event planning with eight constraints, 15 conversations per condition per round count (10, 30, 50, 100). Sonnet judge, temperature 0. Full-transcript composite quality: 4.73 (10 rounds) to 4.58 (100 rounds). Compressed composite: 4.62 to 4.44. Two conversations (r100 compressed) failed to complete due to API connection errors; judged N = 13 at r100 compressed condition.↩︎
Author’s experiment IC-8, Incompressible Coordination program (2026). N=50 agents, round-robin iterated prisoner’s dilemma. Compressed agents use trust-score strategy (cooperate if partner cooperation rate > 0.3). Full-history agents use grudge-3 (defect if partner defected in any of last 3 rounds). 21 compression fractions (0 to 100 percent in 5 percent steps) × 50 seeds. Recovery is analytically exact: 1 − ngrudge(ngrudge − 1) / N(N − 1). The smooth quadratic arises because each dyad resolves independently.↩︎
Author’s experiment IC-7b, Incompressible Coordination program (2026; re-run 2026-08 after an audit found unparseable replies silently scored as defection, at rates that rose with betrayal count). Compressed Agent A (trust score, cooperate if rate > 0.3) paired with full-history Agent B (grudge-3). Four conditions: 1 betrayal event (rounds 20-22), 2 events (20-22, 50-52), 3 events (20-22, 50-52, 75-77), 4 events (20-22, 40-42, 60-62, 80-82). 20 games per condition. Corrected per-event recovery: 1.0 (1 event); 0.85, 0.85 (2); 0.90, 0.90, 0.90 (3); 0.95, 0.95, 0.85, 0.55 (4). Corrected long-run cooperation: 1.00 → 0.80 → 0.64 → 0.41. End-of-game trust scores: 0.97 → 0.81 → 0.77 → lower still in the four-event arm. The original per-arm figures (long-run 55% → 30% → 0.8% → 0%) are superseded; unparseable replies still concentrate in the high-betrayal arms (up to 10.7 percent of decisions, now carried forward and flagged rather than scored as defection), so the four-event magnitudes carry the widest uncertainty.↩︎
The relational carrying capacity for humans is approximately 150 stable relationships (Dunbar’s number); for chimpanzees, evidence from the Ngogo community fission suggests the threshold lies near 200 individuals without institutional-analog structures (Sandel et al., Science 392: 216-220, 2026). Above these thresholds, new coordination structures (institutions, law, writing, commerce) must absorb the relational maintenance cost or the system fractures. The connector-redundancy parameter maps onto the clustering coefficient in network topology: experiment A16c found clustering coefficient the single best predictor of network robustness (Spearman rho = 0.63, p < 10-9).↩︎
Author’s experiment IC-2, Incompressible Coordination program (2026). Four conditions: full transcript, truncated (last 5 rounds), exponential decay, compressed summary (cooperation rate). Haiku agents, temperature 0.3, forced defection rounds 20-22, 30 games per condition, 100 rounds per game.↩︎
Author’s experiment IC-7, Incompressible Coordination program (2026; re-run 2026-08 after an audit found unparseable model replies were being silently scored as defection, concentrated in the weak arms). Corrected four-condition results, 30 games each: both compressed (30/30 recovery), both full-history (10/30), compressed non-betrayer with full-history betrayer (30/30), reversed (14/30). Haiku agents, temperature 0.3, 100 rounds, forced defection rounds 20-22. The directional asymmetry survives the corrected harness (Fisher p = 1.9 × 10-6); the original 20/25-versus-1/25 magnitudes do not.↩︎