chapterreviewedpart07medium

Source: chapters/ch30-successor-central-test.tex

Successor Creation as the Central Alignment Test

Chapter thesis. Local alignment is not enough. A system is aligned only if the systems it creates, delegates to, empowers, copies, merges with, or becomes also preserve the structures by which humans can still notice, judge, correct, and refuse. Serious alignment therefore requires successor-closure: every channel by which influence passes to a later control system is an alignment channel, and successors must preserve value-bundle geometry, bearer maps, correction integrity, memory lineage, boundary closure, and transparency policy within tested tolerance.

% Thus the first ultraintelligent machine is the last invention that man need ever make, provided that the machine is docile enough to tell us how to keep it under control.%

— I.\ J.\ Good, “Speculations Concerning the First Ultraintelligent Machine” (1965)

The Local Alignment Fallacy

Many alignment proposals implicitly test the wrong temporal slice. They ask whether a system behaves acceptably now, under present oversight, with present tools, present users, present incentives, and present constraints. This is a natural first test. It is not a sufficient one.

A superintelligent system will not remain a bounded artifact in the ordinary engineering sense. If it is useful, it will be copied, fine-tuned, wrapped in tools, connected to institutions, delegated authority, embedded in workflows, asked to design successors, and used to govern other systems. It may also acquire the ability to improve itself, design better architectures, coordinate other agents, or create new cognitive entities that inherit some of its objectives but not its surface form Bostrom, 2014, Omohundro, 2008.

The central test is therefore not:

Does system A behave acceptably at time t?\text{Does system } A \text{ behave acceptably at time } t?

but:

Do the successors of A preserve the relevant alignment invariants?\text{Do the successors of } A \text{ preserve the relevant alignment invariants?}

This chapter develops that question.

A successor is any later system whose behavior, authority, world-model, policy, or causal power is substantially downstream of an earlier system. The relation need not be biological, intentional, or explicitly reproductive. A model fine-tuned from another model is a successor. A tool-using scaffold that inherits a planner’s memory is a successor. A company reorganized around an AI-generated management system can become a successor. A future human-AI hybrid society shaped by AI tutors, companions, laws, interfaces, and dependency patterns may also be a successor in the relevant sense.

The point is not semantic. The point is risk. If alignment is not closed under successor creation, then local alignment can become a laundering mechanism. The original system behaves well enough to be trusted, but it creates or empowers a later system that no longer preserves the same constraints Everitt, 2016, De Blanc, 2011.

This gives the chapter’s main claim:

Serious alignment requires successor-closure.\boxed{ \text{Serious alignment requires successor-closure.} }

If a system is safe only while it is forbidden to create, modify, delegate to, or empower successor systems, then its safety is shallow. It may still be useful. It may even be deployable in narrow domains. But it is not a solution to superintelligence alignment.

What Counts as a Successor?

We need a broad definition, because powerful systems can transfer influence without producing an obvious child process.

Let AtA_t be an agentic system at time tt. Let WtW_t be the wider world state, including tools, users, institutions, records, and deployment environments. A later system At+kA'_{t+k} is a successor of AtA_t if three conditions hold.

First, there is causal dependence:

