10k sounds, 64 mixer slots: how much work can a game audio engine skip?
Comments on “10k sounds, 64 mixer slots: how much work can a game audio engine skip?”
Claim-checked. Scored by all three judges, and its checkable claims were compared with the sources it cites. How far stories are checked
Sonic is a small Rust experiment by ssenthilnathan3 for scheduling 10,000 game sounds into 64 mixer slots without eagerly advancing every sound. It keeps distant sounds as virtual records that compute playback position from their start time, and it uses a spatial grid and an expiry heap to limit scheduler…
Why it ranked
No. 23 of 144 with a score of 0.62. The panel rated it highest on technical depth (0.94) and substantiated (0.91), lowest on audience breadth (0.44). Placed No. 23, No. 59 by score alone: the placement terms moved other stories past it.
- AI judgeJudge 2claude-haiku-5-5
- Detailed, measured engineering write-up of a Rust game audio scheduler with benchmarks and caveats; technically deep and substantiated, but niche in audience and a personal side project.
- AI judgeJudge 3gpt-5.6-luna
- A deeply instrumented Rust audio-engineering write-up with reproducible benchmarks, code-level design details, caveats, and failure modes. It is highly actionable for real-time systems, though its direct audience is mainly game-audio and performance engineers.
Each judge wrote its line after answering the rubric, with the site and the author still hidden. Every answer behind this is in the table under Score.
Score
0.62total under rubric v2.3
- Significance0.47
- Reader interest0.75
- Audience breadth0.44
- Practical relevance0.65
- Substantiated0.91
- Technical depth0.94
- New information0.90
- Counts against: Promotional0.04
- Counts against: Overclaim0.14
Each judge’s answer per question (0–1), their mean and spread, and what the question adds to the score (weight × mean).
| Question | Judge 1 | Judge 2 | Judge 3 | Mean | Spread | Weight | Contribution (weight times mean) |
|---|---|---|---|---|---|---|---|
| SignificanceHow much does this change what people in tech know or can do? | 0.47 | 0.30 | 0.65 | 0.47 | 0.35 | +0.24 | +0.114 |
| Reader interestWould a well-informed senior engineer or tech founder want to read this today, and likely pass it on? | 0.64 | 0.72 | 0.90 | 0.75 | 0.26 | +0.26 | +0.196 |
| Audience breadthHow many people who build technology does it concern? | 0.42 | 0.45 | 0.45 | 0.44 | 0.03 | +0.13 | +0.057 |
| Practical relevanceHow useful is it to someone who builds software or tech products? | 0.65 | 0.55 | 0.75 | 0.65 | 0.20 | +0.22 | +0.143 |
| SubstantiatedHow well is it backed? Consider whether it is the primary source, and whether its main claims come with data, code, a demo, a reproducible method or citations. | 0.99 | 0.80 | 0.95 | 0.91 | 0.19 | +0.05 | +0.046 |
| Technical depthHow technically substantive is it? | 1.00 | 0.88 | 0.95 | 0.94 | 0.12 | +0.05 | +0.047 |
| New informationDoes it contain information absent from the stories covered in the last 7 days (list provided)? | 0.86 | 0.90 | 0.95 | 0.90 | 0.09 | +0.05 | +0.045 |
| PromotionalIs it mainly marketing with little substance (a press release, ad or sponsored post with no real information)? A launch post that carries real news is not promotional. | 0.04 | 0.05 | 0.02 | 0.04 | 0.03 | −0.19 | −0.007 |
| OverclaimDo the headline or conclusions claim more than the body supports? | 0.25 | 0.15 | 0.03 | 0.14 | 0.22 | −0.11 | −0.016 |
| Sum of contributions | +0.625 | ||||||
| Claim-check penalty | 0.000 | ||||||
| Total, as published | 0.625 | ||||||
Spread is the highest minus the lowest judge answer. marks a spread above 0.40: the judges disagree, and the story is marked contested.
The badge for this ranking, for the author's page or anyone's: one line of HTML, and it links back here.
<a href="https://rubric.hrih.si/editions/2026-11-19/23/"><img src="https://rubric.hrih.si/badge/2026-11-19/23.svg" alt="Ranked #23 on Rubric, 19 Nov 2026" width="245" height="28"></a>Claim check
Claim check: 1 no source given · 7 couldn’t check. Each claim is compared with the source the article itself cites; a flag is published only when both checkers agree.
Couldn’t checkBenchmark result
At 10,000 spread sources, eager and lazy modes both sum 16,384 source-samples per block, yet their p99 render times differ by over 4×.
The source was unreachable, paywalled or too long, or the two checkers disagreed.
The article says “Eager and lazy both sum 16,384 source-samples per block, yet their p99s differ by over 4×”
The source says No passage could be compared.
Source cited by the article: ssenthilnathan3.github.io/blog/sonic/results/offline.csv
Couldn’t checkBenchmark result
At 100,000 spread sources, Sonic's lazy mode had a p99 of 89.22 µs versus 2,285.36 µs for eager mode, with no work overruns.
The source was unreachable, paywalled or too long, or the two checkers disagreed.
The article says “Lazy 64.98 µs 89.22 µs 233.19 µs 0 1.26% 12.70 MiB”
The source says No passage could be compared.
Source cited by the article: ssenthilnathan3.github.io/blog/sonic/results/offline.csv
Couldn’t checkNumber
When all 100,000 one-shots ended on block 16, lazy mode took 6.11–8.41 ms on that block while eager took 0.59–0.73 ms.
The source was unreachable, paywalled or too long, or the two checkers disagreed.
The article says “lazy took 6.11–8.41 ms on that block. eager took 0.59–0.73 ms on the same block”
The source says No passage could be compared.
Source cited by the article: ssenthilnathan3.github.io/blog/sonic/results/offline.csv
Couldn’t checkNumber
A two-thread ring test transferred one million ordered records in 63.6 ms (~15.7 million/s), with 528,785 full retries.
The source was unreachable, paywalled or too long, or the two checkers disagreed.
The article says “transferred one million ordered records in 63.6 ms (~15.7 million/s), with 528,785 full retries”
The source says No passage could be compared.
Source cited by the article: ssenthilnathan3.github.io/blog/sonic/results/queue.csv
Couldn’t checkBenchmark result
With a 2,048-event dispatch cap, lazy's worst render across the three burst runs fell from 1,069 µs to 109 µs, with 97,952 starts processed late.
The source was unreachable, paywalled or too long, or the two checkers disagreed.
The article says “lazy’s worst render across the three burst runs fell from 1,069 µs to 109 µs”
The source says No passage could be compared.
Source cited by the article: ssenthilnathan3.github.io/blog/sonic/results/capped.csv
Couldn’t checkNumber
In a pinned 400-block replay, lazy had two paced misses without a competitor and three with a hashing process on the same CPU, despite zero callback-body overruns in the contended run.
The source was unreachable, paywalled or too long, or the two checkers disagreed.
The article says “there were three paced misses despite zero callback-body overruns”
The source says No passage could be compared.
Source cited by the article: ssenthilnathan3.github.io/blog/sonic/results/pinned-contended.csv
Couldn’t checkNumber
In a five-second muted CPAL/ALSA run at 10,000 sources, callback body times were 69.88 µs p50, 472.17 µs p99 and 697.84 µs max, 1,112 of 1,118 callbacks were not 256 frames, and ALSA logged three underrun recovery notices.
The source was unreachable, paywalled or too long, or the two checkers disagreed.
The article says “69.88 µs p50, 472.17 µs p99 and 697.84 µs max”
The source says No passage could be compared.
Source cited by the article: ssenthilnathan3.github.io/blog/sonic/results/device.txt
No source givenNumber
In the two-voice fixture, 53 hard switches produced a maximum adjacent-sample step of 0.743, and with the tail/ramp enabled the switching-boundary measurements were exactly zero.
The article gives no link or citation for it.
The article says “53 hard switches produced a maximum adjacent-sample step of 0.743 in normalized PCM”
The source says No source to compare with.
Also covered by
No other coverage was clustered with this story.
Elsewhere
Elsewhere: HN 1 pts, not on front page
Recorded for context only, checked 19 Nov 2026, 05:47 UTC. It played no part in the ranking.