Back to Archive
PRODUCTProduct

One Blueprint Across Multiple Targets

How the transpilation chain uses PCD as a bounded intermediate form, what 10 source languages and 14 targets mean in practice, and where the equivalence claim stops.

2026-03-23T00:00:00.000Z
Editorial cover for One Blueprint Across Multiple Targets

Every transpiler in existence converts one language to one other language. BRIK64 converts any of 10 to any of 14 — 140 certified paths — with mathematical proof that the output is equivalent to the input.

Transpiler, Compiler, Interpreter — What's the Difference?

A compiler translates source code into machine code. GCC compiles C to x86. Rustc compiles Rust to native binaries. Low-level output: registers, memory addresses, jump instructions.

An interpreter reads source code and executes it line by line. Python's CPython reads your .py file and runs it immediately. No binary is produced. The source is the program.

A transpiler translates one high-level language into another. The output is still human-readable code. TypeScript transpiles to JavaScript. CoffeeScript transpiles to JavaScript. Babel transpiles modern JS to older JS.

Notice the pattern? Every transpiler you have ever used converts one language to one other language. TypeScript to JS. Sass to CSS. Kotlin to JVM bytecode. All 1-to-1. All without any guarantee that the output is equivalent to the input.

Why All Existing Transpilers Are 1-to-1

Building a transpiler is hard. You need to understand the source language's syntax, semantics, type system, edge cases, and runtime behavior. Then you need to map all of that onto the target language's constructs. A single mismatch — integer overflow, floating-point precision, string encoding — and the transpiled code behaves differently from the original.

This is why every transpiler is purpose-built for one pair of languages. The TypeScript compiler understands TypeScript and generates JavaScript. That is all it does. It does not generate Python. It does not accept Rust as input. The complexity of maintaining semantic fidelity across even one language pair is enormous.

Now multiply that by 10 input languages and 14 output targets. That is 140 possible transpilation paths. No team on Earth builds and maintains 140 transpilers.

Unless you change the architecture entirely. And that is exactly what BRIK64 does.

The N-to-N Architecture

BRIK64 does not build 140 transpilers. It builds 10 frontends (one per input language) and 14 backends (one per output target), connected through a single universal intermediate representation: PCD (Printed Circuit Description).

The architecture is elegant:

Source Language → Lifter → PCD Blueprint → TCE Check → Backend → Target LanguageEach frontend (the "Lifter") analyzes source code and maps it onto BRIK64's 128 mathematically certified atomic operations — monomers. The result is a PCD blueprint: a circuit schematic that describes what the code does, not how it does it. Each backend reads that blueprint and emits idiomatic, clean code in the target language.

This is the same insight behind LLVM. LLVM does not build a separate compiler for every language-to-architecture pair. It builds frontends (Clang for C, rustc for Rust) that emit LLVM IR, and backends that convert IR to x86, ARM, RISC-V. N frontends + M backends = N times M paths with N+M effort.

BRIK64 applies the same principle to source-to-source transpilation. But with one critical addition that LLVM does not have: mathematical certification. Every path through BRIK64 is proven correct. LLVM cannot say that.

One Command. Any Language.

Transpiling code with BRIK64 is a single command:

brikc transpile ./src/ --to rust --output ./dist/That is it. Point it at a directory of JavaScript, Python, Go, C, COBOL — whatever you have. Tell it the target. Get certified, idiomatic output.

Behind the scenes, the command executes the full pipeline: lift, analyze, generate PCD, certify with TCE (Phi C = 1), emit target code, write output files. Every step is verified. Every output is certified.

Real Example: COBOL Banking to Go

Here is a real scenario. A COBOL program that calculates compound interest — the kind of code running in thousands of banks worldwide, written in the 1980s, maintained by engineers who are retiring:

brikc transpile interest_calc.cob --to go --output interest_calc.go

