Proof of Useful WorkVerified Compute

Bitcoin mines hashes. Vearl mines AI.

Vearl keeps the security of proof of work, but miners earn it by running AI models for real clients. Every answer is proven correct before anyone gets paid.

Public testnet live since 23 October 2026

Founder · Clovis AnicetRustCUDANIST FIPS 205

Bitcoin's network draws as much power as a mid‑sized country, to compute hashes that nobody will ever read. Vearl points that power at work people actually need.

Mining powerruns AI models
Every answeris proven before payment
A cheating minerloses its bond
Vearl in 30 seconds. A silent film; click or tap to pause. The 3D scenes in it are illustrations (the testnet's rendering kernel draws simpler scenes today). The Monte Carlo sample is real kernel output.
01Protocol

Same hardware, same energy. A result at the end.

In a classic proof of work, miners compute billions of hashes whose only purpose is to be hard to find. Vearl keeps the security model and changes what gets computed: every block is mined from a matrix product, and that product can belong to a paying client.

Classic proof of workBitcoin-style mining
InputElectricity
WorkSHA-256 hashes
OutputBlock
×The hashes are thrown away once the block is found.
VearlProof of Useful WorkVerified Compute
InputElectricity
Workint8 matrix product
OutputBlock
OutputClient result
✓The same computation secures the chain and answers a client, who checks it before paying.

Integer arithmetic is deliberate: every node reproduces a result bit for bit, which is what makes cheap verification and one-operation fraud proofs possible.

02Workloads

Running on the testnet today.

Every figure below was measured on the testnet, on a single NVIDIA A10 GPU, with each result checked before payment (the 0.6-billion-parameter model: on a CPU worker of a local chain). Nothing here is a projection.

WorkloadModelSizeMeasured
AText generation TinyStories-33M language model, 4 layers, 50,257-word vocabulary 307 ops · 2 jobs per word Writes stories word by word: 8 stories in parallel, ≈ 18 s per word, 92.9% same next word as the original model
BPhoto recognition DeiT-Tiny vision transformer, 224 × 224 photos, 1,000 ImageNet classes 386 ops · 2 chained jobs ≈ 1.7 s per photo, 70.6% top-1 on photos never seen in training (original model: 78.2%)
CSemantic search embeddings BGE-base, 12 layers, 110 million parameters 492 ops · 3 chained jobs ≈ 3.3 s per text, 96.7% of the original model's score on STS-B (0.836 vs 0.864)
DFast sentence embeddings all-MiniLM-L6-v2, 6 layers, 12 attention heads 195 ops · 61 GEMMs ≈ 1.0 s per text, cosine similarity 0.92 with the original model
ESmall-image classification ResNet-20 on CIFAR-10 76 ops · 22 GEMMs 88.6% top-1 accuracy, 32 images in 41 s
FLarge text embeddings Qwen3-Embedding-0.6B, 28 layers, 0.6 billion parameters 2,195 ops · 10 chained jobs ≈ 50 s per text on a CPU worker (local chain), outputs bit-identical to an independent reference engine; cosine 0.77 with the original model, same-topic nearest neighbour 85% (original: 90%)
GMatrix multiplication Tiled int8 GEMM 8192 × 8192 × 8192 1.1 trillion operations, verified end to end in about 11 s
HHandwritten digits MLP and CNN on MNIST 10,000 test images 98.1% top-1 accuracy in int8
IBulk embeddings Distilled text encoder 20,480 texts Outputs bit-identical to an independent reference engine
JYour own model PyTorch or ONNX import 240 ops per job, chainable Convolutions, attention, LayerNorm, softmax, GELU, residual blocks

Models are quantized to 8-bit integers so that every node computes exactly the same bits. Accuracy figures compare the integer model with its original floating-point version on held-out data. These models are a first generation: they will be considerably improved, with larger and more accurate models, faster jobs and longer texts.

A ceramic vase of pastel flowers, rendered in 3D, with the words Beautiful by the batch
Beyond AI: 3D rendering and simulation. Frames are split into small tiles rendered by GPU miners, and the client re-computes tiles at random to check them. Illustration: the rendering kernel of the testnet draws simpler scenes today.
Twelve 3D renders: a perfume bottle, a watch, a cocktail, a chess set, a knight, crystals, a floating island, a starship, a coffee cup, a mushroom diorama, headphones and a game controller
Products, games, worlds. Twelve scenes of the kind a studio could send to the network: packshots, game characters and environments. Illustration: rendered with our own path tracer on a single GPU, not yet by the testnet kernel.
03Verification

Nobody trusts the miner. Anyone can check.

Redoing a computation costs as much as the computation itself. Freivalds' test checks a matrix product with a few matrix-vector products instead, and a single wrong entry is enough to prove fraud.

  1. The client submits a job

    The input and the Merkle roots of the model weights go on chain, together with an escrow that will pay the miner.

  2. A miner runs it on a GPU

    It executes every operation, publishes a commitment to each result, and mines blocks from those same matrix products.

  3. The client verifies

    Freivalds' test for every matrix product, exact recomputation for everything else. Seconds, not the cost of the original job.

  4. Payment or penalty

    All correct: the escrow is released. One wrong operation: a fraud proof covering that operation alone is enough, and the miner loses its bond.

Live illustration on 6 × 6 matrices. One job in three, the miner alters a single cell.

04Security

Standard cryptography, independently cross‑checked.

No homemade primitives. Each component follows a public standard or a well-known reference, and is tested against a second implementation written separately from the specification.

Signatures

Post-quantum accounts

SLH-DSA-SHAKE-128s (NIST FIPS 205) alongside Ed25519, checked against an independent implementation of the standard.

Live on testnet
Difficulty

ASERT (aserti3-2d)

Continuous difficulty adjustment, validated against the 29 official reference vectors.

Live on testnet
Reorganizations

Atomic reorgs, optional MESS

State snapshots with exact rollback, plus an optional brake on deep reorganizations using ECIP‑1100 parameters.

Live on testnet
Light clients

Header, tile and balance proofs

Verify the chain and an account balance without downloading blocks or job data.

Live on testnet
Peer transport

Noise XX over X25519

Encrypted and authenticated, but still classical. A post-quantum handshake is not implemented yet.

Open item
Review

External security audit

17 independent checks and differential fuzzers run on every change. No third-party audit has been done yet.

Planned
05Status

Where the project stands.

Vearl is in development. Its first public testnet has been live since 23 October 2026. Testnet tokens have no value. We publish what works, with measurements, and what does not work yet.

171

automated tests, all passing

17/17

independent checks in the internal audit suite

616

conformance blocks shared between implementations

0

external audits so far

  1. Done

    Closed testnet

    Chain, compute market, verified inference and embeddings, measured on rented GPU servers.

  2. 23 October 2026

    Testnet 1 · live now

    The first public testnet, open since 16:00 UTC: external miners, mining pools, a block explorer and a faucet. Miners who help secure it receive Vearl tokens on mainnet: the team commits 7 % of the maximum mainnet supply to the contributors of five public testnets (this first one: 0.7 %).

  3. Planned

    Testnet 2

    The second of the five public testnets. Date to be announced.

  4. Planned

    Testnet 3

    The third of the five public testnets. Date to be announced.

  5. Planned

    Testnet 4

    The fourth of the five public testnets. Date to be announced.

  6. Planned

    Testnet 5

    The fifth and last of the five public testnets. Date to be announced.

  7. Next

    External audit

    Third-party review of the cryptography, the consensus rules and the fraud proofs.

  8. Research

    Considerably better models

    Larger and more accurate models: per-channel quantization, several sequences per job, an on-chain model registry.

06FAQ

Straight answers.

The questions people ask first, answered without marketing.

Is Vearl live?

As a testnet, yes. The first public testnet has been live since 23 October 2026, 16:00 UTC: external miners and developers can join it (see How to take part), and every block can be looked at in the explorer. It follows a closed testnet measured on rented GPU servers, and it is the first of five public testnets. Miners who help secure the public testnets receive Vearl tokens on mainnet as a thank-you: the team commits 7 % of the maximum mainnet supply to the contributors of five public testnets (this first one: 0.7 %), shared in proportion to points under the published rules. There is no mainnet date yet, and no price or value is promised: testnet tokens themselves have no value.

Who is behind Vearl?

Vearl is created by its founder, Clovis Anicet, who is named publicly: the project is not anonymous. Vearl is a separate project with its own code: it is not an official Pearl project and Pearl has not endorsed it. You can write to contact [at] vearl.org. A name alone proves nothing, so the site also publishes the measurements, the limits and what is not solved yet, which anyone can check.

Do testnet tokens have any value?

No. Testnet tokens exist only for testing. They have no monetary value and are not for sale.

What hardware do I need to mine?

GPU mining needs an NVIDIA card with compute capability 8.0 or newer: Ampere and later, for example the RTX 30 and 40 series, A10, A100 or H100. Older cards are refused by the node. CPU mining works for testing.

How is this different from Bitcoin?

The security principle is the same: producing a block costs real computation. What changes is the computation itself. Bitcoin miners compute SHA-256 hashes; Vearl miners compute integer matrix products, which can carry useful work for clients.

Can it run large language models?

Small ones, not large ones. The testnet runs a 33-million-parameter language model (TinyStories) that writes short stories word by word, every step verified before payment, a 110-million-parameter text encoder and, in ten chained jobs, a 0.6-billion-parameter text-embedding model (Qwen3-Embedding-0.6B). A job holds up to 240 operations on 1024 × 1024 tensors and jobs chain together, which reaches models of up to about 0.6 billion parameters today. Models with several billions of parameters are out of reach for now, and text is limited to 64 tokens (127 for the large embedding model).

Has the code been audited?

Not by a third party yet. Internally, 17 independent checks and differential fuzzers compare the Rust node with separate Python implementations written from the specification, on every change.

Public testnet · live since 23 October 2026

Your GPU could be doing something useful.

The public testnet is open to miners and developers. Miners who help secure the network receive Vearl tokens on mainnet as a thank-you: the team commits 7 % of the maximum mainnet supply to the contributors of five public testnets (this first one: 0.7 %). Everything it does is documented above, with the numbers behind it.

Questions, press or partnerships: contact [at] vearl.org

Public testnet · 23 October 2026, 16:00 UTC · Music: “Stampede”, Genesis Owusu