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?

ARP Tell your network to explain itself

Palantir patient data tech rejected by many NHS trusts in England

Germany's 17M Immigrants: Where They Come From

Language Models Can Reduce Asymmetry in Information Markets (COLM 2024)

Japan to launch world-first mission to collect samples from Martian moon

US Air Force pilots used malware-laden USB drives to plan Afghanistan missions

OutreachSheet – Gmail outreach and scheduled follow-ups in Google Sheets

Weball: Play Katamari on Websites

How the AI boom might end: 5 scenarios

Show HN: Independent LLM benchmark index tracking 22 frontier models

Uh filter Claude Code plugin

Rerecord: Docs Screenshots as Text

Ask HN: ATS devs or recruiters, applicant using email addresses like duck.com?

Alien Breed 3D HD: Out Now [video]

A self-disinfecting fabric eliminates bacteria, fungi and viruses

Show HN: CallSitter – bot that answers my calls and wastes scammers' time

MNT Pocket Reform Laptop – MNT Research Shop

Kosmos 2612 and ICEYE-X36: a worrisome cat-and-mouse-game in Space

How Far Will AI Assistants Go for a Refund They Can't Get?

Show HN: A 3D catalog of rocket engines you can take apart

Show HN: APIFlow Studio – A browser API client with local mock responses

From 'I want my own harness' to corporate sponsorship

Una Watch TOTP – MFA on your wrist!

Show HN: I built a smart audiobook converter that sounds human (not KokoroTTS)

How to Make Your Own Flying Car AI Video (Make a Tesla Roadster AI Video)

Show HN: CardChase, recover failed subscription charges before they churn

CVE-2026-55562 PoC?

Ask HN: How to speed up code-reviews?

A New Way to Think About Borrow Checking (In Reverse)

ODS: NHS Organisational Data as Parquet Files