The Lifter analyzes the COBOL source, identifies the arithmetic operations, maps them to verified monomers, generates a PCD blueprint, certifies it with Phi C = 1, and emits clean Go code. The Go output does exactly what the COBOL did — not because a heuristic guessed at the semantics, but because both are projections of the same mathematically certified circuit.

The same COBOL can also be transpiled to Rust, Python, Java, or any of the other 14 targets. supported outputs should be reviewed against the same declared blueprint. Every output carries the same Phi C = 1 guarantee. Other tools give you plausible-looking code. BRIK64 gives you proven-equivalent code.

Why Certification Changes Everything

Existing migration tools — AI-powered code converters, LLM-based translators — generate plausible-looking output. But plausible is not equivalent. An LLM that converts Python to Rust might get the happy path right but silently change integer overflow behavior, exception handling, or floating-point rounding. You will not know until production breaks.

BRIK64 does not guess. The Lifter maps source code onto a finite algebra of 128 verified operations. The TCE certifies that the resulting circuit is closed — every input consumed, every output produced, zero information leakage. The backend emits code from that certified blueprint. The guarantee is mathematical, not statistical.

This is the difference between "our AI says the code looks right" and "the algebraic structure proves the code is equivalent." One is a bet. The other is a proof.

The Full Pipeline

Here is exactly what happens when you run brikc transpile:

1. Lift. The frontend parses the source language, identifies functions and operations, and maps them to BRIK64 monomers. Pattern matching recognizes common idioms: Math.abs(x) in JavaScript becomes the ABS monomer, len(s) in Python becomes LEN, x >> 3 in C becomes SHR. 10 languages, one unified representation.

2. Analyze. The analyzer checks liftability — can this function be represented entirely with core monomers? Functions that map completely get CORE certification (Phi C = 1). Functions that use extended operations (file I/O, network calls) get CONTRACT certification. Functions that can't be mapped are flagged as unliftable.

3. Generate PCD. The emitter produces a .pcd file — a Printed Circuit Description — that captures the program's logic as a composition of monomers connected by EVA algebra operators (sequential, parallel, conditional).

4. Certify. The TCE engine measures seven properties of the circuit and computes Phi C. If Phi C = 1, the circuit is closed and the program is certified correct.

5. Emit. The backend reads the PCD blueprint and generates idiomatic code in the target language — proper naming conventions, language-specific patterns, correct types. Not mechanical translation. Clean, readable code.

6. Execute. The output code runs natively in the target language's ecosystem. No runtime dependencies. No BRIK64 library required. It is just clean code in your language of choice.

Supported Languages

10 Input Languages (Lifter): JavaScript, TypeScript (TSX/JSX), Python, Rust, C, C++, Go, COBOL, PHP, Java.

14 Output Targets (Backends): Rust, JavaScript, TypeScript, Python, C, C++, Go, COBOL, PHP, Java, Swift, WebAssembly, BIR (bytecode), Native x86-64.

Every input-to-output combination works through the same PCD intermediate representation. 10 times 14 equals 140 transpilation paths — scope-dependent and evidence-bound. Few public tools in this category offers this.

What We Are Building Next

The transpiler handles individual functions and modules today. Here is what is coming:

Module resolution — following imports and dependencies across files to transpile entire projects, not just individual functions. Point it at a repo, get a repo.

Full codebase conversion — pointing the transpiler at a complete repository and producing a fully functional project in the target language, with build files, dependency manifests, and project structure. One command, one repo, one certified migration.

Cross-target consistency verification — proving that the same PCD blueprint, emitted to JavaScript and Rust and Python, produces identical outputs for identical inputs across all 14 targets.

The universal transpiler is not a vision. It works today. 10 languages in, 14 out, 140 paths, each one requiring current artifact evidence. Try it.

More reading

Continue the archive

Full archive
Technical BRIK64 diagram showing an AI coding prompt transformed into a reviewable blueprint, human review checkpoint, and target outputs.
AI safetyUncategorized

Reviewable AI Coding Pipelines: From Prompt to Blueprint

