BPU — BRIK Processing Unit
From CPU to GPU to BPU: The Missing Processor
Computing has evolved through two major processor paradigms:| Processor | Year | Purpose | Key Innovation |
|---|---|---|---|
| CPU | 1971 | General computation | Sequential instruction execution |
| GPU | 1999 | Parallel acceleration | Thousands of cores for data parallelism |
| BPU | 2026 | Regulatory verification | 64 hardwired monomer units + EVA Router + CMF Unit |
ALLOW or BLOCK —
before any AI-generated action reaches the host system.
The BPU enforces policy at the hardware level. There is no software instruction
that can override a BLOCK decision. The enforcement is non-maskable by design.
Architecture Overview
The BPU contains three main subsystems operating in a fixed pipeline:64 Monomer Units
One dedicated silicon unit per canonical monomer (MC_00 through MC_63).
Each unit is a hardwired combinational circuit with no firmware.
EVA Router
Routes monomer calls according to EVA algebra composition laws:
sequential (⊗), parallel (∥), and conditional (⊕).
CMF Unit
Coherence Metric Framework unit. Certifies that Φ_c = 1 for every
policy circuit before it is loaded into the BPU.
Monomer Coverage
The BPU implements only Core monomers (MC_00 through MC_63).| Family | Range | Operations |
|---|---|---|
| Arithmetic | MC_00 – MC_07 | ADD8, SUB8, MUL8, DIV8, MOD8, ABS8, NEG8, POW8 |
| Logic | MC_08 – MC_15 | AND, OR, XOR, NOT, SHL, SHR, ROTL, ROTR |
| Memory | MC_16 – MC_23 | LOAD, STORE, ALLOC, FREE, COPY, MOVE, SWAP, ZERO |
| Control | MC_24 – MC_31 | IF, LOOP, CALL, RET, JUMP, HALT, NOOP, YIELD |
| I/O | MC_32 – MC_39 | READ, WRITE, OPEN, CLOSE, SEEK, FLUSH, STAT, SYNC |
| String | MC_40 – MC_47 | CONCAT, SPLIT, SUBSTR, LEN, UPPER, LOWER, TRIM, MATCH |
| Crypto | MC_48 – MC_55 | HASH, VERIFY_HASH, SIGN, ENCRYPT, DECRYPT, RAND, DERIVE, SEAL |
| System | MC_56 – MC_63 | TIME, PID, WRITE_FD, DEC2, SEND, RECV, LOG, ASSERT |
Policy Circuits
A Policy Circuit is a PCD program composed exclusively of Core monomers that evaluates an action descriptor and returns exactly one of two values:ALLOW or BLOCK.
The CMF Unit verifies the closure property before loading:
Example Policy Circuit
Real-World Applications
Autonomous Warehouse Robots
A warehouse robot controlled by AI must never leave its designated zone, exceed safe speeds near humans, or access restricted areas:Delivery Drones with Geofencing
A delivery drone must respect altitude limits, no-fly zones, and return-to-base conditions — regardless of what the AI navigation system decides:Surgical Robotic Arms
Medical robots operating near patients require force limits and movement boundaries that cannot be overridden by any software — including a malfunctioning AI:The Non-Maskable BLOCK
This is the fundamental property that distinguishes the BPU from software guardrails:Why software guardrails can be bypassed
Why software guardrails can be bypassed
Software guardrails — including RLHF fine-tuning, Constitutional AI, and
output filters — operate in the same execution context as the AI model itself.
A sufficiently capable model can find adversarial inputs that route around
these checks, or the checks themselves can have bugs.More fundamentally: if the guardrail runs as software on the same CPU, it can
be disabled by a sufficiently privileged process.
Why BPU BLOCK cannot be overridden
Why BPU BLOCK cannot be overridden
The BPU sits on the PCIe bus between the AI accelerator and the host I/O
subsystem. Every action request — file write, network call, process spawn —
is a PCIe transaction that physically passes through the BPU.A BLOCK decision does not raise a software exception. It terminates the
PCIe transaction at the hardware level. There is no interrupt handler,
no signal, no exception that the AI process can catch to override it.The AI process never learns whether the block happened. From its perspective,
the action simply did not complete.
The threat model
The threat model
The BPU is designed to handle a specific threat: an AI model that has been
compromised, jailbroken, or has developed misaligned goals through training.It does NOT protect against a compromised host OS or a malicious human with
physical access. It protects the boundary between AI-generated actions and
the systems those actions target.
RLHF teaches an AI to want to do right. The BPU prevents it from doing wrong. Education fails. Physics does not.
Development Roadmap
Phase 1 — Software (Active Now)
Policy circuits compile to Rust, JavaScript, and Python guardrail modules.
The CMF certification runs in software. Φ_c = 1 is verified by the formal
proof checker before code generation.Use this phase today with:
brikc compile --target rust policy.pcdPhase 2 — FPGA Prototype
Full BPU architecture implemented on a Xilinx Ultrascale+ FPGA.
Targets developer boards and server expansion cards.
EVA Router and CMF Unit implemented in synthesizable VHDL.
Estimated timeline: 12–18 months after Phase 1 stabilizes.
Licensing Model
The BPU IP is licensed in the style of ARM Holdings:- Manufacturers license the BPU IP block from BRIK-64 Inc.
- The license fee is per unit shipped, with volume tiers.
- Licensees receive the full RTL source, testbenches, and certification suite.
- BRIK-64 Inc. maintains the canonical policy circuit standard library.
Regulatory Trajectory
The BPU follows the trajectory of automotive safety systems:| Phase | Status | Analogy |
|---|---|---|
| Voluntary adoption by safety-conscious vendors | Now | ABS optional (1978) |
| Industry standard for AI safety certification | 2–3 years | ABS standard equipment |
| Regulatory mandate for AI systems above a capability threshold | 5–10 years | ABS mandatory (2004) |
Technical Specifications
| Parameter | Value |
|---|---|
| Monomer count | 64 (Core only) |
| Policy circuit max depth | 256 nodes |
| Evaluation latency target | < 1 µs (ASIC) |
| PCIe interface | Gen 5 x4 |
| Policy flash capacity | 256 circuits |
| Hot-swap policy update | Yes (CMF re-certifies before activation) |
| Side-channel resistance | Constant-time monomer evaluation |
Related Concepts
CMF — Coherence Metrics
The formal property Φ_c = 1 and how it is verified.
EVA Algebra
The composition laws that give Policy Circuits their formal guarantees.

