The recently proposed o(n log n) integer multiplication algorithm [pdf]
Posted by craigcitro 8 hours ago
Comments
Comment by jdb1729 7 hours ago
The result is fully formalized in Lean by @platypii and myself (on Mathlib's TM2 machine), with ongoing improvements to the exponent (currently at 1-2^-14.38): https://github.com/platypii/integer-mult-bounds-lean
Contributions are welcome!
Comment by marwahaha 2 hours ago
Comment by mariofdistrust 7 minutes ago
Comment by ironborn123 1 hour ago
I conjecture the true growth rate is O(n(log(n))^(1-f(n))) where f(n) is a slowly increasing function of n.
So larger the integers, more efficient the multiplication gets.
AIs of the world, make this your target, and have centuries worth of fun!!
Comment by sebzim4500 1 hour ago
Comment by ironborn123 57 minutes ago
Comment by Kapura 7 hours ago
this does not feel like a healthy place to be
Comment by flockonus 5 hours ago
Suppose we have a very convincing math PhD impersonator, agreeing and making some prepared smart-sounding comments saying they understood the proof and it seems to make sense - would it?
Well, most would say - NO! Obviously not, knowing this person was an impersonator. Others now knowing could be convinced of the validity.
Very simple thought exercise that allows to conclude, someone "saying they understood" (or agree) bears absolutely no weight to something's validity.
Comment by bamb008 4 hours ago
But perhaps mathematicians are no longer able to be the best judge if a proof is valid. Yet nobody but them is able to even understand what is claimed to have been resolved.
It is really strange to see mathematicians of the highest rank taking these results seriously[3], holding lectures explaining them, yet see it dismissed here as a mass psychosis. [1]https://smf.emath.fr/actualites-smf/20-10-26-communique-sur-... [2]https://www.mathsoc.jp/publicity/news20261016.html [3]https://terrytao.wordpress.com/2026/10/19/a-sketch-of-the-pr...
Comment by miksuko 4 hours ago
Few articles on vixra are made by companies with ~$1T valuations.
Comment by p-e-w 5 hours ago
I think that would change the conclusion of the argument a little.
Comment by soVeryTired 5 hours ago
With no humans able to understand the proofs the impersonator has produced, there's no way of knowing.
Comment by mrob 2 hours ago
It's highly implausible that the same bug is present in all of them.
Comment by pera 35 minutes ago
I don't know how much was created by LLMs but can you still call these independent implementations?
Comment by stouset 4 hours ago
It takes time to convey the core ideas. It takes time for other mathematicians to come up to speed on the new techniques and approaches or the novel combinations of existing ones.
The actual experts in this field have asked for the argument to be explained to them, and are now at the point where they believe this is plausible. Another person in this thread has produced a Lean proof and presumably is not trying to pull a fast one on us by exploiting a bug in the solver.
TL;DR chill bro.
Comment by OxO4 3 hours ago
Comment by CrimsonRain 3 hours ago
Comment by david-gpu 3 hours ago
Comment by TheOtherHobbes 2 hours ago
Comment by FeepingCreature 19 minutes ago
2. It really doesn't work well in other industries either.
Comment by aljgz 4 hours ago
Comment by varjag 4 hours ago
Galois had built modern algebra before dying at 20. What agents did so far is flash in a pan.
Comment by abricq 2 hours ago
Comment by jrflo 7 hours ago
Comment by chowells 5 hours ago
Math is about clear communication between people first and foremost. That's why Shinichi Mochizuki's claimed proof of the ABC conjecture isn't accepted - he's unable to communicate it to enough mathematicians to get a consensus on its validity. LLMs generating Lean proofs are basically following that same schema. Sure, something has been proven. But what? Where's the clear communication explaining it to the satisfaction of other mathematicians?
Comment by badlibrarian 5 hours ago
I can't imagine I'm the first one to point out that this is perhaps the greatest unsolved problem in mathematics.
> Where's the clear communication explaining it to the satisfaction of other mathematicians?
Coming in about a year for $20/month, sure seems like.
Comment by calf 2 hours ago
People can do math alone. They don't have to share it with others. Mochizuki was doing math (with errors). The aliens from Arrival could do math and we wouldn't necessarily be entitled to that. It doesn't make these things not valid math.
The only benefit of defining math through this vulgar social reductivism is to benefit the status quo. So you see some experts and expert-adjacent commentators using these math slogans but never critically justifying those words. Case in point, the above commenter asserts "...math is foremost about communication.", but the very next sentence does not explain why it is foremost, it just uses the sentence as a premise for the following sentence. Guess what, that is exactly how ideologues argue, by question begging fallacy. Ironic that STEM people who ought know better fail to catch this simple rational mistake.
Comment by TheOtherHobbes 2 hours ago
Applies to STEM generally, because the foundation of STEM is peer review and independent testing and confirmation.
Even if the practice never quite lives up to the theory (true) that's no excuse to hand-wave away the requirement as if it doesn't matter.
Proofs that can't be confirmed are valueless because no one learns anything from them. The value of a proof isn't just in proving something but in inventing new techniques and insights that can be reused for other applications.
Brute force searches are fundamentally less valuable, because the creative foundation of math is discovering leaps of logic that solve problems with insightful shortcuts that can be generalised and reused for other applications.
Comment by asaddhamani 5 hours ago
Comment by darepublic 5 hours ago
Comment by wvenable 5 hours ago
That has been the ultimate goal of creating AI -- not to simply match human intelligence but to surpass it. If it surpasses us, does that make it irrelevant? Everything around us is powered by mathematics, most of it I don't understand, and soon perhaps everything will be powered by mathematics that everybody doesn't understand.
Comment by bonitochips 3 hours ago
“Hey guys, the human condition can be experienced by these machines more efficiently than we are able to! Now we can finally die off!”
Why are we enabling a world that outpaces us? Is this going to lead to anything other than displacement in the long term?
Do you ever stop and ask why we’re building the world we’re building?
To what end does a world we cannot comprehend or rebuild from first principles serve us?
Comment by wartywhoa23 3 hours ago
They killed your comment, but you should know that you've posted it on the world's #1 AI propaganda site, where literally trillions of dollars are at stake and ROI depends on the correctness of the discourse running among the meat LLMs foraging or lurking here.
Comment by shaky-carrousel 2 hours ago
Comment by indigo945 2 hours ago
Comment by ImHereToVote 2 minutes ago
Everything is potentially interconnected.
What separates things is course-graining, not ontological separation per se.
Comment by mlsu 5 hours ago
Comment by marcianx 5 hours ago
Comment by pavas 3 hours ago
Your opinion is a possibility but it is not grounded by any proof, as such it is nothing more than an assumption. I think the more intellectually healthy approach is to list out the possibilities and figure out what they entail, rather than to throw all your eggs in one basket blindly, which amounts to a leap of faith or a retreat to commitment.
But that's just my two cents, take it or leave it.
Comment by don_esteban 3 hours ago
I absolutely do not understand what are you talking about.
The question whether the tautologies exists regardless of whether we know about them or not is absolutely not a problem that is studied by mathematics and can be proven by mathematics.
Comment by alhirzel 2 hours ago
Comment by fwlr 4 hours ago
The author of those sentences is also the author of the main result that this generated improvement builds on, and prior to this improvement his work was thought to be unimprovable. He is, in all of the important ways, literally the single most qualified human on the planet to asses this result. And his assessment is 1) this improvement is real, 2) this improvement is exponentially bigger than his work and the work he improved on, 3) it is effectively impossible for him (and by implication, humanity) to understand the result as presented, 4) it is seemingly trivial for “frontier circa 2026”-class models to understand the result as presented, and 5) to the extent that he is able to understand it, it is only with significant frontier model assistance.
So the place we are at, at least for this highly intellectual field, is “intelligence is the property of ~2 corporations, you must pay them a fee and agree to their terms and conditions to access it”.
At risk of stating the obvious, this is not a healthy place to be because intelligence is now structurally subordinate to the profit motives of particular corporations and at the mercy of all the attendant economic/sociopolitical incentives that apply to them. If the landscape is such that it is in these corporations interests to withhold this intelligence from some and make it available to others, that is simply what will happen.
One trivial example, of which there are an arbitrary number: An elderly leader is convinced to issue a decree that all number-math-computation intelligence is to be made available only to the intelligence agencies of his nation, and failure to comply means no IPO and no further investment. From this point on there would be a permanent nation-state-shaped shadow over practically all modern cryptography, with no recourse possible.
If the Church had a Large Astronomy Model in the time of Copernicus, the earth would have stood still - regardless of what it may privately prove about heliocentrism, it would never declare e pur si muove.
Comment by don_esteban 3 hours ago
Observing the LLM output on problems that have clear solutions invented by humans, I tend to believe that too many people are jumping to conclusions too soon and interpreting b) as a).
If the LLMs are truly so great, we should see (in a short time, i.e. in order of months) a transformation of the math proofs generated by LLMs from the current state of indigestible mess to something that indeed looks like written by human for humans.
Only then would one be able to claim that we got into situation a).
Comment by fwlr 1 hour ago
Comment by RetroTechie 1 hour ago
If a paper/proof is impossible to understand by humans, it could be considered useless (irrelevant) for most intents & purposes.
Regardless how interesting or valid looking, might as well be gibberish pulled from /dev/random. Until:
a) Written down in a form that humans can understand. And/or
b) Turned into practical applications that are demonstrated to work.
In other words: safe to ignore, until a) and/or b) occurs.
Comment by jeezfrk 6 hours ago
None of them were okay. Those were small small tools with few (sometimes only one) uses.
Generations earlier, famines, diseases and lead-leeching plumbing made rulers insane and entire cities of people die without any help from the "best tools".
Scifi is always written about the best tools. The issues arrive in the tools and in the hands that wield them both.
Comment by prodigycorp 5 hours ago
Comment by nico 6 hours ago
The amount of unimaginable complexity contained in a seemingly very tiny amount of matter to us, is incredible, and it’s all around us in nature
We’ve never had the capacity to fully comprehend neither ourselves nor the environment we live in. But we do our best, and we do survive and sometimes even thrive
Comment by sysguest 6 hours ago
(and why math differentiates between conjectures (maybe true) and theorems)
so that "oh some 3rd party person/machine understood it for me" can feel... a bit icky
Comment by metanonsense 5 hours ago
Comment by Madmallard 6 hours ago
Everyone in advanced math research understands the topics they are reading about deeply.
This person is just literally being victimized by the AI incompetence apocalypse.
Information overload + trained laziness.
Comment by dimator 5 hours ago
Comment by CrimsonRain 2 hours ago
Comment by rtpg 6 hours ago
At one point intuition helps to build out usage of the math itself. See stuff like "oh I can do rotations through matrix multiplication"-style ideas.
It is helpful for us to be able to reach for those tools quickly. The more tools that require advanced prep to use, the less we'll be able to use the results in easier contexts. Everything will be hard
Of course nothing really prevents people from looking for the simpler tools and proofs. Lots of math stuff starts off complicated and gets simpler.
Just important that this is still a goal in mind
Comment by jonhohle 5 hours ago
Comment by locknitpicker 6 hours ago
How can you tell?
Comment by techpression 4 hours ago
Comment by 20k 6 hours ago
1. These tools are wrong a significant % of the time
2. They have an upper complexity bound where they start to fall apart
Relying on AI to check AI papers is a terrible idea
Comment by aenis 5 hours ago
But where they do differ is they do have an infinite stamina, and can work on problems in loops, self-correcting their own mistakes if a formal way of checking the correctness of the solution exists. Which does happen to be the case with math.
Comment by 20k 5 hours ago
Comment by aenis 2 hours ago
Comment by BetterThanSober 4 hours ago
and why does this "peer-review" new-age thing cannot be used to scrutinize AI-writted/AI-assisted papers?
Comment by don_esteban 3 hours ago
Aaaa, you mean 'peer-review' by AI?
Then the answer is: What is the use of a paper no human understands? Then no human can see that the techniques from the paper can be used to build something useful for real human life.
OK, ok, AI can decide to use those techniques to do something in real life it considers useful.
Are you now getting scared? Why not?
Comment by orlp 3 hours ago
Comment by root_axis 5 hours ago
Comment by Madmallard 6 hours ago
Comment by nextaccountic 5 hours ago
If you don't understand the subject and relies on the understanding of the tool, how will you have a frigging chance of catching an error?
Anyway this reminds me that scene in Matrix 2, where the mayor (of sorts, don't remember his exact title) of Zion tells Neo about the machines that keeps everyone alive, but that there is nobody left that understands how they work or could repair them if they broke.
Comment by jonathanstrange 2 hours ago
Comment by KingOfCoders 6 hours ago
Comment by Madmallard 6 hours ago
All this anthropomorphism of literal statistical text generators.
Yes they exhibit generated sentences of text that describe coherent responses about a topic when there's an inordinate amount of research material in the training data from which they are distilling sentences of sound and rational thought. That's the ONLY way it can possibly work. There are so many scenarios where the training data isn't setup like that and low and behold the generated responses are just literal garbage.
Comment by Sharlin 5 hours ago
Comment by Madmallard 5 hours ago
Comment by reichstein 3 hours ago
We can explain how LLMs generates this output.
Humans can't be that simple, there must be some ~~divine~~ unique human touch to what we do.
Every day LLMs, running in frameworks that add earlier "thoughts" to the context and iterate, reflecting on their own thought process, gets better and better at doing something even less distinguishable from human output.
The gap gets smaller. The "unique human touch" will always be in the gap.
Comment by Madmallard 2 hours ago
You just fly in from astroturfer kookoo town or what?
Comment by krackers 7 hours ago
Comment by estetlinus 5 hours ago
I believe you just captured the zeitgeist, friend.
Comment by 6879346626 7 hours ago
Honestly it is not that much different from the divine inspiration if you have ever experienced it.
I do not know how you view the world or walk through it but language in general is simply subject to interpretation to me, the arrangement of words for the sentence is inspiration in and of itself - though the majority of time it amounts to minimum jumps.
Comment by yodsanklai 1 hour ago
Comment by khazhoux 5 hours ago
Comment by wartywhoa23 2 hours ago
There's a huge lot of suicidal people who ideate their afterlife as "pursuing hobbies".
Comment by ludvigk 5 hours ago
Comment by jdb1729 8 hours ago
@platypii and I obtained a Lean proof of the same improvement for DFT over prime-order finite fields (yielding polynomial multiplication via the convolution theorem): https://github.com/platypii/integer-mult-bounds-lean/blob/ma...
Comment by kenferry 3 hours ago
This is very odd, because it just doesn't match my experience with these systems at all. Yes, they do generally SOUND confident, but code (say) that's hard for me to understand is usually hard for the machine to understand as well, and while it is more indefatigable than I am, it's not brighter.
This mathematician is in a very good place to evaluate whether Fable gets it or not, but it's weird and counter to my experience.
Comment by bjornsing 39 minutes ago
Comment by reasonableklout 2 hours ago
Comment by black_knight 1 hour ago
Fable is good, especially at conceptual stuff, don’t get me wrong, but it has limits. Opus 5.5 is a machine at getting correct code out once the concepts are in place. But I can’t trust either to not make mistakes.
Comment by throwaway63467 2 hours ago
Comment by flebron 8 hours ago
Comment by ComplexSystems 8 hours ago
Comment by onionisafruit 8 hours ago
Comment by kuboble 1 hour ago
The big O notation is very often used to denote exact complexity of an algorithm even if the notation is technically an upper bound.
The little o notation is usually used to denote a small asymptotic improvement over some known complexity.
For example if some sublinear algorithm would have n^(7/8) complexity - would be probably advertised as big O of that. But n^(1-eps) is shared as o(n) with exact constant provided as a detail.
Comment by m-chrzan 1 hour ago
Comment by bobmarleybiceps 7 hours ago
Comment by morsch 5 hours ago
Comment by weinzierl 3 hours ago
Comment by bobmarleybiceps 4 hours ago
Comment by globular-toast 4 hours ago
Comment by ruined 8 hours ago
f(n) = o(g(n)) means as n increases, f(n)/g(n) must shrink
Comment by jhanschoo 7 hours ago
s/must shrink/must eventually shrink, after finitely many n/
Equivalently, must go to zero in the limit.
Comment by Davidzheng 7 hours ago
Comment by mebrainmush 6 hours ago
Comment by dandanua 2 hours ago
Comment by theokrueger 8 hours ago
O(2n+1) = O(2n) = O(n)
o(2n+1) > o(2n) > o(n)
Both define upper boundary, but big O can read like "the function is generally proportional to ___" and little o can read like "the function is never more than _____"
Comment by contravariant 1 hour ago
I don't think any of those are right. The latter two are trivially equivalent, the former also is since it differs by a factor of at most 3 for all n >= 1.
I still think the simplest definition for o(f) is 'g in o(g) iff O(g) is a proper subset of O(f)'. Or you can just say g is dominated by f in the sense that lim sup g/f = 0.
I'm fairly sure those two are equivalent, but it's a good little exercise.
Comment by bobmarleybiceps 8 hours ago
Big O is sort of like <=. little o is sort of like <.
Comment by npinsker 7 hours ago
O(n) is: "there exists a K such that, for sufficiently large n, K*n is always larger".
o(n) is: "for every K, for sufficiently large n, K*n is always larger". (So o(2n+1) and o(2n) and o(n) are the same thing.)
Comment by contravariant 1 hour ago
For what it's worth you can leave out the 'sufficiently large n' part, assuming we're talking about positive integers (or continuous functions on the nonnegative reals). I like to leave it in though because it makes the jump to defining both o, O and Theta in terms of lim sup f/g a little easier.
Comment by boothby 8 hours ago
Lim f/g -> C a constant
And Lim f/h -> 0Comment by adgjlsfhk1 7 hours ago
This isn't quite correct. O(g) doesn't require the limit to exist.
Comment by boothby 6 hours ago
Comment by appplication 8 hours ago
If you were joking then maybe you got me
Comment by boothby 7 hours ago
Comment by Ygg2 8 hours ago
https://stackoverflow.com/questions/1364444/difference-betwe...
Comment by craigcitro 8 hours ago
Comment by yaoke259 7 hours ago
Comment by m00dy 7 hours ago
Comment by trostaft 7 hours ago
Comment by jonhohle 5 hours ago
I’m trying to come to terms with this myself. I agree that this future is inevitable, and progress will come regardless.
I feel a lot like Grant in Jurassic Park right now.
Comment by wartywhoa23 2 hours ago
Comment by stinkbeetle 5 hours ago
Comment by 10111001 3 hours ago
Which is exactly what the capitalists that own these systems want. Divide and conquer.
"Pay no attention to the men who are responsible for you situation, instead pointlessly fight amongst yourselves."
Comment by stinkbeetle 2 hours ago
> "Pay no attention to the men who are responsible for you situation, instead pointlessly fight amongst yourselves."
Maybe so, but that advice is for the western left, who openly and boastfully despises the working class these days. They might have thought about that if they wanted any "working class solidarity". It's been a staggering achievement either incompetence or coordinated malice that they could flip the balance of blue collar voters to right-wing parties in a generation. They chose who they wanted to lie with.
Comment by bonitochips 2 hours ago
Comment by Eji1700 5 hours ago
My extremely limited understanding is “no” as I sorta assume that would be the headline. The main point being that while a MASSIVE improvement over any previous progress it’s still “small” from a practical standpoint.
This is not to downplay the very well conveyed problem this might be, but I just want to make sure I even got that right.
I do wonder if this will be a major issue for future development or if the math experts in diapers right now will grow up in this world and have tools and understanding to assist and we’re just in a rough transition, but unfortunately that’s about as much as I can contribute.
Comment by atzeus 5 hours ago
>The result is of extreme practical importance. Not for actually multiplying integers (as usual with these algorithms it’s probably not faster than existing algorithms for integers that can be stored in the observable universe), but for writing papers. It has always been a hassle to write down the complexity of integer multiplication or algorithms based on integer multiplication by introducing soft-O notation, little-o exponents, epsilons greater than 0, or iterated logarithms. From now on I can just write O(n log n) in my papers and be done with it!
This new result means painful typesetting again.
Comment by kleiba2 4 hours ago
Comment by oersted 3 hours ago
Comment by DannyBee 4 hours ago
I'm not sure what argument fable gave him, but this part seems not horribly difficult to prove. I'm sure i'm missing something since i'm not that great at this kind of math.
The short reason is that each slice call can at most double the number of nonzero entries, but a transform that would enable g < m must turn a single nonzero entry into (2^m) nonzero entries in a single call.
Since the permutes can't generate non-zero entries (since they only move things around), you actually need exactly m slice calls in the initial 2-instruction model given (where you can only do slices and permutes) precisely because of the need to create 2^m non-zero entries where each individual slice op can only double the number (and permutes do nothing)
Astra actually comes up with a variant of this argument as well: https://gist.github.com/dberlin/e785c51aff0285c9c0a3ea0f24fa...
Comment by CH-Abhinav 3 hours ago
Comment by ajkjk 7 hours ago
edit: I mean this seriously. This kind of thing
> Some of my colleagues believe that this is a nefarious Company, whose only goal is profit, if necessary at our community’s expense. Perhaps there is some truth to this, but I think it is missing the larger point. The fact is that there now exists an automated system that can perform mathematical research — at least the part that involves “solving hard problems” — far better than any human. Now that such a system has been demonstrated, it is clear that results like these were bound to start appearing soon anyway. I do not blame the Company for getting there first. Who got there first is an irrelevant detail, a historical footnote.
is very pleasantly honest and well-thought-out.
Comment by wartywhoa23 2 hours ago
> I do not blame the Company for getting there first. Who got there first is an irrelevant detail, a historical footnote
Oh, such a noble mathematician, he's so above the questions of moral, Truth is all that matters.
Almost as much as a paycheck from the Company.
Comment by GMoromisato 6 hours ago
Comment by WindyTree 6 hours ago
Comment by MiroslavPokorny 7 hours ago
Comment by krackers 5 hours ago
* Start with the usual FFT convolution for polynomials, viewing integers as a polynomial in a given base evaluated at a certain point
* In undergrad you (hopefully) saw polynomial multiplication can be done in nlogn via convolution using FFT, but that assumes complex integer addition/multiplication is O(1). Here we need O(log x) bits to simply represent a number x on a real machine.
* If you use naive (n^2) multiplication for those butterfies, then you end up with O(n[(log n)^2]).
* If you recursively use FFT for the digit multiplication at those butterflies, then you get something like O(n[(log n)^(log log n)]).
* Schonhage-Strassen realized that instead of doing FFT in C where the butterfly involves multiplying by \omega (\omega being roots of unity), you can work in a different ring where 2 is a root of unity and so it's a cheap bitshift, but were constrained in how finely they could break subproblems (could only break an n-bit integer into sqrt-n subpproblems each of sqrt-n bits), resulting in an overall O(nlogn * loglogn).
* The 2019 O(nlogn) version (supposedly, this is out of my depth) found a way to use some technique of "Gaussian Resampling" to do the matrix convolution via _multidimensional FFT_ in a ring where multiplying by root of unity became cheap _and_ subproblems could be finer. The bottleneck was thus only the addition/subtraction in the O(log n) butterfly layers, each of which does O(n) work for total of O(n logn)
* OpenAI's paper uses a fact that it's apparently easier to compute multiple butterfly layers "simultaneously" than doing them one at a time independently (page 10). There is some sort of implicit reuse because the later layers mix the outputs of earlier layers, and they take advantage of this to avoid having to write out layer 1 outputs separately from layer 2 outputs, and instead work in some coordinate system where they can intermingle them. This apparently amortizes to some tiny fractional epsilon shaved off of a layer, and since the whole FFT is recursive they can apparently save a factor of (1 - epislon)^(log log n) overall across "log log n" recursion depth, which is apparently where that ridiculously small overall exponent comes from.
Comment by briansm 3 hours ago
Comment by adrian_b 36 minutes ago
A useful performance measure for the evaluation of a function in hardware is the latency of the operation expressed as a multiple of the delay through some standard simple logic gate, e.g. the FO4 delay (of an inverter with a fan-out of 4) that is frequently used in CMOS technology.
While a multiplication can be done in a single clock-cycle if you choose so, the duration of that clock cycle in FO4 delays increases with the size of the numbers that are multiplied, and it is interesting to know how fast it increases with a given multiplication algorithm.
If a multiplication algorithm that claims to be faster when expressed in some abstract operations leads to a FO4 delay number that actually grows faster with the length in bits of the operands, than that algorithm is worse in practice.
Comment by Surac 4 hours ago
Comment by hoten 4 hours ago
Comment by autuni 3 hours ago
Stopped reading right after that. Why is this so high up on HN? It's literally nothing.
Comment by reasonableklout 2 hours ago
Comment by autuni 2 hours ago
Comment by fwlr 19 minutes ago
Comment by tiara_girl 2 hours ago
Comment by kypro 45 minutes ago
This is the future, and something I've been warning about for years.
Advanced AIs are basically genie's bound only by the laws of nature (which are necessarily the known laws). You ask the genie for something and if it's possible, it will grant your wish. What it does will seem like magic to you or I, and while in theory there is an explanation for the magic it's preforming, in reality an explanation could be as complex as understanding how the AI itself works at the level of its weights. It's not something a human mind can do.
The genie might give you a cure for cancer, but you won't know how it works. It's possible it will cure all cancer but with some hidden cost. A cost we cannot know and one we must trust the genie is both aware of and would inform us of. Maybe it will make us more trusting of the genie, or maybe it will just make us all drop dead in 20 years time.
The world we are now entering will look similar to the world native populations entered when they encountered Europeans. Suddenly people were turning off the sun and yielding magic kill sticks. It was basically impossible to reason about what might or might not be possible.
This future, is for now, still optional. We can still decide if we want it, but when the genie in its final arrives, perhaps one of the only things it won't be able to grant us is the ability to undo time and take back our decision if we later decide it was a mistake.
The most important thing about this paper is that it's describing human loss of control. A world where we are no longer the masters of our own destiny.
Comment by calf 3 hours ago
Comment by reasonableklout 2 hours ago
Comment by joe_the_user 4 hours ago
That made me chuckle...
Comment by cachius 6 hours ago
web.maths.unsw.edu.au fills the whole address bar on mobile