Subset sum reconciliation backend

Family 138: Subset Sum in $O(2^{0.49n})$ time. First review, 8 October 2026.

Problem and potential new use

Exact integer search may improve in a constrained reconciliation candidate set if practical crossover can be reached.

Applicability and commercial boundary

The algorithm remains exponential and bounded-error; word size, witness recovery and constant overhead matter.

Initial business decision

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

Next verification action

Map witness recovery and benchmark realistic n and integer sizes against exact references.

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.