DeepSeekMath‑V2, the new open‑source math engine, can generate and verify its own proofs using an internal critique loop, all with modest test‑time compute. Could it deflate the US AI hype bubble that fuels giants like OpenAI and DeepMind? Dive into the tech, the risks, and why community‑driven research matters. #DeepSeekMathV2 #OpenSource #MathematicalProofs #USAI
🔗 https://aidailypost.com/news/deepseekmathv2-generates-verifies-proofs-aiming-pop-us-ai-bubble
@Ludo
8/8
Does that make sense? To learn more you might like to research how #hashing works, how bitcoin addresses are made, exactly how #blockchains work, how different types of encryption works. Some of the #maths is wild. Where #mathematicalProofs do exist, they are even more wild.
Having said all this, blockchains are not the be-all-and-end-all for all #decentralisation, because they use a lot of bandwidth and diskspace. They do work for a #LayerOne money like #bitcoin.
Interesting maths breakthrough. Mathematicians have searched for numbers such that a^3 + b^3 + c^3 = n , for n up to 100. "42" was the last number for which this was found (yay, for those Douglas Adams fans).
Now, a non-trivial answer for "3" has been found. (A trivial one would be 1^3 + 1^3 + 1^3 = 3).
https://gizmodo.com/mathematicians-no-longer-stumped-by-the-number-3-1838221738
For 42, see this Numberphile video [ https://www.youtube.com/watch?v=zyG8Vlw5aAw ].
Fascinating Twitter thread by John Baez on Gauss' proof that you can construct any n-gon with a straight edge and a compass as long as "n is a prime of the form 2^(2^k) + 1". Thread includes an animated gif showing Gauss' construction of a 17-gon.
“Gauss proved you can construct a regular n-gon with ruler and compass if n is a prime of the form 2^(2^k) + 1. So, you can construct a regular 65537-gon with ruler and compass since 2^16 + 1 = 65537. But the first to actually *do* this was Johann Hermes. It took him 10 years!”
Hacker News
AI Daily Post
Dick Smiths Fair Go Supporters
Soh Kam Yung