01 · Roasts
The Heatmap Is a Desert
52 weeks of data, roughly 8 non-zero cells. Your GitHub contribution graph looks like someone spilled a few pixels on a blank canvas. 36 commits in a year isn't a cadence — it's a pulse check.
README? Never Heard of Her
All three analyzed repos: README=no, CI=no, LICENSE=no. You've got 5 languages on your profile but apparently zero time to type '# My Project' into a markdown file.
AoC Tourist
Ocaml_AoC stopped at day 8. Day 8. Out of 25. The AoC graveyard is full, but most people at least make it past the first week before rage-quitting.
Zero Stars, Zero Forks, 22 Repos
22 public repos. 0 total stars. 0 total forks. That's not a portfolio — that's a personal filing cabinet that accidentally became public.
4 PRs, 0 Issues, 0 Following
You opened 4 PRs this year and follow exactly 0 people. GitHub is a social platform and you're treating it like a USB drive.
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% weight15F
- Consistency20% weight20F
- Quality20% weight25F
- Depth15% weight25F
- Breadth10% weight65C
- Community10% weight25F
03 · Stats
365-day commit heatmap
8 active days
Language distribution
- C#33%
- Python19%
- C++19%
- OCaml13%
- HTML9%
- CSS6%
- Other1%
04 · Numbers
Owned repos
non-fork
22
Commits
last 12 months
36
Followers
5
Joined GitHub
Dec 2019
05 · Top repos
RiMiDo420 /
Ocaml_AoC
Personal Advent of Code practice project in OCaml with 8 daily solutions (day1–day8). No README, tests, CI, or license. Typed OCaml code with modest algorithmic complexity but minimal documentation and structural organization across isolated problem files.
RiMiDo420 /
Circular_doubly_linked_list
One-off circular doubly-linked list data structure implementation with unit tests but no documentation, minimal commits, and zero community adoption.
RiMiDo420 /
Algorithms_2_supervision_code
Empty scaffold: 1 KB repo, 1 commit in 30 seconds, no README, no tests/CI/license. Single C++ file with basic graph algorithms (DFS, BFS, Dijkstra) — appears to be submission scaffold for a supervision exercise.
06 · Timeline
- Dec 20, 2019Joined GitHub
- Dec 2, 2025Created Ocaml_AoC — I'm doing advent of code in ocaml to practice it
- Feb 22, 2026Created Algorithms_2_supervision_code
- Mar 9, 2026Created Circular_doubly_linked_list
- Mar 9, 2026Most recent push to Circular_doubly_linked_list
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.