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?

How to Build an AI Chat Endpoint in Node.js with the Telnyx AI Assistants API

We Built a New Editor. Want to Try It?

Library Song

Rare copy of US Declaration of Independence found by volunteer in UK archives

The AI Superforecasters Are Here

Show HN: Scopewalker, an MCP server for codebase complexity metrics

Wordgard: The new in-browser rich-text editor from the creator of ProseMirror

Show HN: Numbword – a daily word game where letters add up to a target

30-Second Cherry Trick Sleep Formula Explained

Check any website up/down Status?

The mathematical secrets of Barcelona's Sagrada Familia

EU Parliament temporarily defies Chat Control

SmrtLnks – Cheaper Bitly link shortener that routes by GEO, dynamic QR included

India asks WhatsApp to pause username feature rollout over fraud concerns

JPEG-XL Libjxl 0.12 Brings More Performance Optimizations

Multiple Linux tarballs return 404 on kernel.org

Alibaba to ban Claude Code in workplace over alleged backdoor risks, source says

Half-Baked Product

How eveRy webSite is tRacking you 24/7. SiTe STaMpS

Giotto.ai: "A Swiss lab with European heart"

ECTC 2026 Roundup, Intel, TSMC, SK Hynix, Samsung, Micron, Marvell, Lightmatter

Nobody Reads the SQL Anymore

'guix substitute' and 'guix pull' Vulnerabilities

I replaced my GitHub runners with Lambda MicroVMs, and maybe you should too

NVCF: Deploy and Route GPU-Accelerated AI Workloads at Scale

Amazon's Mechanical Turk to stop accepting new customers

Action Preflight: consequence-aware admission for LLM agent actions

Exploring Nix for Enterprise Teams

Global gridded population datasets underrepresent rural population (2025)

The Law of Leaky Abstractions (2002)