01 · Roasts
Test-free trilogy
All three scored repositories report HAS_TESTS=no and HAS_CI=no: every experiment is currently a trust fall.
The 20-star headliner
training_models_from_scratch supplies 20 of the visible headline stars, while the most substantial research repo has 1.
Burst-mode contributor
445 yearly commits are real output, but the heatmap is mostly blank outside a handful of high-intensity weeks.
Portfolio, not perimeter
Adam has thoughtful theme persistence and responsive UI, yet ships without a README, license, or automated guardrails.
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% weight55D
- Quality20% weight40D
- Depth15% weight50D
- Breadth10% weight65C
- Community10% weight40D
03 · Stats
365-day commit heatmap
44 active days
Language distribution
- HTML61%
- Jupyter Notebook21%
- Python18%
- DM0%
04 · Numbers
Owned repos
non-fork
16
Commits
last 12 months
445
Followers
20
Joined GitHub
Apr 2024
05 · Top repos
Brokttv /
Robustness-Superposition
A focused, documented PyTorch research reproduction with configurable adversarial-training experiments, metric extraction, and pickle-backed analysis, but only 1 star and no visible tests or CI limit adoption and engineering confidence.
Brokttv /
training_models_from_scratch
A documented MIT educational NumPy project implementing linear regression, logistic regression, and a small ReLU network, but with only 20 stars, no tests or CI, and at least one broken training entry point.
Brokttv /
Adam
A one-file personal HTML portfolio with polished responsive styling, theme persistence, typography, collapsible sections, and inline SVG/UI behavior, but no documentation, tests, CI, license, or typed structure.
06 · Timeline
- Apr 15, 2024Joined GitHub
- Jun 23, 2025Created training_models_from_scratch — Training tiny models from scratch using NumPy in code and linear algebra on a piece of paper.
- Jun 1, 2026Created Robustness-Superposition — code for my research paper: "Why Does Robustness Reduce Superposition?"
- Aug 3, 2026Created Adam
- Sep 2, 2026Most recent push to training_models_from_scratch
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.