Library / First Principles Framework (FPF) - Core Conceptual Specification
Jump to passage
In this reading

Link to current text

Published source confirmed at last check

Source changed 2026-10-03 11:52:20 UTC · snapshot created 2026-10-03 11:53:41 UTC · last check 2026-10-03 12:15:10 UTC

G.4:7 - Conformance Checklist (normative)

ConformanceIdStatement
CC‑G4‑CoreRefConformance with G.4 requires satisfying the effective G.Core obligations referenced by the GCoreLinkageManifest in G.4:4.1 (profiles, pin sets, consumed defaults, and trigger kinds).
CC‑G4‑01CAL Pack@CG-Frame is published as a notation-independent object with stable UTS ids (Name Cards with twin labels) for CAL.Charter, TaskMap, all operator, acceptance-clause, flow, and evidence-profile declarations, Worked-Examples, and public-id continuity notes, including deprecations and lexical-continuity notes. Tooling/vendor details remain non-normative.
CC‑G4‑02Each exact CALCharterRef = <charterId, charterEdition> resolves one immutable charter edition naming the exact CGFrameId, EntityOfConcernRef, ReferencePlane, CNSpecRef.edition, CGSpecRef.edition, and assumption envelope on which the pack relies.
CC‑G4‑03Every CAL.Operator has an explicit CHR‑typed signature and explicit preconditions; any legality guard macros referenced are cited by id (no “implicit legality”).
CC‑G4‑04Every reusable CAL.Acceptance binds the exact Characteristic and exact A.6.1 resultInputDeclarationRef values that declare the admissible C.16 measurement-result episteme inputs; the exact current result episteme is bound only in an actual application. A clause marked one-off may additionally cite fixedResultEpistemeRefs[]?. Every clause also declares its predicate or threshold, ClaimScope, evaluation window, any separate qualification window that limits use, unknown handling, and failure behavior. A statistically risk-controlled clause also names its loss, target, calibration population and window, sampling or exchangeability assumptions, declared treatment of shift, and the exact policy that states or defines the guarantee. Inputs with distinct source-local meanings cite the exact F.17 cells and obtaining F.9 relation; cross-plane or cross-edition inputs cite their applicable crossing records. None of these declarations establishes performed evaluation or a verdict.
CC‑G4‑05If an acceptance clause, operator, or flow induces numeric comparison or aggregation, it cites the relevant CG‑Spec.characteristic ids and links to legality proof refs (CSLC) in the ProofLedger; otherwise it must be authored so that downstream can degrade or abstain rather than perform illegal operations.
CC‑G4‑06Every CAL.Flow declares its result kind and the set of gating acceptance clauses; any thinning/selection‑aid policies (e.g., ε‑front selection) are explicitly policy‑bound and do not silently replace the underlying result kind.
CC‑G4‑07Every CAL.EvidenceProfile declares the provenance anchors, evidence lanes, and currentness or loss-policy pins its use needs. It cites DefaultId.GammaFoldForR_eff for B.3/C.2.2 support-model discipline and pins any numerical Γ-fold actually used. That calculation must preserve input meanings, scales, dependencies, formal/empirical distinctions, and mapping limits; absent a common model, retain separate support and a bounded synthesis. Losses affect R only and do not define dominance or an acceptance threshold.
CC‑G4‑08CAL.ProofLedger links each operator, flow, or clause to its required proof or justification and explicit failure behavior. A numerical Γ-fold or loss includes its receiving quantity, input scales, dependency model, derivation or calibration, assumptions, and boundary behavior; monotonicity and boundedness alone are insufficient. A missing required model cannot be repaired by F-to-R conversion or an invented default score.
CC‑G4‑09CAL publication includes RSCR tests and Worked‑Examples sufficient to detect illegality (incl. unit laundering / ordinal arithmetic), to exercise authored acceptance/flow behavior, and to validate the authored freshness envelope when it is part of admissibility; missing tests/examples are treated as an auditable gap, not as “assumed OK”.
CC‑G4‑10Each TaskMapRef = <taskMapId, taskMapEdition> resolves one immutable map edition containing the exact CALCharterRef, task, C.22 TaskSignatureRef, and edition-bearing acceptance-clause, operator, flow, and evidence-profile refs used by selection. Changing the charter, task, signature edition, or a cited component creates a new map edition. When G.4 gates are current, G.5 consumes this exact map alongside the same TaskSignatureRef; a mismatch or unresolved ref blocks that gated selector use. The map neither constructs the TaskSignature nor embeds thresholds or duplicates acceptance semantics.
CC‑G4‑11Any method/discipline specifics are placed under G.4:4.5 Extensions as GPatternExtension blocks (stable PatternScopeId, explicit governing definition, pins, and RSCR triggers); no extension introduces competing defaults or replaces G.Core invariants.
CC‑G4‑12CAL Pack@CG-Frame includes public-id continuity records for public ids: deprecations, edition bumps, and lexical-continuity notes. It exposes refresh payload pins, including editions, policies, UTS ids, and, when present, PathId and PathSliceId, sufficient for G.11 to plan RSCR without inferring semantics from prose.
CC‑G4‑13When G.4:Ext.NQD is present, CAL.NQD[] is present and is wired only via the declared subject pattern (C.18): at minimum it pins DescriptorMapRef.edition, DistanceDefRef.edition, and InsertionPolicyRef, and it treats archive/illumination summaries as report‑only unless explicitly promoted by a CAL acceptance clause/policy.
CC‑G4‑14CAL does not mint new universal types to encode “strategy/policy”. Strategy is expressed as authored flows + acceptance clauses + policy/task pins (and downstream registry/composition in G.5); any specialization is introduced only via GPatternExtension wiring blocks or cited subject patterns.
CC‑G4‑15Every runtime example keeps the reusable Method, MethodDescription, A.6.1 declaration, each precise performer’s A.13 core, independently A.15.1-admitted dated U.Work, optional later F.6 assignment-bound attribution, actual bindings and direct participants, local result, and C.2.1 result episteme distinct. Any F.6 relation uses the same obtaining A.13 assignment. A compact account may omit only an unused assignment identifier and no consumed fact; ordinary activity outside U.Work does not enter this rule.
CC‑G4‑16Each performed acceptance or decision path names its exact local result, applies the relevant result pattern, and states the exact later-use relation. Provenance stays with A.10/G.6, currentness with G.11, assurance with B.3, and decisions with C.11; no universal evaluation-result, work-result, evidence-use, or criterion-participant relation is introduced.