Theory Map

Theory Map

This page gives a plain-language map of the theory labels used by the project.

You do not need these terms to run the npm package. They help explain why the JSON reports keep residuals and obligations visible.

ECPT

Executable Capability Percolation Theory.

Plain meaning: candidate capability should move through finite checks before it is treated as reusable work.

BIT

Bottleneck Inversion Theory.

Plain meaning: find the limiting part of a workflow and route work toward the finite check that can reduce that bottleneck.

In v0.6.0, BIT also appears as witness registry extraction and CCR witness-completion tasks.

TRC

Typed Reality Compilation.

Plain meaning: keep the difference between a statement, a trace, and a verified executable route visible.

In v0.6.0, TRC also appears as trace normalization, operation-readiness checks, and trace-to-packet conversion.

SQOT

Salience-Queue Occupation Theory.

Plain meaning: attention and queue priority do not settle truth. A queue can recommend what to inspect next, but it cannot erase obligations.

In v0.6.0, SQOT queue diagnostics can emit CCR repair tasks as candidate handoff data.

ALT

Abstraction Liquidity Theory.

Plain meaning: a reusable abstraction should not become reusable capital until missing obligations and hazards are checked.

Shared Rule

All five ideas support the same engineering rule:

candidate work can be useful
but it must not be silently promoted to settled work

That is why PIC-TS preserves residual ledgers, blockers, missing obligations, and candidate-only reasons.

v0.6.0 extends the same rule to CCR JSONL and TRC operation candidates: handoff data can route work, but it cannot silently execute or settle it.