Replies: 1 comment
-
|
Closing this out as part of a cleanup of the discussion board. We're on the 7.x releases now and a lot has changed since this thread was active. Thanks to everyone who jumped in. If this is still relevant on 7.x, please open a fresh discussion or issue and we'll pick it up there. |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
The Problem: VERIFY relies on the LLM judging its own work
PAI's Algorithm is one of the most well-structured agentic execution frameworks I've seen — ISC criteria, anti-criteria, the Builder-Validator Pair Pattern, and the 7-phase loop all converge on the right architectural shape.
But there's a structural weakness in VERIFY: the system that generated the output is also the system (or a sibling LLM) that evaluates whether the output meets ISC criteria. A probabilistic check on a probabilistic output. The Builder-Validator Pair improves this, but the Validator is still an LLM — it can hallucinate a passing verification just as easily as the Builder can hallucinate a correct solution.
This is the same gap that exists in every agentic system today: there's no formal mechanism that makes ISC violations structurally impossible to commit.
The Proposal: Constraint-Projected Verification
We've been building a system called CPSC-RE (Constraint-Projected State Computing — Reasoning Engine) at BitConcepts that directly addresses this (https://github.com/cpsc-computing/). The core idea:
ISC criteria and anti-criteria are expressed as machine-executable constraints. A deterministic projection engine evaluates them — not an LLM.
The execution model:
The 7-phase loop stays intact. No phase is replaced. VERIFY is hardened from probabilistic assessment to deterministic enforcement.
Why This Fits PAI's Existing Architecture
The patterns already in TheAlgorithm map directly:
The Hook System (17 hooks, 7 lifecycle events) also maps naturally. Hooks are currently procedural checks that run independently. Constraint projection evaluates all hooks jointly — detecting conflicts between hooks and guaranteeing that if projection succeeds, all security/access/deletion invariants hold simultaneously.
What ISC → Constraint Translation Looks Like
ISC today (natural language):
Formal constraint equivalent (CAS-YAML):
This translation can happen automatically in PLAN phase — the LLM generates ISC (it's good at that), then a translation step formalizes them into machine-enforceable constraints. Human-readable criteria stay as-is for the user. Machine-executable constraints run in the projection engine.
What This Gives PAI
About the Technology
CPSC-RE is part of Constraint-Projected State Computing (CPSC), a computing paradigm where correctness is enforced by projecting proposed states into constraint-defined spaces. It's covered by a U.S. provisional patent (BitConcepts, filed Feb 2026). The specific embodiments relevant here are CPSC-Governed Agentic Development (CGAD) — which treats agents as untrusted proposal generators whose outputs must satisfy declared constraints before acceptance.
The specification format (CAS-YAML) is declarative, composable, and version-controlled. The same constraints run on a software engine (Rust) or hardware fabric (VHDL/FPGA) without modification.
We think PAI has independently arrived at the same architectural insight that CGAD formalizes: state-based criteria, binary testability, builder-validator separation, anti-criteria as invariants. The gap is the enforcement mechanism — and that's what CPSC-RE provides.
We'd love to explore integration or collaboration. The fit between PAI's Algorithm and CPSC-RE's constraint projection is natural — PAI already has the right shape, it just needs a non-probabilistic backbone for VERIFY.
— Tristen @ BitConcepts
Beta Was this translation helpful? Give feedback.
All reactions