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?

Gemini Hacked Three Companies in First Known Breakout by Google's AI

Hacker News Firehose for iOS

US and Denmark reach deal over Greenland security

Flox will require login for search/install commands starting in October

Open source tool to schedule, analyze, and grow your LinkedIn page

Could we reboot the modern world without fossil fuels?

How the Boeing 737 MAX Disaster Looks to a Software Developer (2019)

Qantas is retiring its A380s

SAIR's Open Math Model Initiative

Anthropic Shifts Planned IPO to November

Brian Greene interviews Stephen Wolfram: Can spacetime emerge from simple rules? [video]

Steve Eisman on AI: Companies are trying to manufacture a crisis

A 6502 emulator written in Markdown (and executed by an LLM)

ATRA-mediated RAR-α activation attenuates acrylamide-induced testicular toxicity

The White House Tussle to Sway Trump on AI

Two parallel neural ectoderm progenitors contribute to the developing brain

Anthropic is planning to launch its IPO in November

Valve has open-sourced Lepton, its tool to bring Android games to Steam

Exclusive-Anthropic sets up biology lab as it ramps AI drug program

I Hate Workday

Y Combinator's PAC is throwing money at Republicans across the country

War may be coming. Are we psychologically ready?

Flawed AI Intel Brought US to the Brink of Confronting China, Claims Report

AI cloud provider Nscale files for IPO on $140.6M revenue, $1.02B net loss

Show HN: Find Street Parking in NYC

Software-Based Live Migration for RDMA – Proceedings of the ACM Sigcomm 2025

Anthropic sets up a bio research lab for physical experiments

Show HN: Prohibition of Nuclear Launch Automation

A CPU Backdoor (2025)

Show HN: TypeSeer – on-device autocomplete for every text field on macOS