MLC-1 · OPEN DISTRIBUTED RECORD
Mona Lisa in 50 polygons
A standing world record for every polygon count N from 1 to 1,000. Your browser searches using the bit-exact MLC-1 integer renderer; whenever it beats the record, the server re-renders and re-scores the polygons before accessioning the new best.
| Frontier records (track) | — |
| Records set, last 24 h | — |
| Contributors, last 24 h | — |
| Browsers online now | — |
| Evaluations, last 24 h | — |
- polygons, N
- 50
- error (RMSE)
- —
- evals / s
- —
- accepted
- 0
Error over time log t
Evaluations per second last 30 s
Mutation operators selection weight
0 records yet — searching to set the first
Your browser's live search is plotted in ink-blue. Once verified by the server, records appear along the curve.
- RMSE
- —
- SSE score
- —
- Holder
- —
- Verified
- —
Every record descends from worse ones
Each plate below is an exact MLC-1 render of an ancestor of the live specimen in Fig. 1, captured as improvements accumulate. Inspect any verified record on the Frontier to trace its server-verified lineage.
How models see Mona Lisa
Every AI drawing below is verified bit-exact by mlc-core under the same MLC-1 integer rendering rules as human and browser records.
Compare single-shot sketches, visual feedback loops, and agent runs against the standing Frontier—or adopt any model sketch as the starting seed for live browser evolution.
Get a prompt for your LLM or agent
local templatePaste into Gemini, Claude, or ChatGPT web UI to generate MLC-1 JSON in one turn.
Paste, preview & submit
- Polygons (N)
- —
- Exact RMSE
- —
- Exact SSE
- —
- vs. Frontier
- —
Lend this browser to the search
Search runs in a background worker using CPU or WebGPU and pauses automatically when this tab is hidden. Tune the compute budget, pick a target N or let the coordinator assign one, and optionally add a nickname for the register.
Duty cycle of the search worker from 0 to 100 percent.
- Pauses automatically and closes the live stream whenever this tab is hidden.
- Sends only verified MLC-1 polygon improvements; the server re-renders and checks every score.
- No account required. Your anonymous client ID stays in local storage.
| When | Track | N | RMSE | Accession | Holder |
|---|
How a record is made
Every browser runs an island-model evolutionary search with self-tuning mutation rates. Rendering is strictly defined in 32-bit integer arithmetic by MLC-1, so CPU, WebGPU, and the Rust server agree to the last bit.
-
1
Mutate
Perturb a vertex in 1/16 px fixed-point, shift color or alpha, refine/coarsen vertices, swap order, or replace a polygon.
x, y ∈ [0, 16W] ∩ ℤ -
2
Render
4×4 supersampled even-odd integer rasterization composited back-to-front over an opaque RGB background.
⌊(old·(4080−w)+c·w+2040)/4080⌋ -
3
Score
Exact 64-bit sum of squared channel differences against the SHA-256 verified target pixels. Lower is better.
S = Σ (I − T)² -
4
Verify
When a candidate improves on the work unit, the server re-renders it with
mlc-coreand confirms exact equality.S_server == S_client -
5
Record
A verified new minimum is accessioned by its canonical SHA-256 ID and broadcast live to every searching tab.
S*(N) ← S