Appendix H — Glossary

Terms are labeled by kind. CANON = fixed Odisena vocabulary; FACT = external mathematical/technical term; METHOD = practice.

• Append-only log (FACT/METHOD). A record to which events are only ever added, never edited or deleted; corrections are new events. The basis of tracking and event sourcing.
• Assumption (CANON). The fourth RFPA move: declaring and registering the base cases, defaults, precision choices, and model selections a system inherits.
• Attempt (CANON). The first AVPT beat: generating a candidate next state, with declared inputs, operation, output, and cost — explicitly a candidate, not an accepted fact.
• AVPT (CANON). Attempt, Validate, Preserve, Track — the four execution beats cycled through as a system grows.
• Base case (FACT). A declared starting value a recurrence cannot itself produce (e.g. $F_0=0,F_1=1$).
• Binet's formula (FACT). The closed form $F_n=({\phi }^n-{\psi }^n)/\sqrt{5}$.
• Bounded authorization (CANON). The requirement that promotion at the gate be permitted only within a defined scope and by a defined authority.
• Candidate state (METHOD). A produced next state that has not yet been promoted; the output of an Attempt.
• Cassini's identity (FACT). $F_{n-1}{F}_{n+1}-F_n^2=(-1{)}^n$; an independent invariant used to validate terms.
• Collective Neural Network (CANON). Odisena's full socio-technical system — public surfaces, canon/knowledge stores, AI services, data, automation, observability, governance, archives, connectors, and evidence loops. Not a single machine-learning model.
• Convergence (FACT). Approaching a limit without necessarily reaching it (e.g. $F_{n+1}/F_n\to \phi$).
• Determinism (FACT). The property that the same inputs and rules always produce the same output; what makes regeneration and verification possible.
• Evidence store (CANON/METHOD). The append-only chain of preserved state packets that feeds next-turn recovery.
• Field (CANON). The second RFPA move: declaring domain, scope, conventions, audience, and exclusions.
• Founding Loop (CANON, doctrine). Odisena's symbolic doctrine for turning one validated seed into reusable systems; expressed by a glyph string, always explained in plain language, never cited as fact.
• Golden ratio (FACT). $\phi =(1+\sqrt{5})/2\approx 1.618$; the limit of consecutive Fibonacci ratios.
• Governed recursion (CANON). Continuation constrained by canon review, evidence preservation, explicit supersession, and bounded authorization.
• Infinity Engine (CANON). Repeated, governed, evidence-preserving cycles — never uncontrolled or literally infinite execution.
• Invariant (FACT). A relationship that holds for every valid state and can be used as a cheap validator.
• Memoization (FACT). Caching computed results so each subproblem is solved once; preservation applied to computation.
• Preserve (CANON). The third AVPT beat: keeping a validated state with its derivation, validation, and predecessors, append-only.
• Principal (CANON). The third RFPA move: the governing rule/generator every future state must obey. (Note spelling: not "principle.")
• Promotion gate (CANON). The single controlled point where a validated candidate is promoted, held, rolled back, or superseded.
• Recover (CANON). The first RFPA move: reconstructing and verifying the prior state before acting; fails closed.
• Recurrence (FACT). An equation defining each term of a sequence from earlier terms.
• Regenerate, do not patch (CANON). Rebuild derived artifacts from canonical inputs; never edit outputs in place; preserve predecessors.
• RFPA (CANON). Recover, Field, Principal, Assumption — the four framing moves set before growth.
• Supersession (CANON). Replacing a flawed canonical state with an explicit new version while preserving and marking the predecessor.
• Track (CANON). The fourth AVPT beat: maintaining an append-only ledger of index, timestamp, version, and status.
• Validate (CANON). The second AVPT beat: testing a candidate against the principal's invariants and independent checks before promotion.