AI-generated code workflows become more reviewable when teams separate the prompt, generated code, structural blueprint, human review, and target compilation.

Open article
BRIK64 editorial image showing AI-generated software becoming inspectable, certified, and compiled across targets.
AI-generated softwareUncategorized

Making AI-Generated Software Reviewable

AI-generated software can move quickly, but it still needs structure, traceability, and review boundaries. BRIK64 helps teams preserve the blueprint behind generated code.

Open article
Editorial cover for AI Governance Workflows Need Reviewable Technical Evidence
AI SAFETYAI Safety

AI Governance Workflows Need Reviewable Technical Evidence

How bounded software evidence can help teams carry AI governance reviews into compliance workflows without implying full legal coverage.

Open article
Editorial cover for Compiler Evidence: Targets, Proof Files, and Test Scope
ENGINEERINGEngineering

Compiler Evidence: Targets, Proof Files, and Test Scope

A summary of the public numbers that can be stated responsibly and the limits of what those numbers prove.

Open article
Editorial cover for Safety-Critical Software Needs a Readable Assurance Path
PRODUCTProduct

Safety-Critical Software Needs a Readable Assurance Path

How bounded software evidence can support engineering review in high-consequence domains without replacing the broader safety program.

Open article
Editorial cover for Bounded Contract Logic Before Deployment
PRODUCTProduct

Bounded Contract Logic Before Deployment

Why smart contract workflows benefit from explicit state boundaries, value constraints, and reviewable rule sets before deployment.

Open article
Editorial cover for What the Proof Material Means for Users
VISIONFoundations

What the Proof Material Means for Users

A practical note on the proof files behind the compiler and what remains invisible to a normal authoring workflow.

Open article
Editorial cover for Why a New Format Instead of Another General-Purpose Language
VISIONFoundations

Why a New Format Instead of Another General-Purpose Language

Why BRIK64 introduces PCD as a bounded computational format rather than extending a conventional language with another annotation layer.

Open article
Editorial cover for Adversarial Testing Against the Compiler Chain
ENGINEERINGEngineering

Adversarial Testing Against the Compiler Chain

How the team tries to break the compiler and what those tests can and cannot prove about the formal system.

Open article
Editorial cover for Translation Validation Across Two Targets
RESEARCHResearch

Translation Validation Across Two Targets

A look at cross-target output comparison, what it can support, and what still depends on the bounded intermediate form.

Open article
Editorial cover for Why Tests Passing Is Not the Same as Closure
VERIFICATIONEngineering

Why Tests Passing Is Not the Same as Closure

A look at sampled testing versus bounded verification, with examples of logic that passed tests but still required stronger structural checks.

Open article
Editorial cover for What AI Intuition Still Cannot Verify
AI SAFETYAI Safety

What AI Intuition Still Cannot Verify

Why intuition without an external proof path remains a risk, and where BRIK64 fits in that boundary.

Open article
Editorial cover for API and MCP Access Around the Registry
PLATFORMProduct

API and MCP Access Around the Registry

How discover-and-execute workflows expose registry and platform operations to humans and agents without enlarging the proof claim.

Open article
Editorial cover for Blueprints Before Refactors
REVOLUTIONProduct

Blueprints Before Refactors

How extracting bounded computation from an existing codebase can make rewrites and target changes easier to review.

Open article
Editorial cover for A Bounded JavaScript-to-Rust Workflow
TUTORIALGetting Started

A Bounded JavaScript-to-Rust Workflow

Lift the logic, review the bounded blueprint, then emit a target language while keeping the claim attached to the intermediate circuit.

Open article
Editorial cover for Lifting Existing Code into a Reviewable Blueprint
TOOLINGProduct

Lifting Existing Code into a Reviewable Blueprint

What the Lifter preserves, where liftability evidence exists in the repo, and how bounded blueprints help before migration.

Open article
Editorial cover for COBOL Migration Through Bounded Lift-and-Review
MIGRATIONProduct

