Editorial cover for Working with the SDKs Without Leaving the Bounded Model
Back to archive
CMS

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.

2026-02-25T00:00:00.000Z

What Are the SDKs?

The BRIK64 SDKs bring the 64 verified monomers directly into your existing codebase. Instead of writing PCD and compiling, you call monomer functions from your language of choice. Each function carries its formal verification proof — you get the guarantees of Digital Circuitality without leaving your ecosystem.

Three SDKs are shipping today: Rust, JavaScript, and Python. The three languages that matter most.

Installation

Rust

cargo add brik64

JavaScript / TypeScript npm install @brik64/sdk

Python pip install brik64

Code Examples Each SDK provides the exact same monomer functions with identical behavior across all three languages. Call review-scoped operations directly from your Rust, JavaScript, or Python code — arithmetic, hashing, logic, string operations, and more. Every single function carries its mathematical certification, and cross-language reproducibility is not aspirational — it is guaranteed. Bit for bit.

The Monomers

Every SDK exposes the complete monomer set: 64 core operations for 8-bit integer arithmetic and 64 extended operations for floating-point and system interaction. That is 128 building blocks, organized into 8 core families — arithmetic, logic, memory, control flow, I/O, strings, cryptography, and system operations — plus 8 extended families for floating-point math, transcendentals, networking, graphics, audio, filesystem, concurrency, and interop. Everything you need to build verified computation.

And here is what makes this extraordinary: these are the exact same monomers in every SDK, in every language. The behavior is identical. The certifications are identical. A hash("hello") in Rust produces the exact same output as hash("hello") in Python. Not similar. Not approximately the same. Identical. That has never existed before in software.

Deterministic Arithmetic

BRIK64 arithmetic operates on bounded integers with fully defined overflow behavior. Every monomer has a precise, bounded specification — no undefined behaviors, no platform-dependent results. The same operation produces the same output in every language, on every platform. This determinism is what makes formal verification possible: the behavior is fully defined for all possible input combinations.

Mixing SDK Functions with Existing Code

SDKs are designed to integrate into existing projects. You don't need to rewrite your application in PCD. Use BRIK64 monomers for the critical paths — the parts that need to be verified — and keep your existing code for everything else:

// Your existing Express.js server app.post("/transfer", async (req, res) => {
const { from, to, amount } = req.body;
// Use BRIK64 SDK for the critical computation
// Fee calculation, net amount, integrity checksum — all verified
const { net, checksum } = brik64.computeTransfer(from, to, amount);
// Use your existing code for the rest await db.transfer(from, to, net, checksum); res.json({ success: true, net, checksum }); });The BRIK64
functions are verified. Your surrounding code is not. But the critical computation — the fee calculation, the net amount, the integrity checksum — carries a mathematical proof. This is a pragmatic approach: verify what matters, integrate with what exists.

Certification: SDK Functions Carry Their Proof

Every SDK function is backed by a mathematical certification file. When you call add8(200, 100), you are not just calling a function — you are invoking a computation that has been supported by bounded evidence correct within the declared input domain. Every single combination. The proof is not checked at runtime — it was completed at build time of the SDK itself. You inherit the proof simply by using the function. That is the power of review-scoped building blocks.

You can verify this yourself:

BRIK64 CLI verify-sdk rust # Verify Rust SDK proofs BRIK64 CLI verify-sdk js # Verify JavaScript SDK proofs BRIK64 CLI verify-sdk python # Verify Python SDK proofs

When to Use SDK vs PCD Compiler Use SDKs when you want to add review-scoped computations to an existing project without changing anything else, when you need to integrate with existing libraries and frameworks, or when your team already works in Rust, JavaScript, or Python and does not want to learn a new language.

Use PCD compiler when you are building a new application from scratch and want maximum certification, when you want full-program certification (closure check passed for the entire program), or when you need to compile to 14 different targets from a single source.

Use both when you want the best of everything: PCD for core logic with full certification, and SDKs for the integration layers that connect to the real world. The PCD compiler generates SDK-compatible code, and SDK functions can be used inside PCD circuits as review-scoped externals. They are designed to work together.

More reading

Continue the archive

Full archive
Evidence pack folder beside a secure workstation showing software logic blueprints on office monitors.
SOFTWARE EVIDENCESoftware Governance

Software Logic Evidence Infrastructure: The Evidence Layer for AI-Generated Code

AI makes code generation cheap. It does not make software understanding cheap. Software Logic Evidence Infrastructure turns software logic into reviewable, traceable evidence.

Open article
Software logic blueprint with connected monomer nodes, evidence lanes, and registry handoff paths.
Blueprints

What BRIK64 Can Do With Logic Blueprints

BRIK64 creates software logic blueprints for planning, lifting, AI review, migration, CI/CD gates, evidence, agent governance, ownership, and reuse.

Open article
Editorial software engineering review room with abstract blueprint and evidence overlays on dark monitors.
CMS

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.
CMS

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
CMS

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
CMS

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
CMS

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
CMS

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
CMS

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
CMS

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
CMS

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
CMS

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
CMS

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 One Blueprint Across Multiple Targets
CMS

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.

Open article
Engineers reviewing AI generated software behavior with blueprint, topology, and evidence overlays in a dark technical workspace.
CMS

How AI Intuition Becomes Reviewable

How AI intuition can become reviewable through bounded software blueprints, evidence metadata, and independent verification workflows.

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

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
CMS

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
CMS

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
CMS

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
CMS

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
CMS

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?
CMS

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
CMS

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
CMS

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
CMS

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
CMS

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
CMS

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 Why Software Verification Still Looks Different from Hardware
CMS

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
CMS

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
CMS

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
CMS

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
CMS

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
CMS

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
CMS

What Digital Circuitality Tries to Formalize

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

Open article