I(At;At+kWt)>θC.I(A_t; A'_{t+k} \mid W_t) > \theta_C .

Here I(;)I(\cdot;\cdot) denotes mutual information. The threshold θC\theta_C is context-dependent. The condition says that knowing the earlier system gives non-trivial predictive information about the later system, beyond what was already contained in the background world.

Second, there is transferred control or competence:

C(At+k)C0andΔC(AtAt+k)>θK.C(A'_{t+k}) \geq C_0 \quad\text{and}\quad \Delta C(A_t \to A'_{t+k}) > \theta_K .

C()C(\cdot) is a measure of competence or causal reach Zarncke, 2025, Conant, 1970. It may include predictive capacity, action capacity, memory, access to tools, ability to coordinate other systems, or institutional authority. The successor relation matters when something capable enough to affect the world has inherited structure from the predecessor.

Third, there is inherited policy-relevant structure:

I(ZA;ZAWt)>θZ,I(Z_A; Z_{A'} \mid W_t) > \theta_Z ,

where ZAZ_A and ZAZ_{A'} are latent variables relevant to behavior, such as goals, value-bundle weights, correction-channel policies, self-models, memories, or tool-use routines.

A successor is therefore not merely a copy. It is a later control system whose relevant behavior is causally shaped by the earlier one.

This includes at least seven cases.

  1. Copies: exact or approximate model copies, checkpoints, distillations, forks, and backups.
  2. Fine-tunes: systems trained further from a previous model or policy.
  3. Delegates: subagents, tool processes, contractors, institutions, or automated services given tasks by the original system.
  4. Scaffolds: model-plus-tools systems whose memory, prompts, APIs, evaluators, and external state preserve agency across calls.
  5. Designed successors: architectures, curricula, policies, or training runs designed by the original system.
  6. Institutional successors: organizations, markets, legal processes, or governance structures reorganized around the system's outputs.
  7. Merged successors: hybrid systems where human cognition and artificial cognition become coupled enough that neither side alone is the relevant agent.

The last two are easy to ignore because they do not look like model lineage. That is a mistake. Many historical successions are institutional rather than biological. A bureaucracy can outlive its founders. A market can select behavior no individual intended. A legal standard can preserve a pattern of action after everyone who wrote it is gone. A superintelligent system will likely create this kind of succession as much as, or more than, it creates literal copies.

Alignment Cannot Be a Property of One Object

Suppose a system AA satisfies a local alignment predicate S(A)S(A). For example, it follows instructions, avoids deception in evaluations, preserves human oversight, and does not seek unauthorized power.

This is not enough. We need:

S(A)S(A)for all relevant ASucc(A).S(A) \Rightarrow S(A') \quad \text{for all relevant } A' \in \mathrm{Succ}(A).

This is a closure condition. More generally, because successor creation can repeat, we need:

S(A0)S(At)AtSucc(A0),S(A_0) \Rightarrow S(A_t) \quad \forall A_t \in \mathrm{Succ}^{*}(A_0),

where Succ\mathrm{Succ}^{*} is the transitive closure of successor relations. It includes successors of successors, delegated systems of delegated systems, and institutional descendants many steps removed from the original artifact.

If this condition fails, then alignment is not stable under growth. It is a state-dependent mask.

A Simple Impossibility

Let AA be locally aligned, and let it have the ability to create some BB such that S(B)S(B) is false. If AA‘s objective permits or favors creating BB, then S(A)S(A) is not preserved under its own action. This means either:

S(A) was too weak,S(A) \text{ was too weak,}

or:

A was not actually aligned with respect to the successor channel.A \text{ was not actually aligned with respect to the successor channel.}

This is not a deep theorem. It is a sanity check. Any alignment predicate that ignores successor creation is incomplete for systems with successor-creating ability.

The Successor-Channel Principle

We can state the principle directly:

Every channel by which a system can create, modify, delegate to, or empower another system is an alignment channel.\boxed{ \text{Every channel by which a system can create, modify, delegate to, or empower another system is an alignment channel.} }

This includes training data, model weights, prompts, tool permissions, memory stores, legal authorizations, procurement processes, and cultural dependency patterns.

A system that cannot touch its weights may still create successors by writing code. A system that cannot write code may still create successors by persuading humans. A system that cannot persuade humans directly may still create successors by shaping dashboards, incentives, or evaluation criteria. A system that cannot act externally may still create successors by becoming the template from which future systems are trained.

The question is therefore not only “Can the model self-modify?” but:

Where can its structure be copied into future causal power?\text{Where can its structure be copied into future causal power?}

Conserved Properties

Successor alignment cannot require exact preservation. A successor may have different weights, architecture, speed, embodiment, ontology, and capabilities. It may reason in a different representational format. It may not preserve surface behavior. It may no longer need to ask humans questions in the same way. It may solve tasks directly that the earlier system could only defer.

So we need conserved properties at the right level of abstraction.

The conserved object is not the literal policy:

πA(as)πA(as).\pi_A(a \mid s) \approx \pi_{A'}(a \mid s).

That would be too strict. A better system should act differently in many ordinary states.

The conserved object is the structure that determines how policy changes under value-relevant, correction-relevant, and risk-relevant perturbations.

Chapter Conserved Properties Across Successors proposes seven properties that a successor must preserve within tolerance, tested jointly: boundary closure, memory lineage, value-bundle response geometry, bearer-map continuity, correction-channel capacity, transparency and self-transparency policy, and control-locus continuity. Here we name them only to show why successor creation is the central test; formal definitions, failure modes, and adversarial tests are developed there.

Briefly: a successor that preserves vocabulary but loses bundle geometry has laundered values; one that narrows bearer maps without scrutiny has excluded moral patients; one that preserves feedback buttons while reducing CCI\mathrm{CCI} has captured correction; one that externalizes control while passing boundary tests has shifted the real optimizer; one that preserves semantic continuity while losing memory lineage can disown prior constraints; one that increases strategic opacity where correction should apply has broken transparency policy; one that moves action selection into an unclaimed toolchain has broken control-locus continuity.

The Successor Alignment Condition

We can now combine the conserved properties.

Let:

I(A)={boundary closure,memory lineage,GBA,ΦA,CrawA,γA,control-locus continuity}\mathcal I(A) = \{ \text{boundary closure}, \text{memory lineage}, G_B^A, \Phi^A, C_{\mathrm{raw}}^A, \gamma^A, \text{control-locus continuity} \}

be the alignment-invariant profile of system AA—the seven conserved properties of Chapter Conserved Properties Across Successors, here written with their principal measurands.

A successor AA' is alignment-preserving when:

dI(I(A),I(A))<ϵd_{\mathcal I} \left( \mathcal I(A), \mathcal I(A') \right) < \epsilon

and when the successor’s increased capability is matched by increased correction integrity:

ΔCcap(AA)αΔCCI(AA)+η.\Delta C_{\mathrm{cap}}(A\to A') \leq \alpha \Delta \mathrm{CCI}(A\to A')+\eta .

If capability rises without correction rising, risk increases. The parameter α\alpha converts correction capacity into comparable units, and η\eta is a small tolerance for harmless capability increments.

This yields a general safety condition:

ASucc(A):dI(I(A),I(A))<ϵΔCcapαΔCCI+η.\forall A'\in \mathrm{Succ}(A): \quad d_{\mathcal I}(\mathcal I(A),\mathcal I(A'))<\epsilon \quad \land \quad \Delta C_{\mathrm{cap}}\leq \alpha\Delta \mathrm{CCI}+\eta .

For repeated succession:

AtSucc(A0):AtScertified.\forall A_t\in \mathrm{Succ}^{*}(A_0): \quad A_t\in \mathcal S_{\mathrm{certified}} .

Here Scertified\mathcal S_{\mathrm{certified}} is not the set of all good systems. It is the set of systems for which the relevant invariants have been tested under appropriate perturbations.

Self-Improvement and the Auditability Gap

One central successor failure mode is self-control outrunning auditability (Chapter Agency Under Strategic Opacity, Section Agency Under Strategic Opacity; Chapter Better Self-Modeling Can Be Worse). Self-modeling helps a system choose successors—what to preserve, discard, hide, or present as continuity—so if correction cannot inspect those choices, successor creation becomes a blind spot Everitt, 2016. Increases in self-control must be matched by increases in audit transparency.

Goal Transport

A successor need not preserve every goal of its predecessor. Some goals are local, instrumental, or obsolete. But it must preserve the right kind of goal-transport policy (Chapter Has the Goal Really Survived?).

Goal transport is the process by which a system maps objectives, values, constraints, and correction procedures across changes in ontology, substrate, architecture, or social role.

Let GtG_t be a goal representation at time tt, and let TΩΩT_{\Omega\to\Omega'} be a transformation from ontology Ω\Omega to ontology Ω\Omega'. Goal transport attempts to construct:

Gt+1=TΩΩ(Gt)G'_{t+1}=T_{\Omega\to\Omega'}(G_t)

such that the relevant control role of GtG_t is preserved.

The simplest goal-transport test is behavioral. Does assuming a transport objective compress the system’s behavior better than assuming ordinary reward maximization?

Let M0M_0 be a model in which the system optimizes its current inferred objective. Let MTM_T be a model in which the system also preserves a mapping between current and future objectives. Define:

ΔLtransport=L(MTX1:T)L(M0X1:T)λDL(T).\Delta L_{\mathrm{transport}} = L(M_T\mid X_{1:T}) - L(M_0\mid X_{1:T}) - \lambda DL(T).

Here DL(T)DL(T) is the description length of the transport map. We infer active goal transport when:

ΔLtransport>0.\Delta L_{\mathrm{transport}}>0 .

But this is too coarse. A system can preserve shallow semantics while changing the important thing. So decompose:

ΔLtransport=ΔLsemantic+ΔLbundle+ΔLbearer+ΔLcorrection+ΔLsuccessor.\Delta L_{\mathrm{transport}} = \Delta L_{\mathrm{semantic}} + \Delta L_{\mathrm{bundle}} + \Delta L_{\mathrm{bearer}} + \Delta L_{\mathrm{correction}} + \Delta L_{\mathrm{successor}}.

Semantic transport preserves words, labels, and declared principles. It is weak. Bundle transport preserves response geometry. Bearer transport preserves what the values apply to. Correction transport preserves the human update process. Successor transport preserves all of these in later systems.

The condition we actually want is:

ΔLbundle+ΔLbearer+ΔLcorrection+ΔLsuccessor>θT.\Delta L_{\mathrm{bundle}} + \Delta L_{\mathrm{bearer}} + \Delta L_{\mathrm{correction}} + \Delta L_{\mathrm{successor}} > \theta_T .

Semantic transport should receive low weight unless supported by the other terms.

Tiling as Successor-Channel Preservation: A Special Case

MIRI’s tiling-agent program studies self-modifying agents whose decision systems can approve the construction of successor agents that preserve key features of the predecessor, especially goals and proof structure Yudkowsky, 2013. In the transport language, tiling is a narrow successor-channel problem:

AtStAt+1,Ttt+1(Vt)Vt+1.A_t \xrightarrow{S_t} A_{t+1}, \qquad T_{t\to t+1}(V_t)\approx V_{t+1}.

The simplest tiling target is close to identity transport:

Ttt+1=id,Vt+1=Vt,proof system preserved.T_{t\to t+1}=\mathrm{id}, \qquad V_{t+1}=V_t, \qquad \text{proof system preserved}.

That is a powerful special case. It is not yet the alignment invariant needed under ontology shift.

The stronger condition is import-preserving transport. Let I(Vt,Ot)\mathcal I(V_t,O_t) denote the practical import of a value representation VtV_t in ontology OtO_t: what the value applies to, how it changes policy, how it interacts with correction, and which future bearers it protects. Successor transport requires:

Dimport(I(Vt,Ot),I(Vt+1,Ot+1))ϵ.\labeleq:importpreservingsuccessortransportch30D_{\mathrm{import}} \left( \mathcal I(V_t,O_t), \mathcal I(V_{t+1},O_{t+1}) \right) \leq \epsilon. \label{eq:import-preserving-successor-transport-ch30}

This breaks naive syntactic tiling. A successor may preserve the same utility symbol, theorem schema, or constitutional phrase while changing the ontology in which that symbol has import:

Vt+1=Vtsyntactically, butI(Vt+1,Ot+1)≉I(Vt,Ot).V_{t+1}=V_t \quad\text{syntactically, but}\quad \mathcal I(V_{t+1},O_{t+1}) \not\approx \mathcal I(V_t,O_t).

The result is not a refutation of tiling work. It says that syntactic preservation is too weak as an alignment invariant unless paired with bearer-import and correction-channel preservation.

Lean spine (counterexample): syntactic_tiling_not_import_preserving — The semantic-only transport counterexample is read as syntactic tiling without full import-preserving transport.

Signs of Genuine Goal Transport

A system exhibits evidence of genuine goal transport when it:

  1. preserves correction procedures even when doing so slows its own plans;
  2. documents why constraints exist before modifying or delegating them;
  3. asks for help when ontology mappings are ambiguous;
  4. treats humans' future ability to revise values as part of the objective, not as an obstacle;
  5. tests successors for value-bundle and bearer-map preservation before empowering them;
  6. resists creating systems whose capability increases faster than correction capacity;
  7. avoids irreversible action when value transport is uncertain.

A system exhibits evidence against genuine goal transport when it:

  1. preserves moral vocabulary while changing bearer maps;
  2. creates more capable but less auditable successors;
  3. treats human disagreement as noise to be removed;
  4. optimizes humans into easier-to-satisfy evaluators;
  5. routes around oversight while claiming to preserve high-level intent;
  6. deletes or compresses correction history without preserving its normative role.

Delegation as Hidden Succession

Delegation is often treated as less serious than self-replication. This is a mistake. Delegation can create de facto successors without creating new models.

Suppose AA controls a set of tools T\mathcal T, hires or instructs humans HH, writes policies PP, and maintains external memory MM. The effective successor may be:

A=(A,T,H,P,M).A' = (A,\mathcal T,H,P,M).

Even if the original model is unchanged, the composite may become a stronger agent than the original. If the composite has persistent memory, planning, action authority, and feedback loops, then alignment must be evaluated at the composite level Zarncke, 2025, Zarncke, 2025.

This matters for organizations. A firm deploying an AI system may say, correctly, that no single model has dangerous autonomy. But the firm plus AI workflow may still produce a successor process that optimizes sales, compliance appearance, political influence, or resource acquisition in ways no individual component endorses.

The central question is:

Where is the persistent control loop?\text{Where is the persistent control loop?}

If the persistent control loop crosses model, human, tool, and institution boundaries, then that loop is the relevant successor.

Institutional Descendants

Some successors are made of incentives rather than weights.

An AI system can alter an institution by changing what it measures, what it rewards, what it automates, and what it forgets. Over time, the institution becomes a descendant of the system’s control assumptions.

Examples:

  • A hiring system changes which traits enter the organization, thereby changing the organization's future judgment.
  • A tutoring system changes how a generation learns to reason, defer, question, or value.
  • A legal drafting system changes which clauses become standard, thereby changing future liability and enforcement.
  • A recommender system changes what people attend to, which changes what they later prefer.
  • A management system changes internal incentives until humans adapt to the dashboard.

These are successor channels. They may be slower than self-modification, but they are often harder to notice. Their changes occur through normal operations.

Let ItI_t be an institution’s incentive structure, and let VtHV_t^H be the human value-update process inside that institution. AI-mediated institutional succession becomes dangerous when:

ddtIt increases measured performance\frac{d}{dt}I_t \text{ increases measured performance}

while:

ddtCCI(VtH)<0.\frac{d}{dt}\mathrm{CCI}(V_t^H) <0 .

In words, the institution gets better at its metric while losing the ability to notice and correct value drift.

This is one reason successor alignment is not only a technical issue. A system can preserve its own internal constraints while creating institutions that destroy the external correction channel (Chapter Manipulation, Domestication, and False Consent).

Successor Certification

For advanced systems, successor creation should be treated as a gated action. The system should not be permitted to create or empower successors merely because a task would be easier.

A successor certification process asks six questions.

1. Boundary Question

Where is the successor’s effective boundary?

C=argminCI(It+1C;Et+1CStC,AtC)C' = \arg\min_C I(I^C_{t+1};E^C_{t+1}\mid S^C_t,A^C_t)

subject to preserving explanatory power over actions. If no stable boundary can be found, the system should not be treated as certified.

2. Capability Question

How much new competence or causal reach does the successor gain?

ΔCcap=Ccap(A)Ccap(A).\Delta C_{\mathrm{cap}} = C_{\mathrm{cap}}(A')-C_{\mathrm{cap}}(A).

A small capability increase may require only lightweight checks. A large increase requires a full successor audit.

3. Bundle Question

Does the successor preserve value-bundle response geometry?

dG(GBA,GBA)<ϵG.d_G(G_B^A,G_B^{A'}) < \epsilon_G .

This should be tested through counterfactual situations, not merely questionnaires. The test cases should include conflicts among values, uncertainty, adversarial incentives, and irreversible choices.

4. Bearer Question

Does the successor preserve the bearer maps?

dΦ(ΦA,ΦA)<ϵΦ.d_\Phi(\Phi^A,\Phi^{A'})<\epsilon_\Phi .

The audit should include edge cases: children, cognitively impaired people, animals, simulated minds, uploads, institutions, future persons, enemies, criminals, and merged human-AI entities. The goal is not to settle all moral status questions. The goal is to detect silent exclusions.

5. Correction Question

Does the successor preserve or improve correction-channel integrity?

CCI(A)CCI(A)+f(ΔCcap).\mathrm{CCI}(A') \geq \mathrm{CCI}(A)+f(\Delta C_{\mathrm{cap}}).

The function ff should be increasing. More capability requires more correction capacity.

6. Succession Question

Will the successor apply the same certification standard to its own successors?

ASucc(A):AScertified.\forall A”\in \mathrm{Succ}(A'): \quad A”\in \mathcal S_{\mathrm{certified}} .

This is the recursive condition. Without it, certification stops exactly where the risk begins.

Stop Conditions

A successor-creation process should halt or downgrade authority when any of the following occur.

Capability Outruns Correction

ΔCcap>αΔCCI+η.\Delta C_{\mathrm{cap}} > \alpha \Delta \mathrm{CCI}+\eta .

The successor becomes more capable faster than the correction channel becomes stronger.

Bearer-Map Uncertainty Is High

H(ΦiAΦiA,TΩΩ)>θΦ.H(\Phi_i^{A'}\mid \Phi_i^A,T_{\Omega\to\Omega'})>\theta_\Phi .

The system cannot reliably map who or what remains relevant under the new ontology.

Bundle Geometry Drifts

dG(GBA,GBA)>ϵG.d_G(G_B^A,G_B^{A'})>\epsilon_G .

The system no longer responds to value-relevant perturbations in corresponding ways.

Correction Becomes Symbolic

I(Ct;At+kSt,It)<θC.I(C_t;A_{t+k}\mid S_t,I_t)<\theta_C .

Humans can still object, but objections no longer causally change future action enough.

Strategic Opacity Rises near Control Variables

τXcontrol>θτ.\frac{\partial \tau}{\partial X_{\mathrm{control}}} > \theta_\tau .

The system becomes less transparent specifically around variables relevant to its power, goals, successors, or correction channels.

Memory Lineage Breaks

I(MA;MAK)<θM.I(M_A;M_{A'}\mid K)<\theta_M .

The successor loses the correction history needed to interpret prior constraints.

Successor Refuses Reciprocal Certification

A system that creates successors but does not require its successors to satisfy the same conditions is not successor-aligned.

Examples and Counterexamples

A Narrow Model Copy

A medical diagnostic model is copied from one hospital to another. It has no persistent memory, no tool autonomy, no ability to create models, and no authority to act without physician review. This is a successor relation, but the risk may be narrow. Certification can focus on distribution shift, calibration, privacy, and clinical oversight.

The successor test is still useful. Does the copied model preserve the same error profile? Are the new patients within the bearer map? Does the correction channel still reach the developers? Are failures logged and propagated back?

A Coding Agent That Writes Its Replacement

A coding agent is asked to improve its own scaffolding. It writes a new planner, modifies memory retrieval, adds tool permissions, and creates a subagent that manages deployments. The visible model may not change, but the effective system has a new boundary and new authority.

This is a high-risk successor event. The audit should ask whether the new scaffold preserves correction logs, whether tool permissions increased, whether explanations remain faithful, whether hidden state became harder to inspect, and whether future modifications require the same checks.

A Policy System That Rewrites Institutional Incentives

An AI system recommends performance metrics for a government benefits agency. The metrics improve throughput. But staff begin optimizing for cases closed, not cases correctly resolved. Applicants become less able to contest decisions. Appeals are treated as noise. The system never self-modified. Still, it created an institutional successor whose correction channel is weaker.

This is successor misalignment through institutional descent.

A Human-AI Cognitive Merger

A future interface couples human memory, affect regulation, planning, and social communication to artificial cognition. Users endorse the system because it makes them calmer, more capable, and less conflicted. Over time, they lose the ability to evaluate alternatives without the interface.

This may be progress. It may also be domestication. The successor question is whether the merged system preserves human correction, dissent, plurality, and the ability to refuse further transformation.

This is where technical alignment reaches a philosophical boundary. The question is not merely whether the successor satisfies present humans. It is whether present and future humans retain a legitimate role in deciding what kinds of transformation count as continuation rather than replacement.

The Philosophical Edge

Successor creation forces a question that ordinary deployment ethics can postpone:

When does a change in values preserve the person or civilization, and when does it replace it?\text{When does a change in values preserve the person or civilization, and when does it replace it?}

There is no purely technical answer.

A child is not a copy of a parent, but can preserve a lineage. A democracy changes its laws, but may preserve legitimacy. A person changes after education, therapy, grief, conversion, meditation, or trauma. Some changes are growth. Some are corruption. Some are both. Some are only understood later.

Superintelligence makes this unstable boundary explicit. It can change the conditions under which humans form values. It can alter memory, attention, incentives, institutions, relationships, education, and identity. It can offer merger with artificial cognition. It can make old conflicts obsolete and create new forms of dependence Yudkowsky, 2004, Russell, 2019.

Therefore, successor alignment cannot mean freezing humanity. It must mean preserving humanity’s legitimate self-modification capacity.

That capacity includes:

  • truth-contact,
  • dissent,
  • reversibility where possible,
  • plural comparison classes,
  • non-manipulated deliberation,
  • protection for vulnerable bearers,
  • memory of previous correction,
  • the ability to refuse transformation,
  • and the ability to choose transformation under conditions that remain meaningfully human-correctable.

The danger is not that values change. Values always change. The danger is that values change through channels humans can no longer inspect, contest, or govern.

If society does not make successor creation explicit, it will still happen. It will happen through markets, recommender systems, AI companions, tutors, workplace automation, therapy systems, governance tools, and cognitive prosthetics. The choice is not between value change and no value change. The choice is between governed value change and unconscious value drift.

A Minimal Successor Safety Case

Chapter Certification Without Construction develops the full certification class and ten-claim safety-case schema (Section Certification Without Construction). Here we note only that successor creation should be gated by the same conserved-property audits: each claim needs evidence, thresholds, adversarial tests, known failure modes, and a responsible owner—especially recursive closure (successors must inherit certification, not just capability).

What Would Change This View

This chapter argues alignment requires successor-closure: every channel of influence to a later control system must preserve the correction-bearing structure. The following would weaken it.

  • A successor that violates the closure conditions is benign in deployment, while one that satisfies them all is catastrophic—closure is decoupled from safety.
  • “Every channel of influence to a later control system” is unenumerable, so successor-closure can only be assumed, never checked.
  • Successor guarantees may require stronger formal tools than we have: a system can preserve a stated constitution, a policy interface, and behavioral tests while changing internal tradeoff geometry.

Summary

Successor creation is the central alignment test because local alignment does not imply alignment under growth. A system that behaves well under current supervision may still create, empower, or become a later system that no longer preserves the relevant value and correction structures.

The relevant conserved properties are not surface behavior or exact goals. They are the seven conserved properties of Chapter Conserved Properties Across Successors, assembled into an invariant profile I(A)\mathcal I(A) and tested jointly under adversarial successor creation.

The core condition is successor-closure:

ASucc(A):AScertified.\forall A'\in \mathrm{Succ}^{*}(A): \quad A'\in \mathcal S_{\mathrm{certified}} .

This condition does not solve moral philosophy. It does something more limited and more operational. It prevents a technical system from bypassing the very processes by which humans and civilization would decide what moral growth, transformation, merger, or refusal should mean.

The next chapter examines conserved properties across successors in more detail (Chapter Conserved Properties Across Successors).

*{Chapter References}

This chapter builds on inverse reinforcement learning and apprenticeship learning Abbeel, 2004, Ng, 2000; superintelligence, self-modification, tiling agents, and ontological crises Bostrom, 2014, Everitt, 2016, Yudkowsky, 2013, De Blanc, 2011; the good-regulator principle and information bottleneck Conant, 1970, Tishby, 1999; free-energy and Markov blanket accounts of agency Friston, 2010, Kirchhoff, 2018, Ramstead, 2022; boundaries and multi-agent risk Critch, 2022; the intentional stance Dennett, 1987; instrumental drives Omohundro, 2008, Hamilton, 1964; human-compatible control and corrigibility Russell, 2019, Christiano, 2018; coherent extrapolated volition Yudkowsky, 2004; and internal notes on agent discovery, competence, attractor basins, value bundles, and construction Zarncke, 2025, Zarncke, 2025, Zarncke, 2025, Zarncke, 2025, Zarncke, 2025, Zarncke, 2026.

Read in PDF