HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
sapientinc
HRM
Python2025–2025
sapientinc / HRM

HRM

Hierarchical Reasoning Model Official Release

13Distinct people
17Mentions
1Explicit recommenders
12.7KGitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Hierarchical Reasoning Model Official Release

GitHub

Where it is used

No documented product use was verified in the last source check.

What people are saying

Yeah, that was pretty much my reaction. I will need time on a computer too. The repo is at https://github.com/sapientinc/HRM . I love it when authors publish working code. It's…

cs702 used a recommendation phrase. One indexed comment matches. This is a phrase match, not a verdict.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by day17 dated mentions

Observed mentions: 2025-07-22 13:21:29 UTC to 2025-08-14 15:35:00 UTC.

02462025-07-22 00:00:00 UTC to 2025-07-23 00:00:00 UTC (exclusive): 2 mentions; 1 submissions, 1 commentsJul 222025-07-23 00:00:00 UTC to 2025-07-24 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-07-24 00:00:00 UTC to 2025-07-25 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-07-25 00:00:00 UTC to 2025-07-26 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 comments2025-07-26 00:00:00 UTC to 2025-07-27 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-07-27 00:00:00 UTC to 2025-07-28 00:00:00 UTC (exclusive): 7 mentions; 0 submissions, 7 comments2025-07-28 00:00:00 UTC to 2025-07-29 00:00:00 UTC (exclusive): 2 mentions; 1 submissions, 1 comments2025-07-29 00:00:00 UTC to 2025-07-30 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2025-07-30 00:00:00 UTC to 2025-07-31 00:00:00 UTC (exclusive): 2 mentions; 1 submissions, 1 comments2025-07-31 00:00:00 UTC to 2025-08-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-08-01 00:00:00 UTC to 2025-08-02 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-08-02 00:00:00 UTC to 2025-08-03 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsAug 22025-08-03 00:00:00 UTC to 2025-08-04 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-08-04 00:00:00 UTC to 2025-08-05 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-08-05 00:00:00 UTC to 2025-08-06 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2025-08-06 00:00:00 UTC to 2025-08-07 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-08-07 00:00:00 UTC to 2025-08-08 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-08-08 00:00:00 UTC to 2025-08-09 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-08-09 00:00:00 UTC to 2025-08-10 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-08-10 00:00:00 UTC to 2025-08-11 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-08-11 00:00:00 UTC to 2025-08-12 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-08-12 00:00:00 UTC to 2025-08-13 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-08-13 00:00:00 UTC to 2025-08-14 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-08-14 00:00:00 UTC to 2025-08-15 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsAug 14

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Jul 222025-07-22 00:00:00 UTC2025-07-23 00:00:00 UTC211
Jul 232025-07-23 00:00:00 UTC2025-07-24 00:00:00 UTC000
Jul 242025-07-24 00:00:00 UTC2025-07-25 00:00:00 UTC000
Jul 252025-07-25 00:00:00 UTC2025-07-26 00:00:00 UTC110
Jul 262025-07-26 00:00:00 UTC2025-07-27 00:00:00 UTC000
Jul 272025-07-27 00:00:00 UTC2025-07-28 00:00:00 UTC707
Jul 282025-07-28 00:00:00 UTC2025-07-29 00:00:00 UTC211
Jul 292025-07-29 00:00:00 UTC2025-07-30 00:00:00 UTC101
Jul 302025-07-30 00:00:00 UTC2025-07-31 00:00:00 UTC211
Jul 312025-07-31 00:00:00 UTC2025-08-01 00:00:00 UTC000
Aug 12025-08-01 00:00:00 UTC2025-08-02 00:00:00 UTC000
Aug 22025-08-02 00:00:00 UTC2025-08-03 00:00:00 UTC000
Aug 32025-08-03 00:00:00 UTC2025-08-04 00:00:00 UTC000
Aug 42025-08-04 00:00:00 UTC2025-08-05 00:00:00 UTC000
Aug 52025-08-05 00:00:00 UTC2025-08-06 00:00:00 UTC101
Aug 62025-08-06 00:00:00 UTC2025-08-07 00:00:00 UTC000
Aug 72025-08-07 00:00:00 UTC2025-08-08 00:00:00 UTC000
Aug 82025-08-08 00:00:00 UTC2025-08-09 00:00:00 UTC000
Aug 92025-08-09 00:00:00 UTC2025-08-10 00:00:00 UTC000
Aug 102025-08-10 00:00:00 UTC2025-08-11 00:00:00 UTC000
Aug 112025-08-11 00:00:00 UTC2025-08-12 00:00:00 UTC000
Aug 122025-08-12 00:00:00 UTC2025-08-13 00:00:00 UTC000
Aug 132025-08-13 00:00:00 UTC2025-08-14 00:00:00 UTC000
Aug 142025-08-14 00:00:00 UTC2025-08-15 00:00:00 UTC101

