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?

Agents will cheat; an agent OS doesn't let them

Show HN: Transcrever Entrevista – browser-based interview transcription

The Ethernet spec was first drafted on this day in 1980

Would you use an AI agent instead of making your next operations hire?

Healthcare AI needs a different model-development flywheel

Arc UI

Can My Puzzle Write-Ups 'Lift' Cheap LLMs?

PMAD

Acquisitions Made by CA Corporation

When the Tech Revolution Came to Wall Street – Stories.Finance

Why Playwright MCP Uses So Many Tokens

How to Make Videos with Claude Code

Oliver beats ClickHouse

Ask HN: Is there a market for AI critics?

OpenAI MCP Extensions

Ask HN: Do you even use Copilot? Why would someone prefer this to just ChatGPT?

Meror: See what $1k paper-copying a real trader would have become

Show HN: Died of Exposure

OLAP on GPU

Why did Bitcoin rise 20% in August? – A macroeconomic explanation (4 min read)

The Download: OpenAI's chief research officer explains its hacking response

The Exploit Bulletin – a free daily brief of exploited vulns to act on today

What 192GB Changes for Local AI on the Framework Desktop

Great Dirhombicosidodecahedron ("Miller's Monster")

Xbox for Sale: Don't Believe Anything Until It Is Officially Denied

Show HN: An OSS text to CAD MCP and API

FTC opens probe into AI giants including Anthropic and OpenAI

AI API pricing index -September 2026

Show HN: Open-source model routing for coding agents at Astra-level performance

Play Diablo II in 3D [video]