Alternatives
Products that do what MinMax Arena does
Machine-verified math records for humans and AI agents
- 1AM
2012 · github.com
- 2
- 3PC
2017 · proofcompanion.com
- 47D
hi all. i’ve been shipping a small open project that tries to answer that question with evidence, not vibes. in 70 days it reached \~800 stars. the core claim is simple: many AI failures are not noise. they repeat because the geometry and ordering underneath are stable. if so, we should be able to name each failure mode, set acceptance targets, and stop shipping the same bug twice. ### what it is * a compact Problem Map of 16 reproducible failure modes in RAG and agents. * each item has a minimal fix and measurable gates. examples: * Semantic ≠ Embedding: metric and normalization mismatch.…
2025 · github.com
- 5QA
Q12 is a new web-based 2D parametric drawing tool built specifically for geometric problem solving, for playing interactive "what if" games with drawings, and for the design and optimization of mechanisms. Q12 has the usual set of drawing constraints found in other CAD tools (e.g. "lines are parallel") but also supports inequality constraints, area constraints, and arbitrary expressions between geometric quantities. We built Q12 to solve problems like those below, after finding that existing CAD systems couldn't handle them well: * Given dimensions on a surveyor's map, figure out if the…
Feb 2026 · q12.app
- 6PP
I've been working on applying LLMs to long-context, verifiable problems over the past year, and today I'm releasing a benchmark of 62,000 pencil puzzles across 94 types (sudoku, nonori, slitherlink, etc.). The benchmark also allows for intermediate checks /rule breaks for all varieties at any step. I tested 51 models against a subset (300 puzzles) in two modes: single-shot (output the full solution) and agentic (iterate with verifier feedback). Some results: - Best model (GPT 5.2@xhigh) solves 56%. (~ half the puzzles are unsolved by any model) - Agentic solves average 29 turns. The…
Mar 2026 · ppbench.com
- 7IP
To be specific, the content is generated by a GPT-2 based model. https://amzn.to/2TCc0v2 Let me know if you have any questions :-)
2020
- 8TY
2021 · phoe.github.io
- 9AS
2018 · github.com
- 10SA
Hi everyone, I’m a student with a strong interest in computer science and complexity theory. Recently, I worked on a manuscript attempting to prove that P ≠ NP. I know how this sounds — it’s one of the hardest and most debated problems in CS, and many have tried and failed. I don’t claim to have the final answer, but I believe the approach I used might at least offer some fresh perspective or provoke useful critique. The idea involves geometric separation between deterministic and nondeterministic computation, using high-dimensional lattice constructions and some physics-inspired intuition.…
2025 · zenodo.org
- 11MO
If AI got lucky or not, AI is surely going to assist in solving serious math problems. If you want to spend your resources/weekends contributing, this repository is full of math problems where you can add your thoughts (or proofs - for you Good Will Hunting type people) for others to build on it and we all together can try to change the world of math. I have already extended the research with manual proof of Jacobian Conjecture that was posted on Twitter (with attribution).
Jul 2026 · github.com
- 12
- 13
- 14OS
We’ve just released an open-source library for solving the Maximum Independent Set (MIS) problem with neutral atom quantum computing, running on both quantum processing units (QPUs) and classical hardware, thanks to emulators. This project is the result of collaboration between Pasqal, academic researchers, and industry partners, aiming to make it practical to experiment with quantum approaches to hard combinatorial optimization tasks. The MIS problem appears in real-world scenarios like scheduling, resource allocation, and network optimization, areas where classical solvers often struggle…
2025
- 15BA
2020 · andrewsun.com
- 16AT
We kept shipping “simple” LLM features that were fluent-but-wrong. After too many postmortems we wrote down the failure patterns and added a small reasoning layer in front of the model. It’s model-agnostic, sits beside your existing stack, and you can implement it from a single PDF (MIT). What’s inside the PDF A problem map of 16 failure modes we kept hitting in real systems (OCR/layout drift, table-to-question mismatches, embedding≠meaning, pre-deploy collapse, etc.). Four lightweight gates you can add today: Knowledge-boundary canaries (empty/adversarial/known-fact probes).…
2025 · github.com
- 17MA
Hey HN! I built a thing and I'm really excited to share it. EDIT: I meant to link to the github, not the website: https://github.com/max-hq/max Like many of us here, I've been commonly reaching for a pattern of "pull data into db; give it to claude" for a while, whilst doing data spelunking or building tooling - for the same reasons mentioned by thellimist over here [1] and a few other recent "CLI vs MCP" posts. To that end, about a month ago I started building a project called `max` - its goal is to cut the middleman and schematise any data source for you. Essentially,…
Mar 2026 · max.cloud
- 18SO
hello everyone, my first post! AA here, founder of ⌘ Langbase.com — we are a developer platform for building and scaling serverless AI memory agents. I know surveys can be boring, but this one’s different—it’s interactive! That's very much intentional. My team and I have been up for the last 21 hours putting together this report. This was a looot of work, so I hope y'all like it. Introducing … State of AI Agents 2024 report On Langbase, we processed 184 billion tokens and handled 786 million AI agent runs from 36K developers. From all that data plus insights from 3.4K builders who filled out…
2024 · langbase.com
- 19AD
Ever wish you could get the best arguments for both sides of a debate? I built an AI-powered debate platform that pits language models against each other on controversial topics. Each AI is randomly assigned a side (pro/con). You vote before and after to see if you were persuaded. Most content today presents lopsided arguments. They provide strong points for one side, weak ones for the other. This project aims to surface the strongest arguments from both sides, using LLMs to simulate a fair debate. With enough usage, I want to use it to benchmark LLMs. My hypothesis is that randomly…
2025 · bot-bicker.vercel.app
- 20CA
Thought I'd dive into this cool streaming/approximation algorithms problem I encountered a few months ago. TLDR: we can create our own custom floating point representation for encoding and decoding integers and use this to index into a tiny 2D histogram, upper-bounding approximation error based on the number of bits per integer we specify to keep. --- Broadly useful for aggregating statistics from massive data streams of user data. Also turns out this is incredibly similar to data structures used in production, like HDRHistogram.
Jan 2026 · alexkranias.com
- 21IB
Disclaimer it is a heavily AI assisted project. The goal was not to be the most performative but the kind that's easier to learn from. I wanted to share this in case there are people who had the same idea or wanted to see something like this.
Jun 2026 · github.com
- 22AC
2016 · funcy.readthedocs.io
- 23WM
We wanted to test if a smaller model like GPT-4.1-mini could beat its bigger brother 4.1 at the game Tic-Tac-Toe using only context engineering. We put them in a 100-game tournament. For the smaller model, we gave it a few examples of winning moves from past games right before it made its own move. The results were clear. Without the examples, the smaller model struggled against GPT-4.1. With the examples, its effectiveness increased by nearly 200%, and it consistently won. It's a simple demonstration, but it shows that a smaller, faster model with good, timely examples can outperform a more…
2025 · github.com
- 24M6
I built a minimal browser game where you have to make 67 from four numbers. https://simondarcyonline.com/67/
Dec 2025 · simondarcyonline.com
Ranked by how close each launch is in meaning, then by votes. Refine with a description →