01 · Roasts
The README Strike
6 repos scored, 6 repos with HAS_README=no. Not one. Single. README. Even a one-liner 'this is a BST' would have been an improvement over the void.
Algorithm Graveyard
rbtdeletion, rbtinsertion, binarysearchtree, hashtable, GraphCreator, shuntingyardredo — you've built an entire data structures textbook, one abandoned file at a time, for a combined total of 1 star.
'Forgot to do using namespace std'
You committed the comment 'forgot to do using namespace std' into binarysearchtree. That's not a commit message, that's a confession.
The Ghost Profile
0 followers, 0 following, 0 PRs, 0 issues — GitHub sees you, but nobody else does. soloPct: 100%. You are a lone wolf who has never howled.
Swift Ghost
Swift is 54% of your codebase by bytes — yet zero Swift repos were public enough to score. Where are the iOS apps? In the drafts folder, presumably.
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% weight55D
- Quality20% weight23F
- Depth15% weight20F
- Breadth10% weight55D
- Community10% weight5F
03 · Stats
365-day commit heatmap
39 active days
Language distribution
- Swift54%
- C++16%
- Python14%
- HTML9%
- CSS4%
- Shell2%
- Other1%
04 · Numbers
Owned repos
non-fork
20
Commits
last 12 months
80
Followers
0
Joined GitHub
Dec 2023
05 · Top repos
divyanshguptawork /
rbtdeletion
Educational C++ Red-Black Tree implementation with insert, search, and deletion. Single 450-line file, no tests, no CI, no documentation. Personal learning project with minimal adoption potential.
divyanshguptawork /
binarysearchtree
Educational BST implementation in C++ (12 MB, 4 commits in 2 days). No README, tests, CI, or documentation; single cpp file with basic insert/remove/search and interactive CLI menu.
divyanshguptawork /
GraphCreator
Single-file C++ graph data structure CLI with Dijkstra's algorithm. No README, tests, CI, license, or git hygiene. Fresh repo (4 days old) with minimal commit activity (4 of last 30).
divyanshguptawork /
rbtinsertion
Single-file Red-Black Tree implementation in C++. Educational project with no README, tests, CI, or documentation; minimal adoption potential (0 stars/forks). Shows competent algorithm implementation but lacks production-readiness artifacts.
divyanshguptawork /
hashtable
Small C++ hashtable implementation with basic student management. Single file, untyped C++, no tests, docs, CI, or license. 6 KB codebase shows educational scope only.
divyanshguptawork /
shuntingyardredo
Single-file C++ implementation of shunting yard algorithm with expression tree traversal. No tests, docs, CI, or license. Minimal scope (~150 LOC) created in single session (50 min), appears to be educational exercise.
06 · Timeline
- Dec 28, 2023Joined GitHub
- Feb 13, 2026Created hashtable
- Mar 30, 2026Created binarysearchtree
- Apr 15, 2026Created rbtinsertion
- Apr 30, 2026Created shuntingyardredo
- May 6, 2026Created rbtdeletion
- May 18, 2026Created GraphCreator
- May 28, 2026Most recent push to rbtdeletion
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.