COBOL Migration Through Bounded Lift-and-Review

Why legacy modernization benefits from lifting review-critical logic into a bounded blueprint before transpilation or replacement.

Open article
Editorial cover for Why AI-Generated Code Needs Blueprints and External Checks
PRODUCTAI Safety

Why AI-Generated Code Needs Blueprints and External Checks

Generated code and generated tests can fail together. This note explains why BRIK64 keeps verification outside the model loop.

Open article
Editorial cover for Which Parts of a Codebase Are Ready for Stronger Review?
PRODUCTProduct

Which Parts of a Codebase Are Ready for Stronger Review?

Use lifting and bounded analysis to identify review-critical functions before migration or certification work.

Open article
Editorial cover for Laszlo B. Kish and the Information-Theory Thread
RESEARCHResearch

Laszlo B. Kish and the Information-Theory Thread

A research profile on the ideas that influenced the information-theoretic framing behind Digital Circuitality.

Open article
Editorial cover for Informational Entropy Is Not Thermal Entropy
RESEARCHResearch

Informational Entropy Is Not Thermal Entropy

Why the distinction matters for the foundations story and how it sharpens the claim boundary around Digital Circuitality.

Open article
Editorial cover for From Preferences to Enforced Action Boundaries
AI SAFETYAI Safety

From Preferences to Enforced Action Boundaries

Why robotics and agent systems need explicit action gates, bounded state, and reviewable fallback paths.

Open article
Editorial cover for First PCD Circuit: A Minimal Walkthrough
TUTORIALGetting Started

First PCD Circuit: A Minimal Walkthrough

Install the CLI, write a small circuit, and inspect the bounded output path. A practical introduction to the format and the compile step.

Open article
Editorial cover for EVA Algebra: Sequence, Parallel, Conditional
DEEP DIVETheory

EVA Algebra: Sequence, Parallel, Conditional

How three composition operators carry sequencing, fan-out, and branching through the circuit model, and what that means for compiler readability and closure.

Open article
Editorial cover for Working with the SDKs Without Leaving the Bounded Model
SDKSGetting Started

Working with the SDKs Without Leaving the Bounded Model

How the Rust, JavaScript, and Python SDKs expose BRIK64 patterns while keeping the formal core distinct from host-language code.

Open article
Editorial cover for Why Software Verification Still Looks Different from Hardware
RESEARCHResearch

Why Software Verification Still Looks Different from Hardware

A comparison between sampled software testing and the compositional review posture hardware teams expect.

Open article
Editorial cover for 128 Operations and the Boundary Between Core and Bridges
ENGINEERINGEngineering

128 Operations and the Boundary Between Core and Bridges

A tour of the reviewed core, the contract-bounded extensions, and what that split means for technical scope.

Open article
Editorial cover for PCD for AI Agents: A Small Format with an External Proof Loop
AI AGENTSAI

PCD for AI Agents: A Small Format with an External Proof Loop

How a finite grammar helps agents author bounded logic while the compiler and policy checks stay outside the model.

Open article
Editorial cover for Precision as a Declared Domain
ENGINEERINGEngineering

Precision as a Declared Domain

Why bounded numeric domains matter for floating behavior, decimal handling, and reviewable arithmetic.

Open article
Editorial cover for BPU: Policy Enforcement as a Hardware Roadmap
HARDWAREHardware

BPU: Policy Enforcement as a Hardware Roadmap

Why software-only guardrails share execution context with the model they constrain, and how the BPU roadmap moves policy enforcement toward FPGA and silicon.

Open article
Editorial cover for Policy Circuits for AI Safety Workflows
AI SAFETYAI Safety

Policy Circuits for AI Safety Workflows

How external policy circuits can gate generated code and agent actions without claiming to solve general alignment.

Open article
Editorial cover for What Digital Circuitality Tries to Formalize
VISIONFoundations

What Digital Circuitality Tries to Formalize

A bounded programming model built from reviewed operations, explicit composition, and closure checks.

Open article