Percolation Inversion Compiler
Authors/Creators
Description
Percolation Inversion Compiler is an Apache-2.0 open-source Python runtime and finite verifier-routing SDK for AI agent workflows, developed as a reference implementation layer for ECPT, BIT, TRC, and SQOT.
The software implements a finite, fail-closed runtime for protocol-relative collective capability tracking. It does not model AI progress as a single agent rewriting itself, fine-tuning itself, or changing model weights. Instead, it represents ECPT-style collective phase progress as the accumulation, verification, routing, scheduling, and reuse of finite capability packets produced by a fixed population of agents under declared constraints.
The package provides deterministic JSON interfaces for:
-
capability packet ingestion and promotion;
-
verified packet capital records;
-
semantic packet-edge certificates;
-
theorem-to-code, code-to-test, obligation-to-verifier, execution-path, rollback-support, liquidity-transfer, and autocatalytic-regeneration edge checks;
-
verifier evidence envelopes and evidence-store references;
-
proof obligations and residual ledgers;
-
SQOT salience-queue scheduling;
-
Psi dashboards with graph, execution, closure, verification, liquidity, search-cost, constraint, false-liquidity, basin, salience, and hazard components;
-
execution-available path certificates;
-
hidden-capability-injection reports;
-
fixed-population and no-self-rewrite ledgers;
-
collective phase certificates;
-
runtime event logs and SQLite-backed runtime stores;
-
finite acceleration certificates against resource-matched baselines;
-
provenance manifests, SBOM-ready metadata, and portable JSON Schemas.
The intended use is to help engineers, researchers, and AI agent systems determine which finite artifacts are usable, which evidence routes have been accepted, which semantic links are supported, which obligations remain unresolved, which residuals must remain visible, and which runtime actions should be routed next.
This release should be interpreted as a finite, protocol-relative ASI-proxy collective phase runtime. It does not claim to prove real ASI, unobserved physical outcomes, oracle results, simulator truth, or external-domain facts. It also does not claim that self-rewriting, fine-tuning, or model-weight changes are required for ECPT-style collective phase progress. Unresolved obligations and residuals are intentionally preserved in machine-readable fail-closed records.
Related theoretical references:
-
Executable Capability Percolation Theory (ECPT): https://doi.org/10.5281/zenodo.20535654
-
Bottleneck Inversion Theory (BIT): https://doi.org/10.5281/zenodo.20545356
-
Typed Reality Compilation (TRC): https://doi.org/10.5281/zenodo.20554083
-
Salience-Queue Occupation Theory (SQOT): https://doi.org/10.5281/zenodo.20526451
Repository:
Files
kadubon/percolation-inversion-compiler-v0.3.3.zip
Files
(477.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:905ec4d6109c28dc0f0b8432e00b6215
|
477.8 kB | Preview Download |
Additional details
Related works
- Is supplement to
- Software: https://github.com/kadubon/percolation-inversion-compiler/tree/v0.3.3 (URL)
- Preprint: 10.5281/zenodo.20535654 (DOI)
- Preprint: 10.5281/zenodo.20545356 (DOI)
- Preprint: 10.5281/zenodo.20554083 (DOI)
- Preprint: 10.5281/zenodo.20526451 (DOI)
Software
- Repository URL
- https://github.com/kadubon/percolation-inversion-compiler
- Programming language
- Python