01 · Roasts
Star economy
Crystalla owns 46 of the 50 total stars; the rest of the portfolio is still waiting for its opening act.
CI absenteeism
All three scored repos have CI=no. The tests exist; automation apparently missed the calendar invite.
Product range
A matrix library, SMS scheduler, and piano coach is a real portfolio—just not yet a consistently adopted one.
Archive wing
70% of owned repositories are stale, so the account has history depth with a noticeable layer of digital sediment.
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% weight41D
- Consistency20% weight55D
- Quality20% weight59D
- Depth15% weight50D
- Breadth10% weight80A
- Community10% weight50D
03 · Stats
365-day commit heatmap
193 active days
Language distribution
- Elm23%
- Ruby19%
- HTML18%
- TypeScript14%
- JavaScript11%
- Crystal6%
- Other9%
04 · Numbers
Owned repos
non-fork
27
Commits
last 12 months
348
Followers
76
Joined GitHub
Mar 2011
05 · Top repos
mverzilli /
cadence-piano-practice
Cadence is a documented, typed piano-practice web app with D1 persistence, guided workflow UI, validation, migrations, and rendering tests, but it is a same-day 0-star project with no CI or license and documented ownership gaps.
mverzilli /
crystalla
Crystalla is a documented Crystal numerical-methods library with a Matrix API, LAPACK/BLAS bindings, SVD/PCA support, and an MNIST example; it has modest adoption but substantial historical implementation scope.
mverzilli /
remember_me
A substantial Rails 3 SMS reminder application with polymorphic schedule models, IceCube calendar recurrence, Delayed Job delivery, and a broad unit/functional test suite, but little evidence of adoption beyond 2 stars and no CI or license.
06 · Timeline
- Mar 4, 2011Joined GitHub
- May 16, 2011Created remember_me
- Oct 26, 2015Created crystalla — Crystal library for Numerical Methods. It binds to LAPACK and is unashamedly inspired by Numpy.
- Aug 30, 2026Created cadence-piano-practice
- Aug 30, 2026Most recent push to cadence-piano-practice
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.