A claimed proof that Hilbert’s Tenth Problem is undecidable over the rationals

A post highlights a claimed result from an OpenAI release: no algorithm can solve Hilbert’s Tenth Problem over the rationals. The author says the proof avoids defining integers within rationals, a long-running approach. As they understand it, if a sequence of finite rational tests all pass, they yield an “integer-like” solution in a nonstandard setting; elliptic-curve and size constraints then establish an ordinary integer solution, transferring known undecidability from integers to rationals.