Deletion-channel reconstruction validation suite

Family 122: Quantitative trace-reconstruction bounds with a uniform decoder. First review, 8 October 2026.

Problem and potential new use

Sequencing and coding researchers can study sample requirements for binary traces and benchmark decoder behavior in modeled regimes.

Applicability and commercial boundary

The arbitrary-string fixed-deletion worst-case lower bound is superpolynomial. Sequencing also includes substitutions, insertions, unknown noise and domain structure.

Initial business decision

Conditional research. Buyer demand and profitability remain hypotheses. This first pass does not establish a validated commercial market.

Next verification action

Separate high-retention polynomial cases from fixed-deletion worst-case cases and inspect a usable decoder.

Evidence scope

Catalog statement reviewed; inspect linked opportunity dossier for any deeper source review. This record alone does not establish full manuscript or proof verification.

Source revision fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb. See source metadata for the exact manuscripts and available scope notes.