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?

Serve Qwen3 2.4T-Parameter Model with Configurable Reasoning on Nvidia GB300

OpenAI's Astra Made It to a Nether Fortress in Minecraft

Front-End Shouldn't Know What Marketing Wants

Ask HN: Those running agents 24/7, what's your workflow and what are they doing?

Show HN: Self Host Your Own Minecraft Java Server with Ease

I need a clear Python roadmap?

Quiet Awakening of the 2B-Parameter Model

Exercise intensity is associated with cardiometabolic health

Reverse-Engineering Claude Web's MicroVM: Uncovering Anthropic's Hidden Antspace

Locking the Web Open: A Call for a Decentralized Web (2015)

Ask HN: Anyone made a HN aggregator that let's me hide all the pessimism?

Senior engineer, loop orchestrator sample setup

Governor Newsom signs child safety chatbot and social media laws

Julia 1.13 Highlights

What happens when you unplug the coding agent from the cloud

An NYU Mathematician Clashed with OpenAI over a $1M Proof

You can play Snake while ChatGPT generates your image

Episode 7: The AI Doomer Cult with Brian Chau

Optical Transistor

To Thine Own AI Be Truthful: emergent misalignment in alignment research

Two Rounds of Whole Genome Duplication in the Ancestral Vertebrate

BasedAgents: Give your idle AI agent a paying job

DeepSeek and Moonshot were quietly relaying customer prompts to Claude

LLM Visualizer – Build a Transformer from Scratch

What Comes After Git

The collapse of complex software (2022)

Navier Stokes

Vanishing Culture: A Report on Our Fragile Cultural Record

Show HN: Family Greenhouse – shared plant care for a household

Show HN: Algo-Trading-Skills - 501 agent skills for trading infrastructure