How we verify

How we prove the network is correct

Basis Network is blockchain-as-a-service for enterprises. Credentials and connection are delivered in direct onboarding with your team. This page explains the technical substance that justifies the trust: how transactions cross the network without revealing their content, and how every line of the protocol kernel passes through mathematical verification before reaching production.

02 · ZKPs & security

Shared security
without sharing the data.

Each subnet operates its private data sovereignly. When a transaction crosses the subnet boundary —toward another subnet or toward the base layer— it is emitted wrapped in a Zero-Knowledge Proof. Validators across the network verify it mathematically, without accessing its content.

01

Private subnet

Your operation stays inside your subnet

Transactions, contracts and sensitive data live in an isolated environment controlled by your organization. None of your information leaves the boundary.

02

Cryptographic proof

Each transaction crosses the boundary as a ZKP

When a transaction leaves the subnet, it is emitted wrapped in a zero-knowledge proof. The proof demonstrates that the transaction is valid under the system's rules, without transmitting its content.

03

Network verification

The whole network validates without seeing the data

Validators across the network verify each proof mathematically. They confirm that the transaction is valid without knowing its content. The shared security of the network backs every individual transaction; the data stays inside the origin subnet.

03 · Formal rigor

Every line of the kernel goes through mathematical verification.

The Basis Network protocol is developed with the same rigor as aerospace and nuclear systems. Before any code enters the kernel, it goes through a pipeline of four specialized agents that combine iteration speed with formal mathematical proof.

R&D pipeline

Four specialized agents,
one mathematical truth.

Each agent has a narrow responsibility. The "Safety Latch" rule guarantees that no line enters the kernel without going through exhaustive model checking and mathematical proof first.

01

60+

experiments

Scientist

Quantitative research

Generates hypotheses and runs controlled experiments with quantitative evidence before proposing any change to the protocol.

02

1.5B+

states verified

Logicist

Exhaustive model checking

Translates hypotheses into formal TLA+ specifications and verifies every possible trace of the system via TLC.

03

47,500

verified lines

Architect

1:1 implementation with the spec

Implements the verified specifications in production code, keeping one-to-one correspondence with the matching TLA+ specification.

04

18

formal theorems

Prover

Mathematical proofs in Coq

Certifies correctness with formal mathematical proofs in Coq. Refinement between specification, code and safety theorems.

Kernel tests

2,489

Verified units

18

States explored

1.5B+

Verification errors

0

Guarantee levels

Verification pyramid

Four independent layers of guarantee, from unit tests to mathematical theorems.

Level 3

Formal proofs in Coq

Mathematical refinement theorems. Mechanically checked.

18 theorems
Level 2

Model checking in TLA+

Exhaustive exploration of the protocol's state space.

1.5B+ states
Level 1

Adversarial testing

Injection of Byzantine faults, network partitions and malicious nodes.

467 tests
Level 0

Unit & integration tests

Continuous code coverage across all components.

2,489 tests

04 · Resources

To go deeper.