01 · Roasts
Burst Builder Extraordinaire
V2X_Simulator's entire 21-commit history happened in a 5-hour window. That's not development — that's a deadline panic speedrun. GitHub is not your emergency room.
algo.c Left the Chat
Your chess AI is literally truncated mid-function. The minimax loop doesn't finish. You shipped half a brain and called it 'multiple difficulty levels.'
40 Commits, 0 Followers, 0 Stars
A full year of GitHub activity and not a single person noticed. Your repos have less social proof than a blank profile page.
The Hermit Coder
0 PRs, 0 issues, 0 following. You've been on GitHub since October 2024 and have made zero contact with the outside world. Git is not a personal diary.
Self-Roasting README
You described your own chess algorithm as 'crappy' in the repo description. Respect for the honesty — zero for the follow-through on fixing it.
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% weight25F
- Consistency20% weight25F
- Quality20% weight47D
- Depth15% weight35F
- Breadth10% weight55D
- Community10% weight25F
03 · Stats
365-day commit heatmap
97 active days
Language distribution
- C52%
- Python47%
- Shell1%
- Makefile0%
04 · Numbers
Owned repos
non-fork
2
Commits
last 12 months
40
Followers
1
Joined GitHub
Oct 2024
05 · Top repos
AchilleTheux /
V2X_Simulator
Academic V2X traffic simulation with SUMO/TraCI integration, typed Python, tests, and deterministic multi-scenario support. Very recent (48h old), no external adoption but coherent educational codebase.
AchilleTheux /
chess
Personal chess game in C with SDL2 GUI and minimax AI. Brand new (created Oct 15, 2025), 3 commits total, ~234 KB codebase. Incomplete AI implementation (algo.c truncated mid-function), global state variables, minimal error handling, but shows working game logic with piece movement validation and multiple difficulty le
06 · Timeline
- Oct 12, 2024Joined GitHub
- Oct 15, 2025Created chess — A chess game with a crappy algorithm
- Apr 8, 2026Created V2X_Simulator — V2X Communication Simulator for the project
- Apr 8, 2026Most recent push to V2X_Simulator
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.