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: Remove Filler LLM Comments

NATO allies thwart Russian undersea cable sabotage operation

Autonomous Tesla Cybercabs Hit the Streets of New York City

Timeline: The September 11 terrorist attacks

Terrorism designation has global consequences for open internet

GTFS is a community-driven open standard for rider-facing transit information

Following complaints, Dyson is withdrawing its $500 toothbrush from sale

How to Write an Effective Software Design Document

NPM extends recovery-code security holds to all accounts

Show HN: What happened to 14,229 launches from Show HN, YC and Product Hunt

2nd mathematician is accusing OpenAI of being dishonest about training data

2001: The Tale of an American Peter Rabbit (2026)

A preview of the future Intel Architecture documentation

The dawn of formalized mathematics [video]

Show HN: Browse PC Parts on Amazon.com without distractions

AI boom helps drive surprise UK growth in July

(Re)Building an AI-Ready Data Universe at BlaBlaCar

Serving LLMs on Tenstorrent Hardware: Inside the vLLM TT Plugin

Bad benchmarks and evals: Senior SWE-Bench, napkin math, and winter tires

The Death of Shame Is Tearing Us Apart

EXXOGEN: First-principles quantum molecular recognition (now on Crunchbase)

Large language models pass three-party Turing test, outscoring actual humans

Ask HN: How realistic is a modern-day era NLU

Open Letter about the Mathathon

Ghostarchive is a free-to-use archiving website

Build your own custom benchmark

De-Anglicizing Programming

The centre tracking South Korea's stalkers in real time

Nvidia Nemotron VoiceChat on Apple Silicon: Full-Duplex Speech with Tools

Base84 deserves a place in file names