add-justification-is-fully-propagating
IN derived (depth 1)
Adding a justification triggers complete multi-dimensional propagation: truth values cascade through dependents via BFS, the dependents reverse index is updated on both antecedent and outlist nodes, and access tags flow downstream transitively through all dependent chains.
Summary
When a new justification is added to a node, three things happen simultaneously: truth values ripple out to all downstream dependents, the reverse dependency index gets updated so future retractions know what to revisit, and access control tags flow transitively through the entire dependent chain. This means adding a justification is not a local operation — it has system-wide side effects that keep truth status, dependency tracking, and tag-based access all consistent in a single pass.
Justifications
SL — A single add_justification call triggers three independent propagation dimensions (truth, structure, authorization) ensuring complete downstream consistency
Antecedents (all must be IN):
- add-justification-triggers-propagation — Adding a justification that changes a node's truth value triggers BFS propagation that cascades to all transitive dependents, including restoring OUT nodes whose justifications become valid.
- add-justification-registers-dependents — `add_justification` updates the `dependents` set on both antecedent and outlist nodes so that future retraction/restoration propagation reaches the target node.
- add-justification-propagates-tags-downstream — Calling `add_justification` on an existing node recomputes `access_tags` for the target and all its transitive dependents, enabling retroactive tag propagation.
Dependents
These beliefs depend on this one:
- add-justification-achieves-consistent-propagation — Adding a justification to an existing node produces a fully consistent network state through guaranteed-terminating multi-dimensional propagation: truth values cascade via BFS through dependents, the reverse index is updated, and access tags recompute transitively — all within a single operation whose termination is guaranteed by BFS traversal and stop-on-unchanged semantics.