Mona Lisa Challenge initializing engine…

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—
Connecting to server…
Track
Fig. 1. Live specimen. Island-model evolution searching 50 polygons in this tab against the verified MLC-1 target.
target256 × 384
best so far0 evals
MLC-1 · CF-0050 · local LIVE
Mona Lisa, in 50 polygons
50 translucent polygons · MLC-1 integer renderer · 256 × 384
Provenance: local search in this browser SSE —
polygons, N
50
error (RMSE)
—
evals / s
—
accepted
0

Error over time log t

Evaluations per second last 30 s

Mutation operators selection weight

Specimen N
Fig. 2. The Mona Lisa Frontier. Verified record error vs. polygon count N on the Classic Full track. Hover, click, or use arrow keys to inspect a record.
connecting…

monotone envelope verified record at N this tab, live
RMSE per RGB channel (0–255), derived from exact MLC-1 integer SSE.
Fig. 3

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.

Fig. 4

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.

0 verified entries on Classic Full
§ 2

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.

Submit improvements to server Connecting…

Duty cycle of the search worker from 0 to 100 percent.

Compute engine detecting…
anonymous
Work assignment targeted
  • 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.
Table 1. Recently verified records, newest first. Click a row to inspect.
waiting…
When Track N RMSE Accession Holder
§ 3

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. 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. 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. 3

    Score

    Exact 64-bit sum of squared channel differences against the SHA-256 verified target pixels. Lower is better.

    S = Σ (I − T)²
  4. 4

    Verify

    When a candidate improves on the work unit, the server re-renders it with mlc-core and confirms exact equality.

    S_server == S_client
  5. 5

    Record

    A verified new minimum is accessioned by its canonical SHA-256 ID and broadcast live to every searching tab.

    S*(N) ← S