This is PCD. The language designed for AI.
64 certified operations. 64 extended. Learn it in one prompt. An AI writes PCD directly. Humans use the Lifter. Φc = 1 means every path is verified. 14 export targets. Free. Ready today.
“Describe once. Build in any material.”
[01] NOT A LANGUAGE — A FORMAT
AI-native language
128 operations total. An LLM memorizes the entire language in one prompt. No documentation rabbit holes. No ambiguity. No undocumented behavior.
Verified operations
Every PCD program is built from formally verified operations. Core mathematically certified, plus contract-based extended set.
Verified by design
If the blueprint doesn’t close as a circuit (Φ_c ≠ 1), it simply won’t compile. The math is the guarantee.
Multi-target
Compile to Rust, JavaScript, Python, C, C++, Go, COBOL, and more.
Self-compiling
The brikc compiler compiles itself producing an identical hash. The fixpoint is the proof.
Designed for AI
128 total operations. An LLM can learn the entire language. Generate certified PCD in seconds.
[02] SYNTAX
Circuit schematics, not source code
Every PCD program is a named circuit block. The OUTPUT directive marks the final value emitted. Variables are immutable (SSA form). Functions, closures, loops, and conditionals are all supported.
PC circuit_name {
// functions and logic here
OUTPUT result;
}let x = 42; // immutable
let name = "hello"; // string
let flag = true; // boolean
fn add(a, b) {
return a + b;
}
fn factorial(n) {
if (n <= 1) { return 1; }
return n * factorial(n - 1);
}// Loop with carried variable
let count = 0;
loop(10) as i {
let count = count + 1;
}
// Closure
let double = fn(n) { n * 2 };
let result = double(5); // 10PC hello {
let msg = "Hello, verified world!";
let n = LEN(msg);
WRITE(1, msg, n);
OUTPUT 0;
}Types tell you what. Domains tell you where.
Every input in PCD lives inside a declared domain — a numeric range enforced by the compiler. Without domains, a circuit cannot close. With domains, the compiler can prove that every input path produces a valid output.
input speed : Float64[0.0 .. 340.0] // knots — bounded to flight envelope
input altitude : Float64[0.0 .. 51000.0] // feet — bounded to service ceiling
input time : Float64[1.0 .. 86400.0] // seconds — never zeroNo division by zero
Lower bounds exclude zero when needed.
No overflow
Bounded inputs produce bounded outputs.
No NaN or Infinity
Float64 ranges exclude degenerate values.
Deterministic behavior
Same inputs, same outputs, every time.
Deep dive: Why Your Calculator Is Lying to You
[03] 128 MONOMERS
The complete operation catalog
64 formally verified atomic operations (Core, mathematically certified) + 64 bounds-checked extended operations (CONTRACT). Every monomer has a declared domain, range, postconditions, and termination guarantee.
Core Monomers — 64 operations Φc = 1
Extended Monomers — 64 operations CONTRACT
Core monomers remain formally verified regardless of what Extended monomers surround them. The compiler enforces the boundary statically.
[04] EVA ALGEBRA
Three operators. Correctness preserved.
Sequential
Do A then B: output of A feeds into B. Pipeline composition.
Parallel
Do A and B independently on the same input. Results as tuple.
Conditional
If predicate P holds, do A; otherwise do B. Both branches verified.
Correctness preserved by composition. Mathematically certified. Φc = 1 for the entire composition if all constituent monomers are Core.
Start building — free
PCD describes WHAT your program computes — not HOW. Language-agnostic. Mathematically verifiable. Compiles to any target.