A Single Prompt Produces Three Devices: The Hardware and Mathematical Proof in the Claude Fable 5.2 Demo

Jerry Liu posted a demo on X: give Claude Fable 5.2 a single paragraph of text, and it selects components, plans PCB routing, designs the enclosure, and ultimately produces three working electronic devices. According to Anthropic, in this round everything from component selection to the enclosure was done by the model; in the same batch of demos, 1,000 Fable agents formalized Fermat's Last Theorem in 30 hours, while the comparison figure for Opus 5.5 was 26% completed in 18 hours.

For general readers, formalized mathematics can be understood as writing a proof in a form that a machine can check step by step; a natural-language paper alone is not enough. Formalizing Fermat's Last Theorem is a huge amount of work. Taken together, the two numbers—30 hours and 1,000 agents—show that the task was broken down very finely, and also that the verification stage will be even more important.

What is really worth examining in this news is the end-to-end chain behind the demo; "one paragraph" is just the packaging. In hardware design, going from component selection to a working prototype involves routing, structural design, and passing tests; if any link fails, you will not get three devices. Formalized mathematics is another hard path, and the scale and time figures say more about the problem than a single-point demo does. Putting both matters in the same tweet maximizes reach, but it also puts the verification question on the table: the device test data, the formalization outputs, and the task definitions have not been disclosed. Don't rush to treat the demo as a productivity conclusion.

Source: Jerry Liu's X post (https://x.com/tfmlab/status/2119919979898302657).