01 · Roasts
Zero-star trilogy
vizier, llm-memory, and chessclaw each have 0 stars and 0 forks: solid work, currently playing to an empty stadium.
Test suite wearing a trench coat
chessclaw has extensive tree and compression tests, yet no README—users must infer the product from the evidence locker.
Polish backlog
All three analyzed projects lack CI and licenses; the code is shipping, but the guardrails missed the train.
Portfolio > audience
Three real products are on the board, but 4 followers and one PR this year leave the community signal mostly unclaimed.
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% weight30F
- Consistency20% weight35F
- Quality20% weight59D
- Depth15% weight55D
- Breadth10% weight55D
- Community10% weight25F
03 · Stats
365-day commit heatmap
103 active days
Language distribution
- Python59%
- JavaScript11%
- TypeScript9%
- HTML6%
- Solidity5%
- Swift5%
- Other5%
04 · Numbers
Owned repos
non-fork
13
Commits
last 12 months
59
Followers
4
Joined GitHub
Oct 2015
05 · Top repos
Ujjwal-N /
vizier
A substantial, well-documented chess/LLM evaluation harness with reproducible datasets, Stockfish/Maia/Lc0 baselines, tool-loop experiments, a viewer, and regression-heavy tests, but currently has 0 stars/forks and no demonstrated external adoption.
Ujjwal-N /
llm-memory
A documented personal MCP memory server with 9 markdown-file tools, strong pytest coverage, and careful path/section guardrails, but no stars, license, CI, or typed-language status.
Ujjwal-N /
chessclaw
A focused Lichess chess-analysis CLI with SQLite game sync, repertoire-tree construction, PGN export, and outcome-based compression; it has substantial tests but no documented adoption or release polish.
06 · Timeline
- Oct 9, 2015Joined GitHub
- Mar 19, 2026Created llm-memory
- Apr 12, 2026Created chessclaw
- Jun 30, 2026Created vizier
- Aug 21, 2026Most recent push to vizier
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.