An MSTD set, short for "more sums than differences set," is a finite set
of integers satisfying
,
where
and
.
It is also called sum-dominant (Martin and O'Bryant 2007). For example,
has 26 distinct sums and 25 distinct
differences. A positive proportion of all subsets of
are MSTD (Martin and O'Bryant
2007); this is a counting statement distinct from an explicit construction of a large
indexed family.
For every fixed positive integer ,
Khan (2026) constructs a family of MSTD subsets of
of size
where denotes the
-fold iterated logarithm,
and the constants and sufficiently large threshold for
may depend on
. A subfamily of the same order
can be indexed so that a chosen member is generated deterministically in
bit operations, without listing earlier members. A
separate variant, using exhaustive search over
short fringe pairs, attains
members with the same
per-member generation bound. This does not assert that the entire exponentially large
family can be listed in polynomial time. Khan
(2026) reports that ChatGPT suggested varying the fringe sets and assisted with the
indexed-generation algorithm.