Large smooth twins from short lattice vectors
Finding the largest pair of consecutive B -smooth integers for a fixed B , also called a B -smooth twin, is computationally challenging. It has only been provably done for $$B \le 100$$ B ≤ 100 and heuristically for $$100 < B \le 113$$ 100 < B ≤ 113 . We improve this by detailing a new algorithm to find such smooth twins based on solving the shortest vector problem (SVP) in a well-constructed lattice. Using an estimate of the largest B -smooth twin that we develop in this work, we are able to significantly increase B and notably report the heuristically largest twin with $$B = 751$$ B = 751 , which has 196 bits. By slightly modifying the lattice, we are able to find even larger twins, but the resulting smoothness bound will not always be optimal. This notably includes a 213-bit twin with $$B = 997$$ B = 997 , which is the largest twin found in this work.
Authors
- Wessel van Woerden (ORCID: https://orcid.org/0000-0002-5565-4015)
- Bruno Sterner (ORCID: https://orcid.org/0009-0008-4153-4005)
- Erik Mulder
Institutions
- École Polytechnique (FR)
- University of Waterloo (CA)
- Centre Inria de Saclay (FR)
- Laboratoire d'Informatique de l'École Polytechnique (FR)
- PQShield (United Kingdom) (GB)
- GRACE: Geometry, arithmetic, algorithms, codes and encryption (FR)
- University of Bergen (NO)
Publication Details
- Journal
- Research in Number Theory
- Published
- 2026-11-21
- DOI
- https://doi.org/10.1007/s40993-026-00821-3
- Primary Topic
- Analytic Number Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Agence Nationale de la Recherche