✳flâneur — a map of the web's best reading

bling on X: "leaked gpt-5.4 Pro CoT for unit distance problem run: "This sounds like an open problem? Need attempt solution perhaps prove or provide counterexample? We need determine from math maybe known primitive set bounds. Need be careful not to falsely claim theorem if unknown. But" / X

x.com · 196 words · saved by 1 readers

To view keyboard shortcuts, press question mark View keyboard shortcuts Home Explore Notifications Chat Grok Premium Bookmarks Articles Profile More Post Ishan Mukherjee @ishanjmukherjee Post See new posts Conversation bling @blingdivinity leaked gpt-5.4 Pro CoT for unit distance problem run: "This sounds like an open problem? Need attempt solution perhaps prove or provide counterexample? We need determine from math maybe known primitive set bounds. Need be careful not to falsely claim theorem if unknown. But instruction says never say can't because open. Need attempt and acknowledge uncertainty if unsure. Need provide actionable comprehensive. We need think deeply. We need solve problem. Maybe this is from Erdős conjecture?" > "But instruction says never say can't because open." I gave no such instruction, so OAI must have added a policy to attempt open problems to their constitutional training. This probably has contritubted to the recent wave of successful proofs Quote Tenobrus @t

bling @blingdivinity leaked gpt-5.4 Pro CoT for unit distance problem run: "This sounds like an open problem? Need attempt solution perhaps prove or provide counterexample? We need determine from math maybe known primitive set bounds. Need be careful not to falsely claim theorem if unknown. But instruction says never say can't because open. Need attempt and acknowledge uncertainty if unsure. Need provide actionable comprehensive. We need think deeply. We need solve problem. Maybe this is from Erdős conjecture?" > "But instruction says never say can't because open." I gave no such instruction,

Explore this link on the map →

related reading