01 · Roasts
Ghost Heatmap
49 of 52 weeks on your heatmap are pure zeros. Your GitHub contribution graph looks like a flatline monitor — appropriate for repos that are mostly dead on arrival.
Sprint-and-Abandon
Every single one of your 8 repos was built in a 5–10 day sprint then dropped. Easy21: 5 days. FrozenPolicyGym: 5 days. hallway5RL: 1 day. You code like you're fleeing a burning building.
Building-Micrograd is a vibe, not a repo
Building-Micrograd is 0 KB, 0 files, and 0 commits. You named an auto-diff engine and then refused to write a single line of code. The description is doing more heavy lifting than the implementation.
README Runaround
6 of 8 repos technically have a README, but FrozenPolicyGym's is literally just '# FrozenPolicyGym' — one line. That's not documentation, that's a sticky note on an empty box.
0 Stars, 0 Forks, 0 PRs, 0 Issues
Total community engagement: 2 stars (one of which may be self-inflicted), 0 PRs, 0 issues, 0 followers. You're shipping RL experiments into a void that even the void isn't interested in.
Built using
Zoral
Shadows one worker for a week, then takes over their job with zero extra setup. Behaves exactly like the original.
zoral.ai
02 · Category breakdown
- Impact25% weight48D
- Consistency20% weight55D
- Quality20% weight36F
- Depth15% weight35F
- Breadth10% weight25F
- Community10% weight5F
03 · Stats
365-day commit heatmap
18 active days
Language distribution
- Jupyter Notebook70%
- Python30%
04 · Numbers
Owned repos
non-fork
8
Commits
last 12 months
33
Followers
0
Joined GitHub
Oct 2021
05 · Top repos
Benswe /
Synch-vs-Asynch-DP
Educational project comparing synchronous vs asynchronous dynamic programming algorithms (Policy Iteration, Value Iteration, In-Place VI, Prioritized Sweeping) for MDP solving. Well-documented with clear algorithm explanations but minimal adoption (1 star, no external users).
Benswe /
Tennis-Point-Strategy-RL
Educational RL mini-project implementing MC, Q-learning, and SARSA(λ) on a tennis rally simulator with a 6-feature state space. Clean implementation but lacks tests, CI, type hints, and formal documentation beyond README. Early-stage (~10 commits in 10 days).
Benswe /
Easy21
Educational reinforcement learning project implementing Easy21 blackjack variant with Monte Carlo and TD(λ) learning algorithms. Untyped Python code with no tests, CI, or license; minimal README.
Benswe /
Sutton-Barto-Chapter-2-Exercise-Solutions
Single Jupyter notebook implementing Sutton-Barto Chapter 2 exercise solutions with reinforcement learning code. Minimal documentation, no tests/CI, experimental scope.
Benswe /
FrozenPolicyGym
Early-stage reinforcement learning grid world implementation with policy iteration algorithms. 7kb codebase across 5 files (2 substantive), 7 commits in 5 days. No tests, CI, license, or type hints.
Benswe /
The-Computer-Always-Wins-Solutions
Exercise solutions for "The Computer Always Wins" book. Five untyped Python algorithm implementations (maze solvers, N-Queens, word ladder) with flat structure, no tests/CI, minimal docs, and single-week development. Experimental learning project.
Benswe /
hallway5RL-optimal-policy-
Personal educational RL project implementing policy iteration on a 1D gridworld environment. Single untyped Python file (hallway5RL.py) with no tests, CI, or documentation beyond inline comments.
Benswe /
Building-Micrograd
Empty scaffold with no commits, files, or documentation. Created 2026-06-26 with zero recent activity, no README, tests, CI, or meaningful structure.
06 · Timeline
- Oct 5, 2021Joined GitHub
- May 18, 2026Created hallway5RL-optimal-policy- — MDP grid-world environment to practice using RL bellman equation techniques.
- May 18, 2026Created FrozenPolicyGym
- Jun 7, 2026Created Synch-vs-Asynch-DP — Speed comparison of Synchronous vs Asynchronous programming to solve MDPS.
- Jun 8, 2026Created The-Computer-Always-Wins-Solutions — Solutions for the book: "The Computer Always Wins"
- Jun 15, 2026Created Tennis-Point-Strategy-RL
- Jun 19, 2026Created Easy21
- Jun 22, 2026Created Sutton-Barto-Chapter-2-Exercise-Solutions — Solutions to all exercises in chapter 2 of the RL bible
- Jun 26, 2026Created Building-Micrograd — Small auto-diff tool in python/numpy
- Jun 26, 2026Most recent push to Building-Micrograd
07 · Compare
08 · Rubric
How this score was produced
Overall = Σ (category × weight) + gentle top-end curve
Tier thresholds
▸ How the pipeline works
- 01Scrape.Pull every non-fork repo pushed in the last 90 days, plus your contribution calendar, followers, and language byte counts — straight from GitHub's REST & GraphQL APIs.
- 02Triage.A small model reads every repo's file tree + README and picks the 20 files per repo that actually reveal how you code.
- 03Grade each repo. All repos run in parallel through a fast scoring model that reads the picked files and rates each one independently on Impact, Quality, and Depth — with evidence citations.
- 04Aggregate. A larger reasoning model combines the per-repo scores with server-computed stats (heatmap, commit cadence, language entropy, follower count) to produce the 6-dimension profile score + roasts.
- 05Correct.Deterministic server-side checks enforce anchor-scale floors (e.g. a profile with 2,000+ public commits can't score 30 Consistency) and recompute the final verdict.
~90 seconds per profile, ~$0.25 in compute. Total of ~240 files read across your top-12 repos. One rating per GitHub account per day.
▸ Data sources & caveats
- Heatmap & commit totals: GitHub GraphQL
contributionsCollection— covers the last 365 days, includes private repos when the user has opted in (default). - Language %: byte totals across the top 30 owned non-fork repos.
- Curve: a small upward nudge centered on raw score ≈ 70, capping at 100. Prevents specialists from being unfairly penalised for narrow breadth.
- Anchor corrections: when server-measured signals (e.g. privateWorkLikely, multiRepoVolume, follower count) mandate a minimum category score, the aggregation step enforces it. These are signal-conditional, not identity-based floors.