Established constructive lower bound

E3(12,8) ≥ 12

This establishes a new constructive lower bound. It does not determine the exact value of E3(12,8).

On November 16, 2026, Theresa Rainaldi of Velorin Intelligence submitted a computationally discovered construction improving the lower bound then listed for the ternary edit-code parameter E3(12,8) from 11 to 12.

The construction contains 12 distinct ternary words of length 12. Every pair has unit-cost Levenshtein distance at least 8, where insertion, deletion, and substitution each have cost one.

Abraham Yeung independently reconstructed and checked the construction using five independently implemented verification methods. All 66 unordered pairs satisfied the required minimum. He accepted the improvement, credited Theresa Rainaldi of Velorin Intelligence, and updated his independently maintained public bounds table.

Mathematical construction

The code is generated from four base words:

000002222211
000111111222
002120201010
022222002222

Each generator produces two additional words through cyclic alphabet relabeling: 0 → 1 → 2 → 0. The four three-word orbits yield 12 codewords in total.

Independent verification

The submitted certificate was independently reconstructed rather than accepted from the discovery output alone. The verified record establishes:

  • 12 distinct words over the ternary alphabet, each of length 12.
  • 66 unordered pairs checked independently.
  • Minimum pairwise unit-cost Levenshtein distance 8.
  • Independent verification by Abraham Yeung using five distinct implementations.
  • Confirmation that the construction establishes E3(12,8) ≥ 12.
Distance 8
57 pairs
Distance 9
3 pairs
Distance 10
3 pairs
Distance 11
3 pairs

Independent verification is not described here as formal journal peer review. It is an external reconstruction and multi-method verification of the explicit mathematical certificate.

Research Record & Reproducibility

Permanent archival publication
doi.org/10.5281/zenodo.24295682 ↗
Versioned research release
Release v1.0.1 ↗
Independent verification and bounds table
Abraham Yeung’s maintained edit-code bounds table ↗

How to Cite

Rainaldi, T. (2026). Verified ternary edit code E3(12,8) ≥ 12 (Version 1.0.1) [Software]. Zenodo. https://doi.org/10.5281/zenodo.24295682

Reproducibility boundary

The archived release includes the explicit 12-word construction, certificate materials, technical note, and verification code. Those materials make the final mathematical certificate reproducible.

The original AI-assisted discovery-search source and logs are not included. The complete discovery pipeline is therefore not claimed to be reproducible.