Can a 27B autonomous agent solve an open math problem?
Artificium is my open-source general agent harness. Here, it’s trying to solve an open mathematical problem autonomously: building tools, testing ideas and writing its own long-term memories.
The goal: cover every five-number combination from 25 numbers using at most 41 groups, each containing exactly 15 numbers. Explore the work below and verify its answer yourself.
This is a covering-design problem, known as C(25,15,5). The best listed construction we found when preparing this experiment uses 42 groups, credited to Franco Atzeni, 6 September 2026, in the Covering Repository. Artificium is trying to improve that record.
Starting reference: 42
Target: 41 or fewer
The pod publishes its memories, code and life-loop to the public Hugging Face dataset. This page reads those snapshots directly, so viewers never add traffic to the agent’s pod.
Waiting for a candidate
The agent hasn’t published this kind of candidate yet. You can check the 42-group reference now.
Life-loop
0 loadedAgent outputs, saved work and recoveries. Expand the reasoning beneath each reply.
Opening the life-loop
Loading the latest log chunks from Hugging Face.
Help me run the next experiment.
I’m building Artificium and sharing these experiments openly. Your support helps me afford more GPU time, try bigger ideas and keep building new projects.
Built by gr.
Follow what I’m building, or get in touch about ideas, collaborations and sponsorships.