integer factorization

A new paper on Hexagon Math proposes a deterministic algorithm for factoring integers in time N^O(1), which would be a landmark result in computational number theory and cryptography, since no deterministic polynomial-time factoring method is known. Readers are discussing the claim and scrutinising the proof for validity.

A benchmark tied to the constant factor K in integer multiplication has reportedly been crossed, with the value now below 0.003, documented in a public code repository. Programmers and algorithm enthusiasts are debating the result, which concerns how efficiently large integers can be multiplied in practice.