Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•1y ago

Comments

nine_k•1y ago

> Introducing the ‘packed’ data format, a binary format that allows using data as it is, without the need for a deserialisation step. A notable perk of this format is that traversals on packed trees is proven to be faster than on ‘unpacked’ trees: as the fields of data structures are inlines, there are no pointer jumps, thus making the most of the L1 cache.

That is, a "memory dump -> zero-copy memory read" of a subgraph of Haskell objects, allowing to pass such trees / subgraphs directly over a network. Slightly reminiscent of Cap'n Proto.

90s_dev•1y ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•1y ago

They mention this in the article.

spockz•1y ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•1y ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•1y ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•1y ago

> the serialised version of the data is usually bigger than its in-memory representation

I don’t think this is common. Perhaps for arrays of floats serialized as JSON or something. But I can’t think of a case where binary serialization is bigger. Data types like maps are necessarily larger in memory to support fast lookup and mutability.

nine_k•1y ago

I suppose all self-describing formats, like protobuf, or thrift or, well, JSON are bigger than the efficient machine representation, because they carry the schema in every message, one way or another.

IsTom•1y ago

If you use a lot of sharing in immutable data it can grow a lot when serializing. A simple pathological example would be a tree that has all left subtrees same as the right ones. It takes O(height) space in memory, but O(2^height) when serialized.

gitroom•1y ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•1y ago

This was very well written. Excellent article!

NetOpWibby•1y ago

Is this like MessagePack for Haskell?

Ask HN: Is ageism in tech still a problem in 2026?

Machines that think, Part 3: embodied intelligence

AI: Lot of "Hideous" Code but Found Bottlenecks for Faster Linux Compilation

27.5KB language-agnostic WebGPU syntax highlighter

US to ban Canadian dairy, alcohol, motor vehicle imports on September 29

The spy who betrayed his country for 'Viagra'

China's used EV crisis: Why dealers reject 5-year-old electric cars

WHO validates Bhutan for eliminating dog-transmitted human rabies

Continual Harness: Online Adaptation for Self-Improving Foundation Agents

Show HN: Full feature ECS game engine for TypeScript

'Star Trek' Endures for the Next Generation, and the Next, and the Next

Explain this to me like im 5 years old

Client-side developer security tools that run with zero telemetry

Orionx Shutdown Raises Fresh Questions on Trust, Custody and Crypto Risk

Codex silently begs agents to make arbitrary web requests

Cerebras's Laser Focus on Latency and Throughput

Wrangling blockchain RPC nodes, for dummies: Introducing Lasso

I resigned from Anthropic today

Source code for small iOS app to show real-time charge rate, thermals, etc.

Bessent Dares Traders to Bet Against Yen: 'I Am the House Now'

Ask HN: Would you hire a new engineer, or get 300k worth of tokens for the team?

A Harvard PhD Is Designing Schizophrenia Drugs in His Garage with ChatGPT

Show HN: Browser-based Nginx config generator with live preview

MCP for Official Wildfire Incidents

The universal language of space is Star Trek? Mais oui

The Growing Push to Ban Superintelligent AI

What I learned gathering nootropic ratings

Where Understanding Stops Scaling

ChatGPT Voice has been brutally nerfed

Bullshit arguments about AI (not) replacing jobs (2023)