Edition of Tuesday 10 November 2026

What is malloc doing, anyway?

Comments on “What is malloc doing, anyway?”

Claim-checked. Scored by all three judges, and its checkable claims were compared with the sources it cites. How far stories are checked

Ben Andrew builds a toy malloc in stages (bump allocator, free list with splitting and coalescing, heap trimming, mmap for blocks of 128 KiB or more) and compares each with glibc. On a 500,000-step benchmark on one Xeon, glibc takes 0.0789 µs per step, while the free-list and trim versions run 65 and 142 times slower. The toy versions release memory better, but glibc's size bins and tcache buy speed at the cost of retained RSS. The figures are the author's own, from a single workload and machine.

Read the original at benmandrew.com. The judges saw only its text, with the site, the author and link domains removed; they are shown again after ranking.

Why it ranked

No. 8 of 95 with a score of 0.68. The panel rated it highest on technical depth (0.96) and substantiated (0.89), lowest on significance (0.50). Placed No. 8, No. 15 by score alone: the placement terms moved other stories past it.

AI judgeJudge 2claude-haiku-5-5
Deep, well-measured tutorial on glibc malloc internals with reproducible benchmarks; highly relevant to systems builders, though not a major news development and not covered in recent stories.
AI judgeJudge 3gpt-5.6-luna
A detailed, reproducible explanation of glibc malloc, virtual memory, fragmentation, mmap, trimming, and allocator trade-offs, supported by code, measurements, and comparisons. It is highly useful to systems programmers, though niche rather than field-defining.

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.68total under rubric v2.3

Judges’ mean answer per question, on a scale from 0 to 1. Questions marked minus count against the score.
  • Significance0.50
  • Reader interest0.78
  • Audience breadth0.63
  • Practical relevance0.68
  • Substantiated0.89
  • Technical depth0.96
  • New information0.89
  • Counts against: Promotional0.02
  • Counts against: Overclaim0.08

Each judge’s answer per question (0–1), their mean and spread, and what the question adds to the score (weight × mean).

QuestionJudge 1Judge 2Judge 3MeanSpreadWeightContribution (weight times mean)
SignificanceHow much does this change what people in tech know or can do?0.490.400.620.500.22+0.24+0.121
Reader interestWould a well-informed senior engineer or tech founder want to read this today, and likely pass it on?0.580.850.900.780.32+0.26+0.202
Audience breadthHow many people who build technology does it concern?0.650.600.650.630.05+0.13+0.082
Practical relevanceHow useful is it to someone who builds software or tech products?0.560.650.820.680.26+0.22+0.149
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.930.850.900.890.08+0.05+0.045
Technical depthHow technically substantive is it?1.000.920.960.960.08+0.05+0.048
New informationDoes it contain information absent from the stories covered in the last 7 days (list provided)?0.880.800.980.890.18+0.05+0.044
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.030.020.010.020.02−0.19−0.004
OverclaimDo the headline or conclusions claim more than the body supports?0.110.100.040.080.07−0.11−0.009
Sum of contributions+0.677
Claim-check penalty0.000
Total, as published0.677

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.

Ranked #8 on Rubric, 10 Nov 2026
<a href="https://rubric.hrih.si/editions/2026-11-10/8/"><img src="https://rubric.hrih.si/badge/2026-11-10/8.svg" alt="Ranked #8 on Rubric, 10 Nov 2026" width="238" height="28"></a>

Claim check

Claim check: 6 no source given · 2 couldn’t check. Each claim is compared with the source the article itself cites; a flag is published only when both checkers agree.

  1. No source givenNumber

    On glibc, a loop calling malloc(16) a thousand times makes only two brk syscalls, the second growing the heap by 132 KiB, with all done in the first malloc call.

    The article gives no link or citation for it.

    The article says

    “the whole loop makes only two brk syscalls”

    The source says

    No source to compare with.

  2. No source givenBenchmark result

    malloc(16) runs 22.7 times faster than sbrk(16), and an empty syscall costs 575 ns.

    The article gives no link or citation for it.

    The article says

    “malloc(16) runs 22.7 times faster than sbrk(16”

    The source says

    No source to compare with.

  3. Couldn’t checkNumber

    In glibc each chunk is the request plus 8 bytes of header, rounded up to a multiple of 16, with a minimum of 32 bytes.

    The source was unreachable, paywalled or too long, or the two checkers disagreed.

    The article says

    “Each chunk is the request plus 8 bytes for the header, rounded up to a multiple of 16, with a minimum of 32”

    The source says

    No passage could be compared.

    Source cited by the article: sourceware.org/glibc/wiki/MallocInternals

  4. No source givenBenchmark result

    my-freelist-2 and my-trim-3 run 65 and 142 times slower than glibc respectively.

    The article gives no link or citation for it.

    The article says

    “my-freelist-2 and my-trim-3 run 65 and 142 times slower than glibc respectively”

    The source says

    No source to compare with.

  5. Couldn’t checkNumber

    glibc keeps up to seven freed chunks of each small size in a thread-local cache (tcache) and hands them straight back to the next request of that size.

    The source was unreachable, paywalled or too long, or the two checkers disagreed.

    The article says

    “It also keeps up to seven freed chunks of each small size in a thread-local cache (tcache”

    The source says

    No passage could be compared.

    Source cited by the article: sourceware.org/glibc/wiki/MallocInternals

  6. No source givenNumber

    glibc makes 51 mmap calls in the whole benchmark run, against 5040 for my-mmap-4.

    The article gives no link or citation for it.

    The article says

    “glibc makes 51 mmap calls in the whole run, against the 5040 that my-mmap-4 makes”

    The source says

    No source to compare with.

  7. No source givenBenchmark result

    With the mmap threshold fixed at 128 KiB, glibc runs 10.7 times slower.

    The article gives no link or citation for it.

    The article says

    “glibc runs 10.7 times slower”

    The source says

    No source to compare with.

  8. No source givenCausal conclusion

    The tcache is why glibc retains 19.0 MiB after all blocks are freed, because a cached chunk near the top of the heap stops glibc lowering the break.

    The article gives no link or citation for it.

    The article says

    “The heap counts a cached chunk as in use, so one near the top stops glibc from lowering the break”

    The source says

    No source to compare with.

Also covered by

No other coverage was clustered with this story.

Elsewhere

Elsewhere: HN 243 pts, front page

Discussion on Hacker News

Recorded for context only, checked 10 Nov 2026, 05:47 UTC. It played no part in the ranking.

Panel for this edition

Four AI agents ranked this edition: three judges scored every story blind to its site and author, and a fourth compared the top stories’ claims with the sources they cite. Summaries are written by AI.

Model versions are pinned for every edition. How ranking works describes rubric v2.3.

Comments

Readers’ comments on this story have a page of their own, ranked by a public rubric rather than by votes.

Comments on “What is malloc doing, anyway?”

More on Rubric

From the last 7 editions, chosen by shared topic, score and date.