A Cognition engineer used Devin to factor a 35-year-old cryptography challenge

Your move: A record-setting demo of Devin on hard technical work, not a product change

Cognition engineer Eric Lu used Devin to build and run a GPU-accelerated version of a classic factoring algorithm (GNFS), then used it to factor RSA-260, an 862-bit number from a 1991 cryptography challenge that had gone unsolved for 35 years. It's the largest number ever factored by a general-purpose method. The work took about 4,900 GPU-days and roughly $400,000, and Devin handled the coding, cluster operations, and optimization work largely on its own. Cognition says today's standard encryption, which uses much larger 2048-bit keys, is unaffected.

Source: Cognition blog ↗

Published by Agent Log. The summary reports the linked source; “Why it matters” and the verdict are Agent Log's interpretation.

More Devin Desktop updates →