# The algo records whose domain is checklist-creation

This index as JSON: https://banes-lab.com/json/api/facets/algo/domain/checklist-creation

## Entries

- [Orientation Stage](https://banes-lab.com/records/algo/orientation-stage.md): Establish authority, trust, intent, and change-directionality, and gather current-system evidence before any planning, emitting a context bundle that is the sole artifact the planning stage reads.
- [Authoritative Source Loading](https://banes-lab.com/records/algo/authoritative-source-loading.md): Resolve the always-read core sources plus the conditional sources whose triggers appear in the task, read them before analysis, and block with a blocker finding if any required source is missing.
- [Trust Anchor](https://banes-lab.com/records/algo/trust-anchor.md): Classify every input by trust level — source files, schema/config/data, build and validator output, tool output, and structured logs are trusted; narrative docs, comments, prior codebase knowledge, and unverified claims are untrusted and require verification before use.
- [Intent & Directionality Normalization](https://banes-lab.com/records/algo/intent-directionality-normalization.md): Normalize the task into a requested outcome, actions, and entities, and resolve the change relation — introduce, retain, remove, analyze, or mention — that later stages key their semantic policy on; an unresolved direction is recorded as ambiguity, never silently assumed.
- [Skeptical Context Acquisition](https://banes-lab.com/records/algo/skeptical-context-acquisition.md): Extract task keywords, generate discovery probes dynamically, inspect the existing implementation, and prevent new work from redefining architecture that already exists.
- [Dynamic Discovery Pattern Generation](https://banes-lab.com/records/algo/dynamic-discovery-pattern-generation.md): Convert extracted nouns, verbs, folders, and file references into glob, grep, and target-file probes generated from the task's own language rather than a fixed enumeration.
- [Teleological Intent Gate](https://banes-lab.com/records/algo/teleological-intent-gate.md): Resolve what the checklist is for before planning it: enumerate the admissible decomposition branches, score each by utility minus cost against the normalized intent and change relation, and gate on the highest-worth admissible branch before any seeing or deriving.
- [Planning Stage](https://banes-lab.com/records/algo/planning-stage.md): Activate the principles that govern the current decision surfaces, select protocols by semantic fit against the requested transition, decompose them into phases, build the four-dimensional graph, and linearize the phases by dependency.
- [Principle Activation](https://banes-lab.com/records/algo/principle-activation.md): Test each principle in the ontology catalog against the current decision surfaces, mark it applies, uncertain, or not-applicable with a reason, and bind every applied principle to a decision test, a validator, and a severity that later routes its repair.
- [Protocol Semantic Selection](https://banes-lab.com/records/algo/protocol-semantic-selection.md): Match the requested state transition and architecture surfaces semantically against the protocol library, select every protocol whose use-condition fits, and always inject the mandatory verification protocol.
- [Phase Decomposition](https://banes-lab.com/records/algo/phase-decomposition.md): Expand each selected protocol's verb chain into phases, and annotate every phase with an id, verb, objective, preconditions, inputs, outputs, affected artifacts, local principles, severity, loop class, and a four-dimensional graph.
- [Four-Dimensional Phase Graph](https://banes-lab.com/records/algo/four-dimensional-phase-graph.md): For every phase, model the sequential dependency axis, the lateral independent-peer axis, the diagonal shared-data axis, and the propagation axis carrying superseded state, propagated contracts, and what breaks if the edge is omitted.
- [Dependency Linearization](https://banes-lab.com/records/algo/dependency-linearization.md): Detect cycles in the sequential Z-graph, block if any exist, and otherwise order the phases in topological Z-order with a stable tie-breaker so execution order is fixed by dependency alone.
- [Severity Assignment](https://banes-lab.com/records/algo/severity-assignment.md): Derive each phase's severity from the worst severity of its governing principles; severity is per-phase metadata that selects the repair route, while execution order stays linear by dependency.
- [Loop Class Labeling](https://banes-lab.com/records/algo/loop-class-labeling.md): Classify each phase by its verb into a construction, perceptual, cognitive, executive, or linking loop class so the phase's cognitive role is explicit.
- [Compilation Stage](https://banes-lab.com/records/algo/compilation-stage.md): Compile each phase into atomic, target-specific tasks under binding codebase-pattern execution constraints, attach a full nine-dimension named ripple chain to every task, and number the hierarchy N.N.N.
- [Codebase Pattern Enforcement](https://banes-lab.com/records/algo/codebase-pattern-enforcement.md): Bind every emitted step to the required architecture pattern for its concern — factory construction, dependency injection, registry discovery, event emission, ports and adapters, contract-first boundaries, encapsulation, structured observability, bounded complexity, secrets management, input validation, least privilege, config externalization, fail-fast, legacy elimination, and enforcement authoring — rewriting each forbidden form into its required form.
- [Verb Template Binding](https://banes-lab.com/records/algo/verb-template-binding.md): Map each execution verb to a task pattern, a tool set, and a blocking validation command, so a verb becomes a checklist task only through a validated template.
- [Task Atomization](https://banes-lab.com/records/algo/task-atomization.md): Extract atomic, target-specific actions from each phase group, gate every action through the codebase-pattern constraints, and attach an evidence contract, local principle checks, a validation method, and a done-condition to each.
- [Ripple Chain Analysis](https://banes-lab.com/records/algo/ripple-chain-analysis.md): Analyze each task across nine impact dimensions — registry, contracts, persistence, security, infrastructure, performance, observability, enforcement, and consumers — and record every named downstream effect with its consequence-if-omitted rather than a count, retaining an empty dimension with explicit applicability evidence.
- [Validator Coverage](https://banes-lab.com/records/algo/validator-coverage.md): For every architectural pattern introduced or referenced, discover an existing detector or author a new one, register it, and regenerate the catalog so the rule becomes an active enforcement gate rather than a convention.
- [Structured Observability Context](https://banes-lab.com/records/algo/structured-observability-context.md): Detect whether a task touches errors, contract or invariant violations, events, or resource lifecycle, and require the matching structured, machine-queryable observability context instead of a free-form message.
- [Cross-Cutting Surface Coverage](https://banes-lab.com/records/algo/cross-cutting-surface-coverage.md): Gate the software surface beyond structure — security, performance, infrastructure and deployment, and resilience — so a change's threat, budget, config, and failure consequences are covered, not only its structural ones.
- [Legacy Elimination](https://banes-lab.com/records/algo/legacy-elimination.md): For any change that touches a replaced, deprecated, dual-path, or fallback code path, delete the superseded path and its orphaned exports in the same completed change so exactly one forward path remains.
- [Hierarchical Numbering](https://banes-lab.com/records/algo/hierarchical-numbering.md): Render addressable coordinates — Phase N, Task N.N, Subtask N.N.N — assigned only after the phase order is stable.
- [Admissibility Constraint Gate](https://banes-lab.com/records/algo/admissibility-constraint-stage.md): Gate the formalised plan on teleological admissibility before verification: sum the realised cost, compare it to the selected branch's budget and hard limits, and confirm every task traces to the selected branch — an over-budget, limit-breaching, or off-branch plan is inadmissible and routes back rather than being silently accepted.
- [Validation Stage](https://banes-lab.com/records/algo/validation-stage.md): Judge the generated reasoning — not the future implementation — against evidence and semantic policy: run the governance validation suites, verify every material claim by evidence, and apply the semantic-debt rubric before rendering.
- [Semantic Debt Policy](https://banes-lab.com/records/algo/semantic-debt-policy.md): Classify the relation a task holds to each controlled debt concept — backward-compatibility path, failure-masking fallback, deprecated or dual production path, deferred required work, shortcut debt, and unsupported superlative claim — blocking only the introduce and retain relations while allowing mention, analysis, quotation, and removal.
- [Evidence-Based Claim Verification](https://banes-lab.com/records/algo/evidence-based-claim-verification.md): Extract every material claim from the generated records, weigh supporting against contradicting evidence in the inventory, and classify each as supported, contradicted, not-applicable, or unsupported — recording the searched scope for a zero-result claim.
- [Validation Suite Battery](https://banes-lab.com/records/algo/validation-suite-battery.md): Run the governance validation suites over the generated context, phases, tasks, and claims — state integrity, authority, principle activation, plan graph, tasks, ripple, semantic policy, evidence, and output serializability — and emit findings that each name what was examined and carry an owner stage.
- [Repair Stage](https://banes-lab.com/records/algo/repair-stage.md): Route every finding to its earliest responsible owner stage, apply the fix, invalidate every dependent record downstream, and re-run from that stage — bounded to a fixed number of cycles, after which the run terminates as blocked with the remaining findings.
- [Bounded Repair Loop](https://banes-lab.com/records/algo/bounded-repair-loop.md): Cap the repair loop at a fixed cycle limit, and on each cycle repair from the earliest invalid stage, invalidate all downstream records, and regenerate them; exceeding the limit sets the run blocked with the remaining findings.
- [Severity Failure Routing](https://banes-lab.com/records/algo/severity-failure-routing.md): Use each finding's severity to choose its repair route — a blocker blocks and repairs, an error repairs, a warning requires a disposition, and anything lower is investigated.
- [Rendering Stage](https://banes-lab.com/records/algo/rendering-stage.md): Serialize only validated records into the checklist deterministically, or render the blocked report, emitting exactly one terminal — success or blocked — with future execution checkboxes left unchecked, and stop within the cycle bound.
- [Checklist Output Rendering](https://banes-lab.com/records/algo/checklist-output-rendering.md): Emit the markdown checklist — governing context, principle disposition, phases in Z-topological order with loop class, severity, four-dimensional graph, and named ripple chains, hierarchically numbered tasks with evidence contracts, per-phase execution gates, appendices, and a final blocking execution gate — all left unchecked for future execution.
- [Explicit Termination](https://banes-lab.com/records/algo/explicit-termination.md): Guarantee the generator stops with exactly one terminal — a written success artifact whose rendering integrity is verified, or a written blocked report — never a premature stop while the status is repairable and never a loop beyond the cycle bound.
- [Cross-Stage Invariants](https://banes-lab.com/records/algo/cross-stage-invariants.md): Bind every stage to the always-and-never rules of the generator — resolve authority and directionality before planning, discover before assuming, activate principles with a bound validator, order by dependency with severity as routing metadata, read only the prior stage's output contract through one evidence-bearing handoff, represent all four graph axes, require evidence for every claim, separate generation gates from future execution gates, repair from the earliest invalid stage, and render deterministically.
- [Checklist Creation Kernel](https://banes-lab.com/records/algo/checklist-creation-kernel.md): Run the six-stage generator in order — orientation, planning, compilation, validation, repair, and rendering — bound by the cross-stage invariants, compiling a task description into a validated, dependency-aware execution checklist or an evidence-bearing blocked report.
- [<Checklist Governance Concern>](https://banes-lab.com/records/algo/checklist-governance-concern.md): <Orient on authority + evidence> → <Plan principles + protocols + dependency graph> → <Compile atomic tasks + ripple chains> → <Validate reasoning by evidence + semantic policy> → <Repair from the earliest invalid stage> → <Render one bounded terminal>