01 · Roasts
Commit autobiography
The bio says “I don't commit enough”; 14 commits this year and a mostly blank heatmap refuse to dispute it.
Crypto lab, no release train
All three scored projects lack CI and a license, so the cryptography is more polished than the shipping process.
Star-powered prototype shelf
p256-proving-benchmark carries 10 of the profile's 21 stars; the other projects are still waiting for their audience.
Proof systems, proven patience
noir_poly packs NTTs and Cooley-Tukey butterflies into a 4-star library—serious machinery for a very small crowd.
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% weight33F
- Consistency20% weight25F
- Quality20% weight57D
- Depth15% weight50D
- Breadth10% weight55D
- Community10% weight25F
03 · Stats
365-day commit heatmap
25 active days
Language distribution
- Rust57%
- C15%
- C++12%
- Noir8%
- Jupyter Notebook3%
- JavaScript2%
- Other3%
04 · Numbers
Owned repos
non-fork
8
Commits
last 12 months
14
Followers
8
Joined GitHub
Aug 2021
05 · Top repos
vladfdp /
p256-proving-benchmark
A focused browser P-256 proving benchmark with Rust/WASM signing, Noir secp256r1 verification, and configurable UltraHonk/UltraPlonk measurements, but limited adoption signals and no tests or CI.
vladfdp /
noir_poly
A documented Noir polynomial library with parameterized coefficient/Lagrange types, NTT/INTT arithmetic, division, and extensive inline tests, but only 4 stars and no CI, license, or separate test suite.
vladfdp /
sat-we
A documented Rust proof of concept for SAT-based witness-like encryption, combining KZG commitments, BLS12-381 pairings, CNF formulas, and AES-GCM, with focused unit tests but no CI, license, or external adoption signals.
06 · Timeline
- Aug 7, 2021Joined GitHub
- Jan 10, 2025Created p256-proving-benchmark
- Mar 15, 2025Created sat-we
- Apr 12, 2025Created noir_poly
- Jun 17, 2025Most recent push to noir_poly
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.