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 08:25:59 UTC · snapshot created 2026-10-03 08:26:43 UTC · last check 2026-10-03 08:35:10 UTC

C.29.2:7 - Conformance Checklist

Apply these checks to the computational claim being made.

CheckWhat must be recoverable
Answer and scopeThe input class, required answer and any accuracy or interaction condition; an output characterization is distinguishable from its obtaining procedure.
Represented distinctionsInput meaning, computational state and output interpretation, including a retained distinction that a later operation needs.
Available operationsWhat each consequential operation does and where any non-elementary construction comes from.
Obtaining constructionAn executable ordering, an applicable solver for declared relations, another specified computational behavior, or a substantive missing-construction task.
ArgumentA proposed computation has a worked case and the argument needed for its claimed range, including termination or response properties when claimed. An obstruction has an argument establishing its scope.
AccuracyThe error relation or probability guarantee used by the receiver and the arithmetic, approximation, sampling and interpretation conditions that support it.
ResourcesThe relevant element/operation counts, per-element or per-operation costs, size parameters and material preparation/readout costs.
Result boundaryA qualified answer, restriction or obstruction; no unsupported promotion of one trace, failed representation or simulated execution.
ReturnThe failed connection and the contribution that can change it, without requiring further work after a sufficient result.