Menu
← FIELD NOTES
TAGGEDZKML 9 POSTS

Posts about ZKML.

2026.09.12 ZKML

You cannot check that someone trained a model by replaying their checkpoints.

Checkpoint-replay verification of a training run is not merely buggy: making it provably robust reduces to open problems in learning theory, and spoofing already forges valid logs cheaply. The only floor that does not rest on unsolved theory is a zero-knowledge proof of training.

2026.08.25 ZKML

Proving your model ran is a different cryptographic object than proving you trained it.

A proof of inference certifies an output came from a committed model. It says nothing about how the weights came to be. Proving the training run is a separate, far heavier object — and it is the one compliance actually asks for.

2026.08.09 ZKML

In zkML the matrix multiplies are basically free - it is the ReLU and softmax that cost you.

Intuition says the FLOP-heavy matmuls dominate a zkML proof. Multiple 2024-2026 systems show the opposite: linear layers are cheaper to prove than to compute, and the bill is set by activations multiplied by their bit-width.

2026.07.22 ZKML

Your zkML proof is slow because of the part that has nothing to do with the model.

On real networks the dominant zkML prover cost is not the matmuls or the activations. It is the consistency check binding the proof to the committed weights — an overhead that grows past 90% of prover time and that the single benchmark number hides.

2026.06.22 ZKML

zkML's real first customers: compliance and fraud proofs.

Pricing a zero-knowledge proof of an LLM gives an absurd number, and teams conclude zkML is not ready. They are pricing the wrong model. For small fixed models on high-stakes decisions, zkML already pays for itself today.

2026.05.16 ZKML

The first proven LLM: what DeepProve changes for zkML.

DeepProve, from Lagrange, produced the first zero-knowledge proof of a full LLM inference — GPT-2. It moves "prove a transformer" from impossible to merely expensive. What that unlocks, and what is still years away.

2026.05.16 ZKML

opML or zkML: a decision tree for verifiable inference.

Two ways to make an off-chain model output trustworthy on-chain. zkML is cryptographic, expensive, and small-model-only. opML is optimistic, cheap, and runs Llama-2-scale models today. Choosing by stakes, model size, and latency.

2026.03.22 ZKML

Five zkML libraries, benchmarked. Only one ships today.

EZKL, Modulus, Giza, Ora, RISC Zero. Same model, same input, same target chain. Proof times, gas costs, gotchas — and the one we'd put in front of a customer.

2026.03.17 ZKML

Folding schemes for zkML, explained without the cryptography.

zkML cannot scale to large models because proving a whole computation in one shot is ruinously expensive. Folding schemes — Nova and its lineage — prove a long, repetitive computation step by step instead. Explained without the cryptography.

NEW ENGAGEMENT · INTAKE

Tell us about it.

The more specific you are, the more useful our first reply.

SERVICE AREA
↩ ENCRYPTED IN TRANSIT
ASK THE FIELD NOTES BETA