plt
for rust developers, language designers
Why this scored 0
every term, weightedIts fastest-moving item, measured against the pace of its own source
Whether that velocity is itself speeding up, as a per-hour rate
How many independent communities its own items come from
Decays to zero over 14 days, counted from when we first saw it
Subtracted once something is big and old — sized by its biggest item, aged from when we first saw it
Weights are hand-tuned, not learned — we're calibrating them against realized trends as history accumulates. On an entity's first sighting there's no previous reading to compare against, so acceleration starts from a neutral prior rather than a measurement, and velocity falls back to engagement over its whole lifetime until a second reading exists. Full methodology
Signal history
7-day window (free)The evidence
The live items this entity's score aggregates — every community independently talking about it right now. This is the corroboration, shown, not claimed.
- 119
Almost Always Unsigned (2022)
lobstersSteady 2 · c102d ago - 219
Odin 1.0 Announcement
lobstersSteady 2 · video104d ago - 318
Signed Integers By Default
lobstersSteady104d ago - 416
The Unreasonable Effectiveness of Constructive Data Modeling
Data modeling technique · for data scientists
lobstersSteadydata83d ago - 514
Mechanized type inference for record concatenation
lobstersSteady104d ago - 613
two case studies of NaN
lobstersSteady102d ago - 713
Reducing Assumptions, Exploding Your Code
lobstersSteady106d ago - 812
Forlorn Hope of Fortran Modernisation
lobstersSteady105d ago - 910
NoiseLang: Where N = 5 is a Dirac delta
lobstersSteady103d ago - 1010
Borrow Checking Zero-Cost Cyclic Mutability
Zero-cost cyclic mutability improves borrow checking without runtime overhead. · for rust developers, language designers
lobstersCoolingdevtools1h ago