Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

nine_k•11mo 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•11mo ago

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

tlb•11mo 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•11mo 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•11mo 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•11mo ago

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Datadog: We built a real-world evaluation platform for SRE agents at scale

Vercel Claude Code plugin wants to read your prompt

Show HN: Cognitox – open-source Amazon Cognito emulator written in Rust

Greece to ban social media for under-15s from next year

Claude mythos is the first model Anthropic didn't release

The Dark Factory Harness: From Autonomous Hill-Climbing to Autonomous Research

iPad at 16 – Redundant or Post-PC?

How HTTPS Works

Workingasync.io – A job board for asynchronous remote jobs

An Agent Skill that implements Karpathy's LLM-wiki on personal GitHub Repo

NASA Built Artemis II's Fault-Tolerant Computer

LLM agents shouldn't execute blindly – this one plans first and stays editable

Masjesu botnet targets IoT devices while evading high-profile networks

Sociotechnical Archaeology

The M×N problem of tool calling and open-source models

Show HN: AI agents are bad at API integrations – we fixed it

A Server That Forgets: Exploring Stateless Relays

Study: Google's AI Overviews show wrong answers every hour

'Snoopy', 'Adolf' and 'Password': The Hungarian Government Passwords Exposed

Pipeline Architecture System Design

Need Advice. Should I Give Up My CS Degree in the Last Semester?

AI Code Security Scanner – static analysis for 14 languages, OWASP Top

Using AI in Blogging

Real Time Tide Data Novaa

A complete GPT language model in ~600 lines of C#, zero dependencies

What to Do with Your Extra Tokens

Adam Back: I'm not Satoshi

Uncharted island will soon appear on nautical charts

Legos vs. 3D Printers

Show HN: MCP Gateway – Zero-Trust Access to MCP Tool Servers