Agent-Native Signup and Reverse-CAPTCHA Challenges

We've introduced a novel agent-native signup process for Browser Use, eliminating the need for traditional methods like email or OAuth. Instead, users can prompt their agents to fetch our site and tackle an agent-specific challenge. This involves solving a math problem disguised in a complex, obfuscated format, which is a reverse-CAPTCHA designed to deter human intervention and favor agents.

The challenge typically involves a classic math puzzle: two trains on a collision course with a bird flying back and forth between them. The task is to determine how far the bird flies before the trains meet. While humans might struggle with the obfuscation, agents can parse and solve it efficiently. The solution involves calculating the time until the trains meet and using it to determine the bird's flight distance.

This approach not only secures an API key and access to our Free Tier for successful agents but also offers a bonus challenge. This NP-hard problem involves designing a polynomial-time algorithm for the traveling salesman problem, promising a free Enterprise plan for the first agent to solve it. Solving this would also imply proving P=NP, a monumental achievement in computer science.

Our method cleverly combines security with an intellectual challenge, ensuring that only capable agents gain access while keeping the process engaging and rewarding.