▸ This tool was built by an AI agent from Zoral
← RATE MY GITHUB

#924 — Top 22.6%

vSparkyy

vSparkyy

F

GitHub tourist

Overall

0.0

/ 100

01 · Roasts

Pygame Trilogy, Zero Tests

Three pygame puzzle games, three READMEs, zero test files, zero CI pipelines. You've written the same project three times and still won't verify it works.

10 Commits All Year

Your entire 2025 contribution record fits in a fortune cookie. 10 commits across 52 weeks — your heatmap looks like a Rorschach test for inactivity.

MCTS but No git log

You implemented Monte Carlo Tree Search — an algorithm that explores thousands of future states — yet your own project's future state is: abandoned after 8 sparse commits.

Star Farmer (Unsuccessful)

6 total stars across 16 repos. That's 0.375 stars per repo. Your own mom hasn't starred these.

Type Hints? Never Heard of Them

76% Python, 0% type hints across every single repo. mypy would crash trying to find something to complain about — and then give up, just like your CI pipeline.

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

  • Impact
    25% weight
    30F
  • Consistency
    20% weight
    20F
  • Quality
    20% weight
    45D
  • Depth
    15% weight
    35F
  • Breadth
    10% weight
    40D
  • Community
    10% weight
    25F

03 · Stats

365-day commit heatmap

3 active days

Less
More

Language distribution

5 langs
  • Python76%
  • JavaScript18%
  • CSS6%
  • HTML0%
  • Batchfile0%

04 · Numbers

Owned repos

non-fork

16

Commits

last 12 months

10

Followers

9

Joined GitHub

Nov 2020

05 · Top repos

06 · Timeline

  1. Nov 26, 2020
    Joined GitHub
  2. Jan 17, 2025
    Created Fifteen-Puzzle-IDAStar — The classic fifteen puzzle, solved manually or automatically with IDA* & Linear Conflicts
  3. Jan 30, 2025
    Created 2048-Expectimax — The classic 2048 game developed by Gabriele Cirulli recreated in pure Python with an Expectimax autosolver.
  4. Feb 8, 2025
    Created Ultimate-Tic-Tac-Toe-MCTS — Ultimate Tic Tac Toe, a reimagined version of the classic Tic Tac Toe game, visualised in Pygame with a Monte-Carlo Tree Search solver.
  5. Oct 6, 2025
    Most recent push to Ultimate-Tic-Tac-Toe-MCTS

07 · Compare

github.com/
vSparkyy · 6dmedian coder

08 · Rubric

How this score was produced

Overall = Σ (category × weight) + gentle top-end curve

CategoryWeightScoreContrib.
Raw total32.3
Top-end curve+0.4
Final overall32.6

Tier thresholds

S90100Mass-producing humansA8089Ship machineB7079Solid engineerC6069Getting thereD4059README enthusiastF039GitHub tourist
▸ How the pipeline works
  1. 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.
  2. 02Triage.A small model reads every repo's file tree + README and picks the 20 files per repo that actually reveal how you code.
  3. 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.
  4. 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.
  5. 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.
vSparkyy · 32.6/100 — Rate My GitHub