Convergent Local Search Algorithm for Integer Factorization

Description This repository provides the experimental data and reference implementations supporting the paper: “Convergent Local Search Algorithm for Integer Factorization” The materials are intended to ensure full reproducibility of the experimental results reported in the paper, particularly those presented in Section 4 and the Appendix. Contents The archive supplements. zip contains the following files: rungrid. pyReference implementation of the convergent local search algorithm used in the grid-based experiments. This script defines the local move rules, monotone acceptance criterion, and trial execution logic. convergentᵣunpod₃2cpu. pyParallelized execution script optimized for multi-core environments (e. g. , RunPod 32-CPU instances). This version was used to generate large-scale trial statistics under fixed computational budgets. resultsgrid. csvAggregated experimental results in CSV format, including success counts, success rates, average step counts, backtracking statistics, and timing information for each tested configuration. Reproducibility Notes All results reported in the associated paper can be reproduced by executing the provided scripts on standard Python environments. No specialized hardware or quantum devices are required. The experiments rely solely on classical computation and randomized initialization. Parameter settings and experimental regimes correspond directly to those described in the main text and Appendix of the paper. License and Usage The materials are provided for research and verification purposes. Users are free to reuse and adapt the code for academic and experimental use, with appropriate citation of the original work.