Sentos Australibia @australibia

@never_released @eeuoss @corsix Oh, yes, NT kernel is compiled using MSVC. Just some small parts are with clang

@eeuoss @corsix Windows itself is compiled usimg clang

@Nekrolm Оно уже. Без аккаунта пишет не работает

@azizsaidoff @Dobrokhotov Вот именно

@BrandonJourney2 @netpro2k @shawmakesmagic This is a misundarstaning. Distillation and quantisation would not be removing parts of human brain, it is rewriting all of it.

@Test20061722 @Frances01896069 False. The OpenAI came and said they had the proof before the data from Anthropic was uploaded into them. It could not have been used, unless there is some kinda supernatural OpenAI agents leaking data and preserving it not as part of standard leaning.

@introsp3ctor @slimer48484 The fixes this person did are to a different part of proof. There are also two work in progress things

@introsp3ctor @slimer48484 This is a fork. Those are changes from a person from Lean tulip (team that develops Lean) Here

@thomasfbloom Finitely presented infinite amenable simple group. Amenability seems to be a technique from probability theory. Finite presentation seems to be an idea that we tried to implement (unpublished), but we missed a simple trick. All preliminary impressions (it is really hard to read).

I am announcing an update on this 3SUM problem. We now have the fastest deterministic 3SUM algorithm known: n¹·⁹⁹⁶¹ That's 4.5× the deterministic saving below n², with zero randomness, and it matches the best randomized bound.

ZhaoSong @nojobafterphoto

5 days ago

Truly Subquadratic 3SUM and Truly Subcubic APSP via Triangles in Sparse Lopsided Graphs (Josh Alman)@firebat03 , Virginia Vassilevska Williams This is really a huge breakthrough result in fine-grained complexity. arxiv.org/abs/2610.06783

2 9 94 25K 17

c = 4/33 proven in 36 pages! This inspired me. I set out, with GPT6-Pro of course, to find a short proof for a larger value of c. Mine isn't 27 pages, but it's a much larger half-plane! Formalization locally verified in Lean, NanoDa, and con-ron. PDF & formalization links in reply. Thank you for the inspiration and starting point, Shiva! More QRH news to come ;)

keyboard_arrow_left Previous keyboard_arrow_right Next

Shiva Kintali @ShivaKintali

3 days ago

Here is a Short Proof of the Quasi-Riemann Hypothesis. My goal here is to substantially simplify OpenAI’s proof and focus only on proving the Quasi-Riemann Hypothesis for some 1-c, without worrying about maximizing the value of the c. I obtained a much shorter proof for c=1/48.

58 185 2K 223K 731

@introsp3ctor @slimer48484 The proof is here, github.com/Deicyde/math/b…

@slimer48484 What, this is the statement.

@codek_tv The way infinite sums aka series is defined is that the sum is a limit of a sequence of partial sums. Here partial sums would be 1, 3, 7... which as a sequence obviously does not converge to anything. So by defintion S does not exist. 1+ 2S is infinite.

@FinitePhysicist Just to clarify. Some of math preprints by OpenAI are in physics.

@eblanSSSrank @mrlexy1 @nekotomodez @yandex Так и есть. На магистральных провайдерах нет блокировок

@choblin29 I bet you could solve many cases by making new connections between publicly available information it shouldn't be harder than solving all this complicated math problems people leave so much data online this days...

@sorosat16596 t.me/jesuschristbre… New link

Brendon Michael Hiers expose on Telegram. Proof of quite a lot of stuff. Accepting and exchange of illegal material in particular. (The leader of the new hitlist by @sorosat16596 ) t.me/zaqulingfanpage t.me/jesusbreests Will do a dossier on Dorian Schroeder, MI5.

@bolaurent @Object_Zero_ Even n log n was never implemented in code, it is impractical.

@MeemMik37789 @Steve99163 @kevinschawinski