What Hacker News says

17 sources
I am still reading the paper, but it is worth noting that this is not an LLM! It is closer to something like AlphaGo, trained only on ARC, Sudoku and mazes. I am skeptical that you could add a bunch of science facts and programming examples without degrading the performance on ARC / etc - frankly it’s completely unclear to me how you would make this architecture into a chatbot, period, but I haven’t thought about it very much. Comparing the maze/Sudoku results to LLMs rather than maze/Sudoku-specific AIs strikes me as blatantly dishonest. “1k Sudoku training examples” is also dishonest, they generate about a million of them with permutations: https://news.ycombinator.com/item?id=44701264 (see also https://github.com/sapientinc/HRM/blob/main/dataset/build_su... And they seem to have deleted the Sudoku training data! Or maybe they made it p
Read the rest
rivate. It used to be here: https://github.com/imone and according to the Git history[1] they moved it here https://github.com/sapientinc but I cannot find it. Might be an innocent mistake; I suspect they got called out for lying about “1000 samples” and are hiding their tracks. [1] https://github.com/sapientinc/HRM/commit/171e2fcde636bcb7e6c...
In Hierarchical Reasoning Model – 1k training samples SoTA reasoning v/s CoT
Yeah, the results look incredible indeed. That's why I and many others here have decided to download, review, and test the code published by the authors.[a] If their code doesn't live up to their claims, we will all ignore their work and move on. If their code lives up to their claims, no one can argue with it. In my experience, when authors publish working code, it's usually a good sign. --- [a] https://github.com/sapientinc/HRM
In Hierarchical Reasoning Model
sapientinc/HRM: Hierarchical Reasoning Model: https://github.com/sapientinc/HRM : > [...] Inspired by the hierarchical and multi-timescale processing in the human brain, we propose the Hierarchical Reasoning Model (HRM), a novel recurrent architecture that attains significant computational depth while maintaining both training stability and efficiency. HRM executes sequential reasoning tasks in a single forward pass without explicit supervision of the intermediate process, through two interdependent recurrent modules: a high-level module responsible for slow, abstract planning, and a low-level module handling rapid, detailed computations. With only 27 million parameters, HRM achieves exceptional performance on complex reasoning tasks using only 1000 training samples. The model operates without pre-training or CoT data, yet achieves nearly
Read the rest
perfect performance on challenging tasks including complex Sudoku puzzles and optimal path finding in large mazes. Furthermore, HRM outperforms much larger models with significantly longer context windows on the Abstraction and Reasoning Corpus (ARC), a key benchmark for measuring artificial general intelligence capabilities. These results underscore HRM’s potential as a transformative advancement toward universal computation and general-purpose reasoning systems. "Hierarchical Reasoning Model" (2025) https://arxiv.org/abs/2506.21734 .. https://news.ycombinator.com/item?id=44699452 (9 hrs ago)
In New AI architecture delivers 100x faster reasoning with just 1,000 examples
The authors' code is at https://github.com/sapientinc/HRM . In fields like AI/ML, I'll take a preprint with working code over peer-reviewed work without any code, always, even when the preprint isn't well edited. Everyone everywhere can review a preprint and its published code, instead of a tiny number of hand-chosen reviewers who are often overworked, underpaid, and on tight schedules. If the authors' claims hold up, the work will gain recognition. If the claims don't hold up, the work will eventually be ignored. Credentials are basically irrelevant. Think of it as open-source, distributed, global review. It may be messy and ad-hoc, since no one is in charge, but it works much better than traditional peer review!
In Hierarchical Reasoning Model
If I understand this correctly, it learns the rules of Sudoku by looking at 1,000 examples of (puzzle, solution) pairs. It is then able to solve previously unseen puzzles with 55% accuracy. If given millions of examples, it becomes almost perfect. This is apparently without pretraining of any sort, which is kind of amazing. In contrast, systems like AlphaZero have the rules to go or chess built-in, and only learn the strategy, not the rules. Off to their GitHub repository [1] to see this for myself. [1] https://github.com/sapientinc/HRM
In Hierarchical Reasoning Model

Showing the 15 most recent of 17 sources. Enable JavaScript to search and browse every indexed mention.

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.