ddidderr
e36cecd2d3
Replace the range scan and trial division with a search over prime exponent vectors. Highly composite records only need candidates whose exponents are non-increasing across ascending primes, so the program can compute divisor counts directly while pruning branches above the search limit. Remove the sieve module because the new search no longer factors each number. This makes the current one-billion limit finish in microseconds after startup instead of scanning hundreds of millions of inputs. Test Plan: - cargo clippy - cargo clippy --benches - cargo clippy --tests - cargo test Refs: N/A