Pinned Tweet
Well, never thought I would build a computer out of breadboards but here I am, dropbox.com/s/uilwgd3o2t55sl… :) Thank you @beneater for the fantastic videos and the kit!
Next is the YM mass gap :)
New on the Science Blog: Yes, Claude can do Nine Loops.
Theoretical physicists predict how particles behave using formulas called scattering amplitudes. These are notoriously hard to compute, so researchers work with layers of increasingly fine corrections called “loops”—each added loop makes the answer more precise but takes exponentially more computation. Most calculations stop at two or three loops. Eight loops was the previous record in a simplified model physicists use as a testing ground (planar N=4 super-Yang-Mills), set by SLAC's Lance Dixon and collaborators.
Last month, physicist and science writer @4gravitons issued a challenge: could an AI push past eight loops in this model, using only the compute budget an academic could reasonably access?
Given a single prompt describing the nine-loop problem, Claude ran largely unsupervised for days in Claude Science and solved it using methods developed by Dixon and his colleagues, at a total cost of a few thousand dollars. Dixon independently verified the result, and von Hippel wrote about the experience for our blog.
Read more: anthropic.com/research/yes-c…
romank retweeted
Introducing z386: an 80386-class FPGA CPU built around the original 386 microcode.
It’s more compact than ao486 and useful for studying how the 386 really worked.
Also: z386-MiSTer, an experimental PC MiSTer core built on z386.
github.com/nand2mario/z386
github.com/nand2mario/z386_M…
romank retweeted
🚀Here’s the z386 write-up: four months of work bringing the original 386 microcode to life in a real FPGA processor design.
nand2mario.github.io/posts/2…
romank retweeted
It works 🚀
First demo of the new #386fpgacore running on real FPGA hardware (Sipeed Tang Console 138K).
VGA output, 3DBench, Norton Commander, and Turbo C all running.
Still slow and buggy — but a lot of programs already work.
romank retweeted
Terry Tao understood Perelman's proof of the Poincare conjectore so you don't have to arxiv.org/pdf/math/0610903
romank retweeted
78% pass rate on the real-mode 80386 instruction test set 🚀
I’d say I’m ~1/3 through real mode 386, factoring in debugging time.
The 2,000+ lines of 80386 microcode is very interesting: compared to the 8086, there are dozens of internal registers (vs <10). 1/
romank retweeted
...are somewhat missing the point: if one of these big problems turned out to be solvable using only existing mathematical insights and technology, it would be an immense disappointment: a wellspring that we previously thought to be gushing is, in fact, dry. (5/12)
romank retweeted
Indeed, we identify such problems as being "interestingly hard" precisely because we intuit that they represent a "gap" in our current understanding and methods. This is why crackpots who claim to solve (say) the Riemann hypothesis using "tricks" or elementary methods... (4/12)
romank retweeted
How many *true* theorems have plausibly written but erroneous proofs? These are much, much harder to catch. My guess is that it is a not insubstantial portion of the literature. 15/n, n=15.
romank retweeted
as a word of advice to math-curious AI watchers, if someone actually resolves a Millenium problem (or really any significant mathematical problem), they will almost certainly be able to describe the main *ideas* of the proof, even prior to complete formalization of the argument
romank retweeted
Just uploaded #z8086 v0.2 🚀 — an 8086 FPGA core running the original microcode.
This release adds the soc_hdmi demo (HDMI + UART + C firmware) and fixes a CPU bug.
v0.2 shows that z8086 is now able to do useful things.
GitHub: github.com/nand2mario/z8086
romank retweeted
Replying to @rakyll
False. The change only seems radical because the new tools offer a potentially significant productivity boost. (Perhaps 20% when the dust settles.)
This is not new. We’ve seen similar boosts many times over the last eight decades. The shifts from binary to assembler to G1 compilers (eg Fortran) to G2 (eg C) to G3 (VMs like Java) to G4 (eg Python).
Radical change was predicted for each. FUD over programming jobs was rampant.
Yet two things remained constant:
* The ever increasing demand for programmers.
* The principles of software engineering.
romank retweeted
A longer introduction to z8086 - the 8086 soft core that runs the original microcode - and some interesting discoveries building it: ☕⚡
1. two important formulas in patent are wrong,
2. microcode greatly saves resource,
3. the 8086 interrupt bug.
nand2mario.github.io/posts/2…
romank retweeted
Still pondering a Christmas gift for the electronics enthusiast in your life? 🎁 @MouserElec has a limited number of @RadionaOrg ULX3S dev boards: #FPGA+ Espressif ESP32 (on the other side). More in stock early next year.
romank retweeted
Hard times create keyboard users.
Keyboard users create good times.
Good times create mouse users.
Mouse users create hard times.
romank retweeted
Tomorrow #LinaroConnect starts! Unable to join in person? Purchase a virtual ticket and join us remotely: ow.ly/6cMt50VRsYG #LIS25 #event #opensource
romank retweeted
Slides from this weekend's Oregon State University Beaver BarCamp. Unusual topic, but a request. Fun session, good interaction.
drive.google.com/file/d/1-0s…

























