Certified superstring packaging library

Family 128: A factor-two approximation for shortest common superstring. First review, 8 October 2026.

Problem and potential new use

Literal-data pipelines can compact overlapping strings while retaining a two-factor symbol-length guarantee.

Applicability and commercial boundary

The result covers the constructed algorithm, not classical greedy, and symbol length differs from compressed-byte cost.

Initial business decision

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

Next verification action

Extract the specified algorithm and benchmark complete packaged outputs against compression baselines.

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.