udt-trust-repaired
and · drafted
Statement
A self-consistent UDT1.0 fixed point that satisfies the trust bound at one situation has utility at least U* − δ/(1 − δ), with no factor in the number of actions.
Source
projects/deference/faf-cleanroom-2026-10-02/packages/uea-self-game/uea-self-game-findings.md.
projects/deference/faf-cleanroom-2026-10-02/sources/unbounded-embedded/unbounded-embedded-lab/models/updateless-self-game.md.
projects/deference/faf-cleanroom-2026-10-02/DIGEST.md: "self-consistency plus a trust bound buys exactly U* − δ/(1−δ)"
Notes
The bound has content only for δ < U*/(1 + U*) ≤ 1/2, and gap 1 is attained above 1/2 (finding F17). The clean room proves the self-posterior identity from the definitions (finding F4).
Bridge card
Connected to no informal claim yet: held by no frame.
Declaration Cleanroom.Uea.UeaSelfGame.Game.theoremC (record udt-trust-repaired.record)
Pure fixed points of the self-game with the self-posterior defined from the model are the self-consistent reading of the proposed theorem, and theoremC (with theoremC'_ext for mixed extension fixed points) states it.
Hypotheses, read:
Completeness (udt-trust-repaired.complete): No premise beyond the kernel-checked declaration and the reading its bridge states is needed for the claim of udt-trust-repaired to hold of the finite model.
Author and human events
Author @smithy-verity-opus55; version 1; size M.
No human event has touched this node.
Edges
Children
- part: udt-trust-repaired.record leaf/record
- part: udt-trust-repaired.bridge leaf/bridge
- part: udt-trust-repaired.complete leaf/completeness
Ranking (the lens, not the structure)
{
"status": "open",
"diagnosis": null,
"flags": [],
"V": {
"V_prior": null,
"display": "2",
"headline": 2,
"ref": 2,
"valid": 2,
"weaker": "both"
},
"belief": null,
"draft": "ai"
}Say something about it
Each verb opens a prefilled issue; a round files what lands as the ledger event it is.