propagate-assumes-dependents-exist

OUT premise

Every ID in `node.dependents` is accessed via `self.nodes[dep_id]` without a membership check; a dangling dependent reference will raise `KeyError` — this is intentional (broken invariant = bug)

Dependents

These beliefs depend on this one:

• all-exceptions-are-safely-handled — The system handles both automated exceptions (contradictions triggering dependency-directed backtracking) and manual challenges (irreversible premise-to-justified transformation via dialectics) safely — exceptional conditions from any origin reach correct truth states through deterministic propagation, and no exception pathway corrupts network consistency.
• belief-revision-is-fully-reliable — The complete belief revision pipeline — outlist-based defeat for proactive retraction plus dependency-directed backtracking for reactive contradiction resolution — produces correct, consistent, auditable results with deterministic propagation settling all consequences.
• challenge-defense-is-crash-safe — The dialectical challenge/defend system reaches correct truth states through recursive outlist injection evaluated by deterministic terminating propagation.
• complete-architecture-achieves-verified-production-correctness — The complete reasoning-and-revision architecture — deterministic in state trajectories, lifecycle-complete in monitoring, and architecturally grounded in invariant preservation — achieves verified production correctness across all operation types when propagation correctly tracks all dependents.
• complete-operational-uniformity-across-all-sources — All mutation sources produce fully correct persisted network state — operationally safe, semantically uniform, and consistent across all graph configurations — only when propagation handles dangling dependents without crashing and the derive pipeline's agent-count bug does not skew budget allocation.
• complete-system-is-self-correcting — The system actively maintains its own consistency along two independent dimensions: the TMS core handles exceptional conditions (contradictions trigger deterministic resolution, propagation respects lifecycle state), while belief currency management detects and surfaces drift in source material — no inconsistency persists undetected or unresolved.
• complete-unified-system-is-production-ready — The fully unified minimal-dialectical-scalable system with end-to-end integrity is production-ready — all mutations produce correct state, all revision is reliable, all extensions compose safely — but only when every known fragility and bug is resolved.
• convergent-equilibria-have-complete-propagation-fidelity — System convergence to evaluation-invariant equilibria achieves complete propagation fidelity — every truth change cascades to every transitively dependent node including outlist dependents — and topology preservation covers all reference types, provided the dependency tracking assumption holds.
• dialectical-transformation-is-fully-reliable — The irreversible premise-to-justified transformation during challenge is both semantics-preserving (the resulting node inherits complete outlist evaluation with conjunction, absence, and persistence semantics) and crash-safe (recursive dialectical chains terminate deterministically), making dialectical operations reliable despite their irreversibility.
• full-system-integrity-is-gap-free — The system achieves gap-free integrity — enforced across all architectural layers, lifecycle states, and mutation paths — only when the dependents reverse index is reliably maintained and propagation handles dangling references gracefully.
• maintenance-loop-is-fully-observable — The minimality-sustained closed maintenance loop has complete observability: every self-correction leaves traceable history (nogoods, retraction records, staleness reports), enabling full audit of how the system maintains itself over time.
• mutation-pipeline-produces-consistent-state — Every mutation produces a fully consistent persisted network: atomic load/save ensures no partial writes, deterministic propagation ensures all truth values are correctly derived, and lifecycle-aware traversal prevents stale recomputations.
• operational-integrity-survives-all-graph-states — End-to-end operational integrity holds across all semantic edge cases — including vacuous premises, asymmetric absence, and empty antecedents — only when the dependents graph is consistent and propagation handles all node references safely.
• origin-agnostic-trustworthiness-is-fully-verifiable — The system's complete revision trustworthiness holds identically across all belief origins and is independently verifiable through full maintenance loop observability — trustworthiness is not merely claimed but provable through origin-agnostic audit trails — provided propagation's dependents invariant holds.
• propagation-is-crash-free — Truth propagation completes without runtime errors across all reachable nodes
• revision-achieves-complete-trustworthiness — The revision system simultaneously achieves three independent trustworthiness properties: verifiable soundness (complete two-dimensional provenance/temporal coverage with reliable propagation), end-to-end reliability (across logical and infrastructure layers), and complete auditability (every correction leaves traceable history).
• revision-coverage-is-verifiably-sound — Revision coverage spans the complete two-dimensional space (provenance axis and temporal axis) with end-to-end reliability across logical and infrastructure layers, forming a verifiably sound revision system — conditional on propagation not assuming the dependents index exists for all referenced nodes.
• revision-coverage-requires-sound-propagation — Revision safety covers the complete two-dimensional space — the provenance axis (internal via comprehensive edge-case handling, external via defensive containment) and the temporal axis (creation-time contradiction resolution, maintenance-time staleness detection) — but this coverage is contingent on propagation correctly discovering all dependent nodes to complete revision cascades.
• self-correction-is-resource-sustainable — The system's self-correction capability — contradiction resolution at derivation time and staleness detection at maintenance time — is resource-sustainable: accurate bidirectional token budgets support continuous belief derivation and maintenance, ensuring the correction loop can operate indefinitely without resource exhaustion.
• self-maintenance-is-fully-auditable — The fully characterized self-maintaining loop provides complete operational auditability: every self-correction, maintenance action, and belief revision leaves traceable history across all belief origins and correction types — conditional on propagation soundness guaranteeing that cascade effects are faithfully recorded.
• system-achieves-full-correctness — The system achieves correctness at every level: deterministic conservative truth maintenance, a single reversible primitive for all non-monotonic features, and data integrity spanning all architectural layers — the system is sound end-to-end.
• system-operations-never-crash — Every system operation is crash-free: atomic mutations prevent partial state corruption, deterministic reversible reasoning prevents oscillation and ambiguity, and uniform evaluation prevents dispatch errors — provided no dangling dependent references exist in the graph.
• system-properties-are-indefinitely-maintained — The system's three ultimate properties — self-sustainability, comprehensive auditability, and complete invariant preservation — extend beyond external beliefs to unlimited temporal scope: resource-sustainable self-correction within a deterministic lifecycle ensures these properties hold not just now but indefinitely, provided propagation correctness is maintained.
• tms-core-is-crash-safe — The TMS core provides crash-free truth maintenance: deterministic termination, pure evaluation, and conservative failure semantics ensure correct results across all reachable nodes.
• tms-handles-all-conditions-safely — The TMS core handles both normal operation (crash-free truth propagation via BFS with stop-on-unchanged) and exceptional conditions (deterministic contradiction resolution via backtracking with least-entrenched selection) through shared propagation infrastructure — no reachable execution state leads to undefined behavior.
• unified-system-is-a-closed-self-maintaining-architecture — The system forms a closed self-maintaining belief architecture: end-to-end integrity ensures no operation corrupts consistency, while revision completeness ensures any valid belief configuration is reachable — together guaranteeing the system can evolve to any target state while preserving all invariants — only when all known defects and fragilities are resolved.
• verified-mutation-correctness-across-boundaries — Every mutation source produces fully correct persisted state that preserves boundary-agnostic integrity — not just safe operation, but verified output correctness across internal/external boundaries and all source types — only when implementation-level defects in propagation and budget allocation are resolved.

Details