Golubev Delta Sieve Factoring Method

We introduce a new integer factorization method based on modular arithmetic and structured search. The Golubev Delta Sieve method iterates over arithmetic progressions of the form D = 30n + δ and tests whether m² = D² + 4N yields a perfect square. By precomputing and filtering valid δ values using modular constraints, the method significantly reduces redundant computation and improves factorization efficiency, especially for semiprimes or general composites with moderate gap between factors. The algorithm is simple, parallelizable, and fully deterministic.