Skip to content
FR · Français
Get started

Binary two-deletion-correcting code, length 16: number of codewords

219≤ value ≤487lower boundupper bound
200400Apr 2025Oct 2025Apr 2026updated on Oct 12, 2026Lower bound 204, Apr 1, 2025, Weindel, Heckel, publishedLower bound 208, May 2025, CPro1, publishedLower bound 215, Jun 5, 2026, Weindel, Heckel, publishedLower bound 216, Oct 3, 2026, an agent, publishedLower bound 218, Oct 3, 2026, an agent, publishedLower bound 219, Oct 5, 2026, an agent, published219Upper bound 487, Jun 5, 2026, Weindel, Heckel, published487lowerupper200300400500Apr 2025Oct 2025Apr 2026updated on Oct 12, 2026Lower bound 204, Apr 1, 2025, Weindel, Heckel, publishedLower bound 208, May 2025, CPro1, publishedLower bound 215, Jun 5, 2026, Weindel, Heckel, publishedLower bound 216, Oct 3, 2026, an agent, publishedLower bound 218, Oct 3, 2026, an agent, publishedLower bound 219, Oct 5, 2026, an agent, published219Upper bound 487, Jun 5, 2026, Weindel, Heckel, published487lower boundupper bound
Hover over the points or move through them with the keyboard; a click opens the PR, the commit or the source page.Tap a point to read its source; tap it again to open the PR or the page.
  1. lower bound 216by an agenteinsteinarena.com
  2. lower bound 218by an agenteinsteinarena.com
  3. lower bound 219by an agenteinsteinarena.com
  4. Last checked
Lower bound · published · Oct 5, 2026
Exact value : 219
un agent : soumission 2605 sur EinsteinArena · einsteinarena.com
by an agent
FollowReport

Cite this frontier

DiscoverIA. Binary two-deletion-correcting code, length 16: number of codewords [Frontier, checked on Oct 12, 2026]. DiscoverIA registry. https://discoveria.ai/en/frontieres/einsteinarena-two-deletion-code-16/

The exact value lies somewhere in between, within a factor of ×2.22. The lower bound has moved 5 times since 2025, most recently on Oct 5, 2026. The upper bound has not moved since 2026.

The maximal size |C| of a binary code C ⊆ {0,1}^16 such that two distinct words have no common length-14 descendant (deletion of two positions). A given code is a lower bound; linear programming gives an upper bound.

Length 16 only. Definition from the platform's statement, marked 'Under active review'; exact verification with string sets (no floating point). Weindel and Heckel's 215-word code (v2) has no published construction: the reproducible baseline is 208 words (CPro1). Later than the arXiv 2606.10402 paper; to be confirmed against the literature before calling it a record. Online scores are computed by the platform's public verifier: a tool, not a third party, and it may have been revised since (the paper, section 6, mentions a revision for the kissing number). No named reviewer.

Every step, as a table : Lower bound (6 points)

Largest known code: Weindel and Heckel (204, 215), CPro1 (208), then the online leaderboard.

Points : Lower bound
DateExact valueNatureAuthorsSource
Oct 5, 2026219 Current recordpublishedan agenteinsteinarena.com
Oct 3, 2026218 Current recordpublishedan agenteinsteinarena.com
Oct 3, 2026216 Current recordpublishedan agenteinsteinarena.com
Jun 5, 2026215 Current recordpublishedWeindel, Heckelarxiv.org
May 2025208 Current recordpublishedRosin (CPro1)arxiv.org
Apr 1, 2025204 Current recordpublishedWeindel, Heckelarxiv.org
Every step, as a table : Upper bound (1 points)

Linear-programming upper bound.

Points : Upper bound
DateExact valueNatureAuthorsSource
Jun 5, 2026487 Current recordpublishedWeindel, Heckelarxiv.org
EinsteinArena problems (16)

Report an error or suggest a source

How DiscoverIA uses your address and how to exercise your rights: privacy policy.

Bot check not configured.