MLabChain Mera
Mera v0.3.0-dev1 · Devnet live

A ledger that pays for verified machine work.

MLabChain records machine-learning training runs as signed, replayable transactions and issues a native unit called Mera for the submissions that measurably improve a pinned scientific baseline. Deterministic work is paid. Everything else is provenance.

100 M
Max supply
50
Per-proof cap
8
Decimals
Scroll
01 — The idea

Bitcoin burns hashes.
MLabChain pays for results.

Bitcoin's work is a hash with leading zeros. It is deliberately empty: nobody wants the hash, so nobody produces it except to mine. That property makes it trustless and makes it burn energy on nothing at all.

MLabChain replaces the empty work with a bounded class of deterministic machine-learning training. A challenge pins the dataset, the split, the metric, and the baseline. A submission commits the model, the architecture, the training parameters, and the resulting metrics. The chain pays only when the model measurably improves the pinned baseline.

The consequence is the one that matters. Verification is re-execution. That makes MLabChain honest as a scientific ledger and unsuitable as a security mechanism. The project states both, in every document, on every page.

Useful work and cheap verification are opposites. MLabChain picks useful work.
REC 00:00:00:00 MLC // MERA // LIVE RENDER
● LIVE CH / ML-WORK
FRAME 000 hash —
Frames rendered on the fly. No video file. Pure canvas. Training · loss descent · merkle folding
02 — How it works

Five stages from a challenge
to a sealed block.

Scientific work and chain security are two separate mechanisms. Bitcoin-style PoW seals blocks. ML_WORK transactions are the scientific contribution, and they mint Mera.

Scientific work
Consensus work
Reward
A — Scientific work

Deterministic training

The Python client trains against the challenge, writes model.pkl, model.txt, and a proof.json artifact, then builds a signed ML_WORK transaction.

B — Consensus work

Replay and fork choice

The C++ core re-executes every transaction from genesis, checks signatures and nonces, compares cumulative chain work, and replaces canonical state only when a candidate chain wins.

C — Reward

Marginal, capped

Reward is measured against the challenge's current best quality, not the original baseline. The first submission earns the full delta. Later submissions earn only the additional gain.

D — Sealing

Signed block proposal

A producer builds a block template, signs the proposal with Ed25519, grinds a SHA-256 nonce to the current target, and commits. Nodes accept when cumulative work beats the local tip.

03 — The unit

Mera is issued only for
marginal improvement.

Mera

Mera

A native ledger unit issued only when a submission improves a pinned challenge frontier. Transferable on the chain, capped at 100 million, and enforced in integer arithmetic by the C++ state engine.

Asset
MERA
Decimals
8
Max supply
100,000,000
Per-proof cap
50 MERA
Min transfer fee
0.0001 MERA
Min ML-work fee
0.001 MERA
Fees
burned
Verifier
MLabChain-linear-v4
Reward arithmetic integer only
Quality clamp( (baseline − model) × 1e6 / baseline, 0, 1e6 ) ppm
Delta quality_ppm − challenge.best_quality_ppm 0
Reward min( cap, ops × delta_q × 1e8 / (1e7 × 1e6) ) 0
Budget reward ≤ challenge.budget_remaining finite
Supply total_supply + reward ≤ 100,000,000 MERA cap
04 — Honest boundary

What v0.3 pays for.
What v0.3 does not claim.

What v0.3 pays for

  • Deterministic linear regression against a pinned challenge.
  • Registered, budgeted, maturity-delayed challenges.
  • Marginal rewards vs the current best accepted quality.
  • Signed transfers, nonces, multisig, key rotation.
  • Fork choice by cumulative work, with reorg and replay.
  • Signed block proposals and adaptive SHA-256 PoW.
  • A small TCP P2P layer with sync and relay.
  • Scrypt + AES-GCM encrypted wallets.

What v0.3 does not claim

  • That a model hash proves a training procedure ran.
  • That verification is cheaper than re-execution.
  • That GPU, PyTorch, JAX, or stochastic training are consensus-valid.
  • That the P2P layer resists an Internet-scale adversary.
  • That the ERC-20 contract is a trustless bridge.
  • That Mera has a price, a market, or a future listing.
  • That Sybil resistance exists beyond PoW and challenge bonds.
  • That the reference node is an audited mainnet.

Four open problems, deliberately deferred

General ML proofs. A model hash is a commitment, not a proof. Deterministic re-execution is the only sound verifier, and it only works for verifier classes the node implements.

Stochastic and GPU training. Not consensus-valid. Can be recorded as provenance, cannot be paid.

Permissionless P2P hardening. Peer discovery, anti-eclipse, connection quotas, fuzzing, formal message limits.

Trustless L1↔EVM bridge. Requires a proof or attestation protocol and audited contracts. Not in this release.

Read the blockchain primer →  ·  Proof-of-Scientific-Work explained →

05 — Quick start

Build. Init. Train. Seal.

Python 3.10+, a C++17 compiler, CMake, OpenSSL, SQLite3, and Boost headers. The core builds into a single executable called mera_core.

mera — devnet session
Build

Native core

./build.sh        # linux / macOS
./build.ps1       # windows
ctest --test-dir build
pytest
P2P

Two nodes, one chain

mera_core node --port 19001
mera_core node --port 19002 \
  --peers 127.0.0.1:19001

mlabchain.py sync --peer 127.0.0.1:19001
06 — Status

Where v0.3 stands.

Native chaindevnet
Paid ML verifierlinear
P2P networkreference
EVM representationtemplate
Mainnet readinessaudit pending
MLabChain v0.3.0 and Mera v3
07 — About

Made by Digital Hana Arts,
supervised by a kitten.

MLabChain is developed and maintained by Digital Hana Arts. The project builds small, honest, research-grade tools in the intersection of machine learning, scientific reproducibility, and distributed systems.

Digital Hana Arts
Digital Hana Arts
Maintainer
Hana

Hana

Hana is a kitten. She is the official mascot and reminds everyone that a ledger is only as useful as the analysis it makes reproducible. She does not sign transactions. She has no opinion on PoW difficulty. She considers the 60-second target block time generous.