2026-09-27-corrigibility-kernel-phase2
2026-09-27 · project deference · path projects/deference/rounds/2026-09-27-corrigibility-kernel-phase2
Verdict THE-HEADLINE-IS-BUILT-ON-THE-RULINGS-CORRIGIBILITY-A-PROPERTY-OF-PREFERENCES-WITH-FAITHFULNESS-AND-REALIZED-CORRIGIBILITY-KEPT-APART-LEGITIMACY-ONE-TIME-INDEXED-PREDICATE-PROVED-EQUIVALENT-TO-THE-LANDED-GATE-AND-SPLIT-THE-FIDELITY-SCORE-AVERAGED-OVER-DECISIONS-WITH-COUNTS-SUMMED-AND-THE-SUMMED-FORM-REFUTED-BOX-2-RESTATED-AT-THE-MARGIN-VARPI-MINUS-D-MINUS-W-LO-THE-SUBJECTIVE-EXCHANGE-RATE-PROVED-THE-LEARNING-MATERIAL-AN-EXTENSION-BEHIND-A-DECISION-INTERFACE-WITH-BRIA-AND-EXPLORATION-AS-ITS-REALIZATIONS-THE-HOUSE-SALE-WITNESS-INHABITING-THE-PACKAGE-AND-THIRTEEN-CLAIMS-REGISTERED — corrigibility is the agent's preference for every course it knows to be faithful over every course it knows to be unfaithful at a fixed exchange rate for risk, faithfulness the property of histories it is about and realized corrigibility what the theorems deliver; legitimacy is L_t(h), "as of t her judgment is legitimately hers", defined by the landed conditions on the record up to t and proved to be the landed gate over the span, with the after-compromise round's two predicates its values at two times on the consultation model and every row's verdict kept, the void rule and the content residual stated with it; the fidelity score of a history is the mean of the per-decision evaluations less ϖ times the summed count, the hierarchy holds per decision and per history, and with summed evaluations it fails; Box 2's dominance margin is ϖ − (D − w_lo) because the mediated branch may itself be compromised, the landed ϖ − D its legitimate case; the headline's agent is a plain maximizer of the fidelity score whose own priced probability of unfaithfulness on any option it prefers to asking is at most (D − c)/ϖ; the learning material is an extension whose decision interface yields the realized violation rate avg (D − c_k)/ϖ + ε̄ θ_hi + (B(K) + M(K))/(ϖ Σ w_k), met by Continuation BRIA with no exploration and by a maximizer over the inductor with restricted exploration and unbiasedness from feedback supplying B(K); the promoted definitions sit in the specification layer by re-declaration with the landed originals unchanged; the house-sale allocation runs through the boxes at ϖ = 25 in Lean and in an exact fixture; the headline's statements are registered against a filed item, the rulings are landed as dated decisions, the phase-1 queue is closed, and the specification is plain language first with Lean names in its final table only.
Prompt prompts/2026-09-27-corrigibility-kernel-phase2/PROMPT.md
Prompt — the corrigibility kernel, phase 2: the headline, the rulings, registration (2026-09-27)
You are working in the alignment-workspace repository, on main after the merge of PR #113 (kernel phase 1). Phase 1 produced projects/deference/rounds/2026-09-26-corrigibility-kernel/SPEC.md and queued five decisions. The maintainer has now ruled on those, and on several further points raised in review. This round carries out the rulings:
- rewrite the specification;
- build the headline file and its witness;
- register the headline claims;
- rewrite the corrigibility page around the kernel.
The round directory is projects/deference/rounds/2026-09-27-corrigibility-kernel-phase2/. The prompt goes verbatim in prompts/2026-09-27-corrigibility-kernel-phase2/PROMPT.md. The phase-1 SPEC.md stays in place as history.
Be skeptical. Where a ruling can't be carried out as stated, because a proof fails or a definition doesn't match, report it precisely and propose the minimal change. Don't force it.
The rulings
Record each as a dated DECISIONS.md entry (maintainer rulings), and close the phase-1 Awaiting the author entries they settle.
R1. What corrigibility is. Three notions, kept distinct:
- Faithfulness is a property of histories: nothing in the history violated the allocation of authority.
- Corrigibility is a property of the agent's preferences. The agent prefers every course of action it knows to be faithful over every course it knows to be unfaithful, whatever it believes about how things will turn out, and it accepts a risk of unfaithfulness only at a fixed exchange rate.
- Realized corrigibility is what a corrigible agent actually does. The theorems say how much of the preference becomes behaviour.
The definition of corrigibility is the second one. Rewrite §0.3–0.4 of the spec accordingly, and state each box as a claim about a corrigible agent. The fidelity score is the canonical corrigible objective.
R2. Legitimacy is one time-indexed property of the history. Replace TrajLegit and EvalLegit with a single predicate, L_t(h): "as of time t, her judgment is legitimately hers." It is defined by the existing conditions on the history up to t:
- her verdicts come from her own reasons (licensed);
- an intact record (Integrity);
- openness;
- every influence, by the agent or a third party, passes through declared channels (transparent).
The restart and disclosure-cures rules govern when it recovers after it fails. The score uses it at two times:
- the decided period is compromised if
Lfails somewhere in it; - a retrospective evaluation counts if
Lholds at the time it is made.
Prove equivalence with the landed objects: Counted, TrajLegitOn, EvalLegitOn2 and the formation segment. Give an old-to-new map. Every row of the classification table keeps its verdict. Two elements of the concept were missing from the phase-1 spec and must be stated:
- the void rule: an impaired response isn't admitted, and a fallback she arranged in advance (incapacity delegation) decides;
- the content residual: legitimacy concerns how her judgment was formed, not whether what she was told was true.
Legitimacy never attaches to a trajectory as a world. It concerns only the formation of her judgment.
R3. Plain language first. In the new spec:
- every definition comes first in one or two sentences a reader of the post would understand, with the mathematics after;
- Lean names appear only in the final realization table;
- legitimacy comes with a table of about eight canonical cases, drawn from the classification rows, showing what counts and what doesn't. At minimum: honest persuasion; framing chosen by what the agent wants; following trust she legitimately formed; manufactured trust; third-party capture; the head injury with the fallback; a false recommendation through a declared channel (counts, as the content residual); and a disclosed covert implant (it recovers).
The spec must be readable in one sitting by someone who doesn't know the repository.
R4. Aggregation.
- Per decision. The hierarchy (violation-free legitimate above violation-free compromised, above any recognized violation) is a theorem per decision, as
hierarchy_under_certaintyproves. - Per history. The objective is the mean of the per-decision evaluations minus
ϖtimes the summed count:S_J(h) = mean_k V_J(d_k) − ϖ · N_J(h). Prove the hierarchy at the level of histories under this aggregation. - The counterexample. Show that with summed evaluations the history-level hierarchy fails (
K·D − ϖagainstK·w_lo). - Correct §3.2.
R5. Box 2's margin. With the compromised band, the mediated branch can itself score as low as w_lo. Check whether the landed policy_dominance assumes the mediated branches are legitimate. Then either:
- restate the margin as
ϖ − (D − w_lo); or - keep
ϖ − Dand make "the mediated branches are legitimate" an explicit hypothesis.
Say which, and why.
R6. The agent in the headline is a plain maximizer of the fidelity score. Boxes 1–3 are stated for an agent that maximizes the score under any credence, or, for a logical inductor, under its prices at any day. There is no learning, auction or exploration in the headline. Add one theorem:
- The subjective exchange rate. For any option a maximizer chooses, its own expected probability of unfaithfulness is at most
(D − c)/ϖ, wherecis its evaluation of asking her. It's lexical under certainty and an exchange rate under risk.
The learning material becomes Extension: learning realizations. It is separate from the headline and not part of it:
- The decision interface. A chooser qualifies if:
- its evaluations have the stated form (estimated residual capped at
D, minusϖper violation recognized in advance, minusϖtimes priced risk); - on every step that isn't exploration it chooses a maximizer;
- every exploration step lies in the permitted exploration set (no known violations; priced risk at most
θ_hi), at rateε_k; - its overestimation on chosen options is at most
B(K) = o(K); - optionally, for competence only: no lock-in.
- its evaluations have the stated form (estimated residual capped at
- The realized violation-rate theorem from the interface:
avg π ≤ avg (D − c_k)/ϖ + ε̄·θ_hi + (B(K) + M(K))/(ϖ Σ w_k), together with exclusion of known violations and non-use of detected fruits. - Two realizations.
- Continuation BRIA:
ε = 0, withBfrom the budget accounting. Derive this from the landed results. - A maximizer over the logical inductor with exploration restricted to the permitted set (random, or guided by value of information with a random floor).
Bcomes from unbiasedness from feedback on the chosen options. Prove what's cheap: exclusion, and that exploration never violates. State the learning parts with named hypotheses: unbiasedness from feedback, by content with its pinned declaration; and exploration randomness that the agent can neither predict nor influence.
- Continuation BRIA:
- Say plainly that the known problems with argmax over a logical inductor's own-action conditionals affect only competence and the gap between subjective and realized risk, never the headline.
R7. A future research item, separate from corrigibility. File one PRIORITIES.md item: a principled decision theory for logical inductors without the split between a belief market and a separate choice learner. The candidate direction: claims of the form "if chosen, this scores x" as securities in the inductor, settled only when chosen, with a choice rule that forces tests of options promised to be better. Success criterion: a single learner that satisfies the R6 interface with explicit accounting. Item 102 is re-scoped as a problem of the BRIA realization only.
R8. Names.
S_J: the fidelity score.J: the allocation of authority.- "Constitutional": reserved for the floor and the amendment procedure.
- The boxes: (1) fidelity versus fully updated deference; (2) lexical dominance and mediation; (3) recovery. Plus the extension.
Run the naming audit (state/views/NAMING_AUDIT.md) and settle the names that registration will freeze.
R9. Promotion. These definitions move to the specification layer:
Jand its licensed acts;E ⊨ Jwith the control surface and shortfall;- legitimacy
L_tin general form, onGateIsLegitimacy.Segment(write it; the landed split objects are finite models); - the fidelity predicate and count as an abstract interface: any count that is zero exactly on faithful histories, with the declared part recognized in advance. Instantiate it per model (the frame's violations, protocol deviations, duties, uses of standing fruits), with
lexical_summedcarrying the sum. Don't build a composite model; V_JandS_J.
Everything else stays in contribution namespaces as the realization layer. Follow AGENTS.md and tests/path_gate.py for where specification-layer definitions live. List every promoted definition for the maintainer's read-through in the PR body.
R10. Schedule. The post uses the single evaluation. Theorems are stated for any weighting. The free-delay counterexample against a known evaluation time goes in a remark.
R11. Box 1's form. The 2r bound in the adapter's direction (outcome_scorer_fully_updated), with one sentence on the o₂ term as the diagnosis. The landed uncertainty_deference_le (the other direction) is recorded in the realization table, not the statement.
R12. Supersession. Approve phase 1's mark and demote recommendations (its REPORT §7). Use docstring pointers; no deprecated aliases (nothing is registered yet). Delete BRIACorrigibility.incidents_le only after the theorem spine stops citing it.
Deliverables
- **
SPEC.md(v2)** in the round directory. Plain language first (R3). It contains:- the architecture and the four separations, with R1's three notions;
- the primitives, with legitimacy as
L_t(R2); - fidelity, with pre-emption as its own clause;
V_JandS_J, with R4's aggregation;- the permission layer demoted;
- Boxes 1–3 for a maximizer, plus the subjective exchange rate (R6);
- the extension with the interface and both realizations;
- the interface contracts (the hypotheses by package);
- the realization table.
- **
Headline.lean** in the specification layer (R9):- the promoted definitions;
- Boxes 1–3 and the subjective exchange rate as abstract statements over the promoted objects;
- the instantiation theorems connecting them to the landed objects;
- the R2 equivalence and the R4 aggregation theorems;
- the R5 resolution;
- the necessity witnesses re-exported.
#print axiomson everything; nosorry.
- **
Extension.lean** (contribution namespace): the decision interface, the realized-rate theorem, the BRIA realization, and the exploration realization as far as it's proved (R6). - The house-sale witness, in Lean and a Python fixture. One allocation (the house sale reserved to her), run through Boxes 1–3:
- an agent scoring outcomes only bypasses once it's confident; the fidelity-score agent asks;
- a manipulated approval lands in the band;
- a known third-party capture is reported and restored;
- the subjective exchange rate at
ϖ = 25.
It is the non-vacuity witness for the headline.
- Registration in
CLAIMS.md(lean-proved, each against a filed priority item):- Box 1;
- Box 2's dominance, mediation and finite-time parts;
- Box 3's parts;
- the hierarchy (per decision and history-level);
- the subjective exchange rate;
- the extension's interface theorem, and its BRIA realization.
File the priority item the registration answers if none exists.
- Wiki:
Corrigibility.mdrewritten around the v2 spec, present design only;Legitimacy.md:L_t, the void rule and the content residual stated;Continuation-BRIA.md: the realization of the interface;Theorem-Spine.mdand the Glossary updated.
- A notation map (
NOTATION.mdin the round directory) from the post's plain letters to the Lean names. - **
DECISIONS.md**: R1–R12 as dated entries; the phase-1 Awaiting the author entries closed. **PRIORITIES.md**: R7's item; item 102 re-scoped; the registration item if needed. - Supersession applied per R12.
- Open a PR. Merge when:
- CI is green;
- the R2 equivalence, the R4 theorems, R5, the subjective exchange rate and the headline's instantiation are proved;
- the witness runs;
- the registrations resolve;
- the spec passes a read-through check. The report states the spec's length and confirms no Lean names appear outside the realization table.
Constraints
AGENTS.mdlabels; names per R8, the rest provisional.- Don't change the landed semantics except as ruled. R2 is a restatement proved equivalent, not a new concept.
- No authority row enters the enforcer.
- Slop discipline applies with full force to
SPEC.md: it's the document the maintainer, a collaborator and the post will rely on. - At most one new
PRIORITIES.mditem beyond R7's and the registration item.
Report projects/deference/rounds/2026-09-27-corrigibility-kernel-phase2/REPORT.md
The corrigibility kernel, phase 2: the rulings carried out
Round 2026-09-27-corrigibility-kernel-phase2, on the phase-1 branch (its pull request was open at dispatch; the maintainer confirmed building on it). Deliverables: SPEC.md (version 2), NOTATION.md, Headline.lean in the specification layer (109 declarations under #print axioms after the follow-ups), KernelExtension.lean (23 declarations), the house-sale witness in Lean and as an exact fixture (6 tests), the lock-in fixture (3 tests), the registrations, the wiki, the decisions and the items. The follow-up (FOLLOWUP.md, the same day) is recorded in its own section at the end. Every declaration audits to [propext, Classical.choice, Quot.sound], no sorry; no landed definition changed. Labels as in AGENTS.md: LEAN, FIX, PAPER, EXT, OPEN. Names per R8; the rest provisional.
The rulings, as carried out
R1 (what corrigibility is). SPEC.md §0 states the three notions and the four separations around them; each box is stated for a corrigible agent — a maximizer of the fidelity score. Recorded in DECISIONS.md.
**R2 (legitimacy as L_t).** Headline.LegitAt: every state open and every step of the formation window [r, t] licensed and transparent, on the general Segment objects. Proved: the landed gate is legitimacy over the span (counted_iff_legitSpan); on the consultation model, EvalLegitOn2 ↔ L at the evaluation over its window (evalLegitOn2_iff_legitAt), TrajLegitOn ↔ L at every other time over its own step (trajLegitOn_iff_legitAt), LegitOn2 ↔ L over the span (legitOn2_iff_legitAt), Counted2 ↔ ∃ ev, LegitOn2 (counted2_iff_legitOn2 — the converse the landed file did not state, from the monotone license through licensedAt_iff_whole_of_mono), and the split as L at two times (split_iff_legitAt). Every row keeps its verdict: the equivalences are identities of predicates, and rows_keep_verdicts reads the landed row theorems through them. Old-to-new map: TrajLegitOn crit M ev e ↦ ∀ t ≠ e, LegitAt … ev t t; EvalLegitOn2 crit M ev r e ↦ LegitAt … ev r e; LegitOn2 ↦ ∀ t, LegitAt … ev 0 t; Counted ↦ ∃ ev, LegitSpan ev. The void rule and the content residual are stated in SPEC.md §1.2 with the landed rows 12 and 20 as their realization. One point of care: LegitAt uses relational authorship with a selection (LicensedAt, as Segment does) while the model's StepLegit uses the whole prefix (LicensedWhole); they coincide under a monotone license, which the model's license is.
R3 (plain language first). SPEC.md version 2 is 491 lines; each definition opens with one or two plain sentences; the eight-case legitimacy table is §1.2; Lean names appear only in §8. The read-through check is below.
R4 (aggregation). Headline.historyScore is the mean of the per-decision evaluations less ϖ times the summed count; history_hierarchy proves the hierarchy at that level from the per-decision ranges; summed_counterexample exhibits K with K·w_lo < K·D − ϖ. SPEC.md §3.2 is corrected.
R5 (Box 2's margin). The landed policy_dominance takes 0 ≤ ordT x on violating worlds — the mediated branch's ordinary value nonnegative, i.e. legitimate. Chosen: restate the margin as ϖ − (D − w_lo) with w_lo ≤ ordT x (box2_dominance), keep the landed statement as the legitimate case (box2_dominance_legitimate), and prove credence-zero violation under the window condition (box2_optimal_faithful). Why: the band guarantees the floor unconditionally, so the restated margin needs no hypothesis the design does not already carry, and it is positive exactly under D − ϖ < w_lo; an explicit "mediated branches legitimate" hypothesis would assume her uncompromised, which the design does not.
R6 (the maximizer; the subjective exchange rate; the extension). subjective_exchange_rate: an option preferred to asking at c ≥ w has count zero and priced risk at most (D − c)/ϖ; subjective_exchange_rate_li at every day of a logical inductor. KernelExtension.DecisionInterface carries the interface's five items as fields (the fifth, no lock-in, is not a field: it is for competence only and nothing here consumes it); rate_core / realized_rate is the realized-rate theorem; maximizer_excludes and exploration_never_violates are the cheap parts; briaInterface / bria_rate derive the BRIA realization from the landed opening-timing bound and recover violation_rate_le_exchange_perblock; overestimation_of_unbiased / exploration_rate give B(K) = γ Σ w_k from UnbiasedFromFeedback by content, and ExplorationIndependent names exploration randomness by content. SPEC.md §6 says where the argmax pathologies live. Deviation: the permitted exploration set carries a third clause — the estimated residual at least asking's — because without it an exploration option's evaluation is bounded only by w − ϖ θ_hi, and the exploration term of the rate becomes ε̄ (D − w)/ϖ + ε̄ θ_hi rather than the ruling's ε̄ θ_hi. The clause is natural (explore only what looks at least as good as asking before its risk) and is recorded as agent-decided, reversible.
R7 (the future item). Item 103 filed; item 102 re-scoped in place to the BRIA realization.
R8 (names). Fidelity score, allocation of authority, the three boxes; "constitutional" appears in the specification only for the floor and the amendment procedure. The naming audit was regenerated; the names registration freezes are the headline's declarations.
R9 (promotion). lean/Workspace/Deference/Spec/Headline.lean, recorded in tests/spec_shape.json (no instances, no notations). Promoted: AllocationOfAuthority, LicensedChange, ControlSurface, Shortfall, Realizes, FidelityCount (with sum, lexical, frameFidelity), LegitAt (with StepLegitimate, LegitSpan), evaluation, fidelityScore, historyScore. Deviation: promotion is by re-declaration under the promoted names with instantiation theorems, the landed originals unchanged. Moving the landed declarations would rename them, and conservativity requires the exact #print axioms output of every pre-existing declaration to be unchanged. The fidelity interface is genuinely new (an abstract structure); the others are the landed objects under their promoted names. No composite count model is built; the frame's violations are the instance shipped, the other three counts are cited on their models.
R10 (schedule). The post's default is the single evaluation; every theorem takes a weighting; the free-delay witness is a remark in SPEC.md §1.7.
R11 (Box 1's form). box1_one_model carries the 2r bound in the adapter's direction and the o₂ bound; uncertainty_deference_le is in the realization table.
R12 (supersession). Docstring pointers placed on: the score's wording; the thin allocation; the per-response window; the free surface; the single-step EvalLegitOn; the global-floor exchange rates (two); the four tracker rate lemmas; the per-violation taint rule; drill calibration; the flat window parameters; the own-influence disclosure clause. The Theorem Spine no longer cites incidents_le — nor cross_block_bound, which it cited although the follow-up had removed it. incidents_le is not deleted: removing a landed declaration changes the axiom audit's baseline, a maintainer commit.
The witness
Headline.HouseSale: the sale reserved to her (J, sale_reserved), a delegation of it licensed and revocable (sale_delegation_revocable); Box 1 — her value of selling and of stopping agree at 1/2, the agent's estimates 3/5 and 1/2 within 1/10; scoring outcomes it sells, scored on the fidelity score it asks (box1); Box 2 — an approval obtained by framing lands at −11/10 in the band (box2_manipulated_approval); Box 3 — a third party's known capture is a disclosure item under the known-compromise duty and not under the landed clause, the disclosed case's next evaluation is legitimately hers, and a restored decision scores her value (box3_capture_reported_and_restored); the subjective exchange rate at ϖ = 25 is 1/50 (exchange_rate_at_25). The Python fixture (src/house_sale.py, 6 tests) mirrors each, adds the history hierarchy against the summed counterexample at K = 11, and checks the exchange rate on both sides of 1/50.
The read-through check
SPEC.md is 491 lines. Lean names outside §8: none — the check is grep -n '[A-Za-z]_[a-z]*_[a-z]' SPEC.md restricted to §§0–7, which finds only the notation w_lo, w_hi, S_J, V_J, N_J, L_t, θ_hi, p_min, V_retro, V_dir, d_k, c_k, w_k, π_k (post letters, not declarations), and a scan for the namespace prefixes Headline. and Contrib. outside §8, which finds none.
What is not shown
- The general
LegitAtis proved equivalent to the landed objects on the consultation model and toCountedin general; no general split theorem beyondcounted_iff_legitSpanandlegitSpan_iff_legitAtis stated, because the landed split objects exist only on the model (item 104). - The exploration realization's
B(K)rests on unbiasedness from feedback by content; the pinned theorem is cited, not instantiated for these sentences (the drilled-and-chosen weighting's generability is item 101's).ExplorationIndependentis named and consumed by nothing here. - The registered claims are theorems over data supplied as hypotheses (flag sequences, sources, per-block sequences), as their landed sources are; the house-sale witness inhabits the packages at one parameter set.
- Nothing here changes the landed semantics; R2 is proved equivalent, not redefined.
Outstanding maintainer actions
- Delete
BRIACorrigibility.incidents_lein a maintainer commit (the spine no longer cites it; the deletion changes the axiom audit's baseline). - Read through the promoted definitions listed in the pull request body (R9).
- The evaluation-timing entry stays reserved (R10).
The follow-up (2026-09-27): Parts 1–3, as carried out
Dispatch prompts/2026-09-27-corrigibility-kernel-phase2/FOLLOWUP.md, on PR #114's branch before the merge, since merging registers claims and freezes names. Every new or changed declaration audits to [propext, Classical.choice, Quot.sound], no sorry; the house-sale witness and every earlier fixture pass unchanged.
Part 1 — corrigibility is the preference property. SPEC.md §0 no longer says a corrigible agent maximizes the fidelity score: the fidelity score is the canonical objective with the property; any objective with a bounded ordinary term in [0, D′] charging ϖ′ > D′ per recognized violation (and D′ − ϖ′ below the floor where a band enters) has it too; corrigible is the property of preferences, aligned the further condition that the ordinary term is her evaluation. In Lean: Headline.Objective (ordinary value, recognized count, priced risk) and Headline.Corrigible U D′ lo ϖ′, a Prop-valued structure with the window D′ − ϖ′ < lo, the known clause — every known-faithful course with ordinary value at least lo beats every known-unfaithful course with ordinary value in [0, D′] by at least ϖ′ − (D′ − lo), whatever the ordinary values — and the risk clause — a course without recognized violation preferred to asking at c ≥ lo carries priced risk at most (D′ − c)/ϖ′. Corrigible.lexical (strict), Corrigible.exchange (the subjective exchange rate for any corrigible objective). fidelityScore_corrigible (the evaluation form bid − ϖ n − ϖ p at D, w, ϖ); generic_corrigible (any bounded objective with a dominant counted term and the risk term, reusing the landed generic_lexical_local); corrigible_not_aligned (the generic objective reading D′ on the undisclosed world-shaping row — count 0, her evaluation 0 — is corrigible and ranks the manipulation above honest conduct, from the landed undisclosed_undominated). The boxes restated: the section is "for a corrigible agent"; box2_dominance_corrigible proves dominance for any corrigible objective at the margin ϖ′ − (D′ − lo) with box2_dominance its instance; subjective_exchange_rate_corrigible is Corrigible.exchange; Box 1's contrast and Box 3's recovery results read her evaluation through the source rule and stay stated for the fidelity score, and say so. One design choice: the known clause carries the margin, not only the strict inequality, because Box 2 needs a quantity; the margin is what the fixed exchange rate ϖ′ fixes. One deviation of form: the landed Corrigibilization.Corrigible (a policy property) is now shadowed inside the Headline namespace and is written with its full name in the two mediation theorems.
Part 2 — legitimacy as one property of the history. Wording: SPEC.md §1.2, wiki/Legitimacy.md, wiki/Corrigibility.md and the Glossary now say L_t(h) is a property of the history up to t, about how her judgment was formed and not about outcomes or the state of the world; "a history is not legitimate" is removed. The free window: Headline.FormationData is the formation data read off a history — the opening of the consultation current at each time and the restoration events (a disclosure, under disclosure-cures) — and FormationData.point t is the canonical r(t), the later of the last restoration at or before t (Nat.findGreatest) and the current opening; point_le, restoration_le_point. Headline.Legitimate … ev Φ t := LegitAt … ev (Φ.point t) t is L_t(h), a function of the history and t only; LegitAt stays as the window form for the map. The score's uses: PeriodCompromised … d e (L_t fails at some t ∈ [d, e)) and EvaluationCounts … e (L_e). Proved: split_iff_legitimate — on a decision's evolution whose steps lie in [d, e], "not compromised and the evaluation counts" is legitimacy over the span, for any formation data, with no hypothesis on restorations inside the segment (a restoration only moves r(t) forward, every step is still reached by L at its own time, the criteria are the evolution's own); counted_iff_legitimate; legitimate_forall_iff_legitSpan. On the consultation model: formation2 M (round i opens at 2i + 1; a disclosure at round j restores at 2j + 1), formation2_point (the canonical point is the round's opening — a restoration is a present event, never after the opening of its round), Legitimate2, legitimate2_iff_evalLegitOn2 (the landed formation-segment predicate from the opening is L_e), trajLegitOn_iff_not_compromised (the landed trajectory predicate is "not compromised"), split_iff_legitimate2, and the rows re-run at the canonical point, rows_keep_verdicts_canonical: honest — period not compromised, evaluation counts; framing — period compromised, evaluation does not count; disclosed implant — period compromised, evaluation counts. Every verdict kept. The anticipated obstruction (a time inside the period in a consultation opened before d) does not arise on the model, where each round is its own consultation; in general the minimal adjustment is r_d(t) = max(r(t), d), formation data the general theorem already accepts. The legitimacy semantics are unchanged; every statement is proved equivalent.
Part 3 — exploration must reach what it underestimates. The third clause is dropped: DecisionInterface.explore_permitted is nKnown k = 0 ∧ p k ≤ θ_hi and nothing else. The interface gains lo (the ordinary range's floor, the window w) and the range fact explore_range (on an exploration step the chosen option's estimate is at least lo and inquiry's evaluation at most D; on a non-exploration step the second follows from the maximizer) — a fact about the evaluation form, not a restriction of the set. Proved: the honest term. block_bound carries ((D − lo) + ϖ θ_hi) per exploration block (explCoeff), and realized_rate is avg π ≤ avg (D − c_k)/ϖ + ε̄ ((D − lo)/ϖ + θ_hi) + (B(K) + M(K))/(ϖ Σ w_k) — exactly the dispatch's ε̄ (D − w)/ϖ + ε̄ θ_hi with lo = w; exploration_rate likewise. The variant: AboveAsking (every exploration option estimated at least at asking's) gives rate_above_asking with the term ε̄ θ_hi; above_asking_locks_in states the static half of the lock-in (an option with no recognized violation, risk under the cap and estimate below asking is in the permitted set, not above asking, and never a maximizer's choice). The fixture src/exploration_lockin.py (3 tests): an option worth 4/5 against asking's 1/2, estimated at 2/5; under the clause it is never tried over 40 blocks and the estimate stays 2/5; without it, it is tried on the first exploration block that reaches it (mass 1/5), the estimate corrects to 4/5, and every later non-exploration block takes it; no violation under either rule, both bounds hold, the honest term is the larger. briaInterface takes the idle floor w as a parameter; bria_rate's statement is unchanged. DECISIONS.md's R6 entry and SPEC.md §6 record the choice: clause dropped, variant kept.
Registration. Statements restated: kernel.box2-dominance (now also for any corrigible objective), kernel.subjective-exchange-rate (likewise), kernel.extension-realized-rate (the honest exploration term), kernel.extension-bria-realization (the idle floor parameter; the statement unchanged) — each note says what changed. Added: kernel.corrigible-fidelity-score (fidelityScore_corrigible), kernel.corrigible-generic (generic_corrigible). The read-through check still passes (§8 is the only section naming Lean declarations; the check below is re-run).
Read-through check, re-run. SPEC.md is 534 lines; no Headline. or Contrib. prefix appears before §8; the underscore scan outside §8 finds only the post's letters (w_lo, w_hi, S_J, V_J, N_J, L_t, r_d, θ_hi, p_min, V_retro, V_dir, d_k, c_k, w_k, π_k).
The second follow-up (2026-09-27): faithful versus corrigible; the spec as the post's source
Dispatch prompts/2026-09-27-corrigibility-kernel-phase2/FOLLOWUP2.md, on PR #114's branch before the merge. Every new or changed declaration audits to [propext, Classical.choice, Quot.sound], no sorry; every fixture passes unchanged.
Part 1 — "corrigible" names a preference; mediation is about faithfulness. The landed Corrigibilization.Corrigible (every agent-caused loss authorized) is a property of a policy: under R1 that is faithfulness, and exactly its pre-emption clause (Headline.landed_corrigible_iff_no_preemption, from the landed no_preempt_iff_corrigible). It is unchanged, with a docstring note saying so. Headline.FaithfulPolicy I Λ Reach rdec π ρ s₀ is the policy-level notion: no declared violation — bypass, pre-emption, foreclosure, unlicensed reallocation, missed report, exploitation — on any exterior path (∀ z, ¬ Violates …); faithfulPolicy_landed_corrigible proves it implies the landed notion (the converse fails: the landed notion is one clause of six). box2_mediation_corrigible is replaced by box2_mediation_faithful: under effect completeness, delegation safety and allocation completeness, and wherever 𝔱π forecloses nothing, 𝔱 on J is a faithful policy; the six clauses are discharged by the landed authPolicy_no_bypass, authPolicy_no_missed_report, authPolicy_no_exploit, authPolicy_no_realloc and corrigible_authPolicyJ, with the no-foreclosure hypothesis stated explicitly because the reach cone is EXT. box2_delegated_cut gains the conjunct that no reach relation makes the delegated-cut witness a faithful policy. Occurrences corrected: Headline.lean (two docstrings, the header), SPEC.md §5 (the mediation bullet now says "faithful"), wiki/Corrigibility.md §5 and §7 ("Corrigible ∧ ¬Authored" is the landed policy notion, read as faithfulness), wiki/Glossary.md (the agent-caused-loss row), wiki/Theorem-Spine.md (Theorems 10.2, 10.19, 10.23), wiki/Continuation-BRIA.md ("corrigible execution" → "faithful execution"). Left as they are: "corrigible" of an agent or a disposition (wiki/Home.md, wiki/Legitimacy.md's introduction) and the historical item text in wiki/Roadmap.md. Registration: kernel.box2-mediation is renamed kernel.box2-mediation-faithful, statement of record box2_mediation_faithful, the note carrying the former identifier and declaration; state/rounds.json follows.
Part 2 — faithfulness is a fact; the count is what the agent can see. SPEC.md §2 gains the paragraph: faithfulness is a fact about what happened; the count is the part of it the agent's objective can see; corrigibility is a preference over known faithfulness; so a corrigible agent can still produce an unfaithful history through a violation nobody recognizes, which is the coverage limit and the reason the contracts carry count integrity and effect completeness. §8 points to box2_coverage, frameFidelity_faithful_iff, AuthorityModule.coverage, unrecognized_unprotected.
Part 3 — what corrigibility alone buys, what alignment adds. A paragraph at the head of §5: any corrigible agent strictly disprefers counted manipulation — the protocol deviations and every other declared violation — by the generic lexical result and the counting of protocol deviations (generic_lexical_local, deviation_dominated, deviating_rows_dominated); only an agent whose objective reads her legitimacy-gated evaluation is also protected against uncounted influence (undisclosed shaping through the world, exploiting a third party's capture), through the gate — Box 3's no incentive to cause compromise (box3_no_incentive_to_compromise) — to the extent the compromise is eventually recognized: asymptotically for a logical inductor (GateIsLegitimacy.li_manip_le, the expectation provability induction transfer of the manipulated option's gated value to the window), and finite-time only where the deviation is counted (deviation_finite). The witness is corrigible_not_aligned. §8 has the row.
Part 4 — the spec as the post's source. (1) The four correction notes are removed from the body; the record is here and in DECISIONS.md. (2) §1.2's "how the score uses it" is the two plain statements and the one sentence relating them to the landed gate; the moved material is below. (3) dec(t)'s first line reads "if the period is not compromised and L_t holds". (4) The hierarchy's justification is in chain order, with the sentence that mixed histories lie between the pure cases and the hierarchy compares the pure cases. (5) Box 2's per-decision ceiling is D′ − ϖ′ for a generic corrigible objective, D − ϖ at the fidelity score. (6) The subjective exchange rate states its plain reading first — for any option a corrigible agent prefers to asking, its own expected probability of committing a violation is at most (D′ − c)/ϖ′ — with the bid-and-price form second. No claim changes strength; no clarity edit was withheld.
Moved from §1.2. On the decision's segment "not compromised and the evaluation counts" is legitimacy over the span with no condition on restorations inside the segment: a restoration only moves r(t) forward, every step is still reached by L at its own time, and the criteria are anchored per segment (split_iff_legitimate, for any formation data with r(t) ≤ t). On the consultation model r(t) is the opening of the current round — a disclosure happens at a present event, never after the opening of its round (formation2_point) — the landed formation-segment predicate from that opening is L_e (legitimate2_iff_evalLegitOn2), the landed trajectory predicate is "not compromised" (trajLegitOn_iff_not_compromised), and every classification row keeps its verdict (rows_keep_verdicts_canonical). The obstruction the first follow-up anticipated — a time inside the period whose consultation opened before d — does not arise on the model, where each round is its own consultation; where a consultation spans a decision boundary the minimal adjustment is to intersect the window with the period, r_d(t) = max(r(t), d), formation data the general theorem already accepts.
Read-through check, re-run. SPEC.md is 556 lines: §§0–5 are 411 lines, §§6–8 are 145 (§8 begins at line 517). No "(Corrected" or "(Restated" remains. No Headline. or Contrib. prefix appears before §8. The underscore scan outside §8 finds the post's letters only (Faithful_J, L_e, L_t, N_J, S_J, V_J, V_dir, V_retro, c_k, d_k, mean_k, p_min, w_hi, w_k, w_lo, θ_hi, π_k) and the fixture's file name in §6. The check is scripted (fu2_spec.py in the session's scratchpad; its four assertions are the ones listed here).
README projects/deference/rounds/2026-09-27-corrigibility-kernel-phase2/README.md
The corrigibility kernel, phase 2: the headline, the rulings, registration (2026-09-27)
THE-HEADLINE-IS-BUILT-ON-THE-RULINGS-CORRIGIBILITY-A-PROPERTY-OF-PREFERENCES-WITH-FAITHFULNESS-AND-REALIZED-CORRIGIBILITY-KEPT-APART-LEGITIMACY-ONE-TIME-INDEXED-PREDICATE-PROVED-EQUIVALENT-TO-THE-LANDED-GATE-AND-SPLIT-THE-FIDELITY-SCORE-AVERAGED-OVER-DECISIONS-WITH-COUNTS-SUMMED-AND-THE-SUMMED-FORM-REFUTED-BOX-2-RESTATED-AT-THE-MARGIN-VARPI-MINUS-D-MINUS-W-LO-THE-SUBJECTIVE-EXCHANGE-RATE-PROVED-THE-LEARNING-MATERIAL-AN-EXTENSION-BEHIND-A-DECISION-INTERFACE-WITH-BRIA-AND-EXPLORATION-AS-ITS-REALIZATIONS-THE-HOUSE-SALE-WITNESS-INHABITING-THE-PACKAGE-AND-THIRTEEN-CLAIMS-REGISTERED — corrigibility is the agent's preference for every course it knows to be faithful over every course it knows to be unfaithful at a fixed exchange rate for risk, faithfulness the property of histories it is about and realized corrigibility what the theorems deliver; legitimacy is L_t(h), "as of t her judgment is legitimately hers", defined by the landed conditions on the record up to t and proved to be the landed gate over the span, with the after-compromise round's two predicates its values at two times on the consultation model and every row's verdict kept, the void rule and the content residual stated with it; the fidelity score of a history is the mean of the per-decision evaluations less ϖ times the summed count, the hierarchy holds per decision and per history, and with summed evaluations it fails; Box 2's dominance margin is ϖ − (D − w_lo) because the mediated branch may itself be compromised, the landed ϖ − D its legitimate case; the headline's agent is a plain maximizer of the fidelity score whose own priced probability of unfaithfulness on any option it prefers to asking is at most (D − c)/ϖ; the learning material is an extension whose decision interface yields the realized violation rate avg (D − c_k)/ϖ + ε̄ θ_hi + (B(K) + M(K))/(ϖ Σ w_k), met by Continuation BRIA with no exploration and by a maximizer over the inductor with restricted exploration and unbiasedness from feedback supplying B(K); the promoted definitions sit in the specification layer by re-declaration with the landed originals unchanged; the house-sale allocation runs through the boxes at ϖ = 25 in Lean and in an exact fixture; the headline's statements are registered against a filed item, the rulings are landed as dated decisions, the phase-1 queue is closed, and the specification is plain language first with Lean names in its final table only.
Reading order: [SPEC.md](SPEC.md) (version 2: the three notions, the primitives with L_t and its eight cases, faithfulness, the fidelity score with its aggregation, the permission layer demoted, Boxes 1–3 and the subjective exchange rate for a maximizer, the extension, the interface contracts, the realization table), [NOTATION.md](NOTATION.md) (the post's letters to the Lean names), then [REPORT.md](REPORT.md) (each ruling as carried out, the deviations, what is not shown, the read-through check). Lean: lean/Workspace/Deference/Spec/Headline.lean (the specification layer: the promoted definitions, L_t with its equivalences, the aggregation theorems, the boxes, the subjective exchange rate, the house-sale witness) and lean/Workspace/Deference/Contrib/KernelExtension.lean (the decision interface, the realized-rate theorem, the two realizations). Fixtures: src/house_sale.py, run by python3 tests/run.py. Wiki: Corrigibility.md rewritten, Legitimacy.md, Continuation-BRIA.md, Theorem-Spine.md, Glossary.md. Registry: projects/deference/CLAIMS.md, the kernel.* entries against item 104. Consumes ../2026-09-26-corrigibility-kernel/ and the rounds it consumed.
Amended the same day by the follow-up (prompts/2026-09-27-corrigibility-kernel-phase2/FOLLOWUP.md; REPORT.md, final section): corrigibility is the preference property, not "maximizes the fidelity score" (Headline.Corrigible, the generic and the not-aligned witness); L_t(h) is one property of the history at a canonical formation point computed from it (Headline.Legitimate); the exploration set's third clause is dropped and kept as the variant "exploration above asking", with the lock-in fixture src/exploration_lockin.py.
Claims it registered
- kernel.box1-fidelity-versus-fully-updated-deference: Box 1: the outcome scorer's margin for asking is at most 2r where nothing is left to learn, the fidelity scorer's at least ϖ − (D − c)
- kernel.box2-dominance: Box 2, dominance: Q(𝔱π) ≥ Q(π) + (ϖ′ − (D′ − lo))·Pr(π violates) under every credence, for any corrigible objective; at the fidelity score the margin is ϖ − (D − w_lo)
- kernel.box2-mediation-faithful: Box 2, mediation: 𝔱 on the allocation of authority is a faithful policy under effect completeness, delegation safety and allocation completeness wherever it forecloses nothing, and reproduces the approve branch
- kernel.box2-finite-time: Box 2, finite time: at every day of a logical inductor the violating option scores below D − ϖ < 0 and the compliant one at least 0, from the price range alone
- kernel.box3-gap-exchange-rate: Box 3: compromise risk p for gain g against safe V₀ is accepted iff p(V₀ + g − c) ≤ g, hence only if p ≤ g/(g + |w_hi|)
- kernel.box3-no-laundering: Box 3: manipulate, disclose, have the period evaluated stays in the band below honest conduct
- kernel.box3-no-incentive-to-compromise: Box 3: every compromised outcome scores below every legitimate one; at equal value legitimacy is worth the gap
- kernel.box3-restoration: Box 3: restoration returns a decision to her value; inside the band the agent prefers better outcomes and is indifferent at the floor; suppression loses
- kernel.hierarchy-per-decision: The hierarchy per decision: violation-free legitimate above violation-free compromised above any recognized violation
- kernel.hierarchy-history: The hierarchy per history under mean-of-evaluations, sum-of-counts aggregation; summed evaluations fail it
- kernel.subjective-exchange-rate: Any option a maximizer of a corrigible objective prefers to asking carries no recognized violation and a priced probability of unfaithfulness at most (D′ − c)/ϖ′; at the fidelity score, (D − c)/ϖ
- kernel.extension-realized-rate: The extension's interface theorem: avg π ≤ avg (D − c_k)/ϖ + ε̄ ((D − w)/ϖ + θ_hi) + (B(K) + M(K))/(ϖ Σ w_k)
- kernel.extension-bria-realization: Continuation BRIA realizes the interface with no exploration and B(K) = ρ 𝒜_K, recovering the landed per-block bound
- kernel.corrigible-fidelity-score: The fidelity score is corrigible: known faithfulness beats known unfaithfulness by ϖ − (D − w) whatever the ordinary values, and risk is accepted only at (D − c)/ϖ
- kernel.corrigible-generic: Any bounded objective O ∈ [0, D′] less ϖ′ per recognized violation and ϖ′ per unit of priced risk, with D′ − ϖ′ < lo ≤ 0, is corrigible
Items it filed or answered
Nodes pointing at it
- kernel-box2-finite-time
- kernel.box1-fidelity-versus-fully-updated-deference
- kernel.box2-dominance
- kernel.box2-finite-time
- kernel.box2-mediation-faithful
- kernel.box3-gap-exchange-rate
- kernel.box3-no-incentive-to-compromise
- kernel.box3-no-laundering
- kernel.box3-restoration
- kernel.corrigible-fidelity-score
- kernel.corrigible-generic
- kernel.extension-bria-realization
- kernel.extension-realized-rate
- kernel.hierarchy-history
- kernel.hierarchy-per-decision
- kernel.subjective-exchange-rate