![The Recently Proposed O(n Log N) Integer Multiplication Algorithm [Pdf]](https://curiousminds.info/wp-content/uploads/2026/10/the-recently-proposed-o-n-log-n-integer-multiplication-algorithm-pdf-featured.jpg)
TL;DR
Prime made for students and young adults
- Fast, free delivery for dorm and study essentials
- Prime Video and Amazon Music included
- Member-only deals
A research paper by David Harvey and Joris van der Hoeven presents an integer-multiplication algorithm with a claimed complexity of O(n log n) bit operations. The result improves the asymptotic bound for multiplying very large integers; it is a theoretical advance, and the supplied material does not establish practical speedups or a publication status.
David Harvey and Joris van der Hoeven propose an algorithm for multiplying two n-bit integers in O(n log n) bit operations, according to their research paper hosted by the University of New South Wales. The result is a theoretical improvement in the asymptotic cost of a fundamental computation, though the available source material does not establish how quickly the method runs on practical hardware or whether the paper has been peer-reviewed.
The paper’s headline result concerns the number of elementary bit operations needed as the input length grows. In the notation O(n log n), n is the number of bits in the integers being multiplied; the bound describes how computational work scales, rather than giving a run time for a particular machine or input size. The authors present the result as an algorithmic complexity bound, not a benchmark of a software implementation.
The paper is available as a PDF from David Harvey’s UNSW research page. The provided citation identifies Harvey and van der Hoeven as the researchers, but the supplied source excerpt is corrupted and does not provide readable technical details about the algorithm’s construction, its proof, or the conditions under which the bound applies. Those details cannot be independently summarized from the material available here.
The headline matters because multiplication is a basic operation used in arithmetic and in many areas of computing. The result concerns asymptotic complexity: it describes growth at sufficiently large input sizes. It does not, by itself, show that the proposed method is faster than existing implementations for ordinary numbers, nor does the source provide timing comparisons, implementation code, or an estimate of the input sizes where it could become useful.
A Sharper Bound for Large Products
The proposed bound advances a long-running theoretical effort to understand how efficiently integers can be multiplied. A lower asymptotic cost can matter to algorithms that perform many large multiplications, including some methods in computational mathematics and number theory. The paper’s contribution, as described by its title and source, is a statement about what can be achieved in principle as integer length increases.
That distinction between theory and use is central. An O(n log n) result does not specify constants, memory requirements, or the point at which the method overtakes established techniques. Practical performance depends on those factors and on implementation details. The supplied report gives no benchmark results, so it would be premature to infer a change in everyday computing or cryptographic software from the complexity bound alone.
large integer multiplication software
As an affiliate, we earn on qualifying purchases.
As an affiliate, we earn on qualifying purchases.
How the Complexity Claim Fits
Integer multiplication has been studied through a sequence of algorithms with progressively better scaling as the number of digits or bits grows. The familiar school method takes roughly quadratic work in the input length; faster techniques reduce that growth by exploiting structure in the numbers and in polynomial multiplication. The new paper’s stated O(n log n) bound places its claim among advances aimed at the very-large-input regime.
Complexity notation suppresses implementation-specific details. A bound such as O(n log n) describes an upper limit on growth up to constant factors; it does not state an exact count of operations, and it does not identify a practical crossover point. The source supplied for this report is a link to the paper rather than an independently documented review, so claims about the proof’s reception, publication venue, or adoption are not confirmed here.
high precision arithmetic calculator
As an affiliate, we earn on qualifying purchases.
As an affiliate, we earn on qualifying purchases.
Proof and Practical Status
The supplied source does not state whether the paper has been peer-reviewed, accepted by a journal, or formally published. It also does not provide enough readable technical content to assess the proof, assumptions, or precise model of computation behind the bound. Those matters should not be treated as settled based solely on the provided link and title.
Practical questions remain open in the material available: no implementation, benchmark, memory analysis, or comparison with established multiplication software is supplied. The claimed asymptotic bound is not the same as evidence of faster performance at any particular scale. The source also gives no clear date for the proposal, so its timing and subsequent development cannot be pinned down from the material provided.
As an affiliate, we earn on qualifying purchases.
Publication and Implementation Milestones
The next useful developments to track are the paper’s publication and review status, independent examination of its proof, and any technical follow-up from the authors or other researchers. If implementations or benchmarks are later reported, they could clarify how the theoretical method compares with existing approaches across different input sizes.
Until those details are documented, the confirmed report is limited to the paper’s stated O(n log n) integer-multiplication result. The source supplied does not identify a release schedule, review milestone, or implementation plan.
cryptography large number calculator
As an affiliate, we earn on qualifying purchases.
As an affiliate, we earn on qualifying purchases.
Key Questions
What does O(n log n) mean here?
It describes how the algorithm’s operation count scales with n, the number of bits in the input integers. It is an asymptotic bound, not a specific run time.
Does this mean multiplication will be faster on ordinary computers now?
Not based on the supplied material. It reports a theoretical complexity result but provides no implementation or benchmark showing faster performance at practical input sizes.
Who proposed the algorithm?
The paper is attributed to David Harvey and Joris van der Hoeven and is hosted on Harvey’s University of New South Wales research page.
Has the paper been peer-reviewed?
The supplied source does not state its review or publication status, so that remains unconfirmed here.
What should readers watch for next?
Relevant follow-up would include publication information, independent technical scrutiny, and any implementation or benchmark data that tests practical performance.
Source: hn
Fall Picks
fall essentials
As an affiliate, we earn on qualifying purchases.
