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?

Scentronic: AI–assisted olfactory interface for remote odor transmission

Ebola has spread from Congo to 4 other countries. A look at where things stand

Meta strikes deal to protect Zuckerberg from California billionaire tax

Open Language Models – Nathan Lambert

UK man juggled five remote government jobs

Advice You'll Get Is the Advice You've Heard

Should you give the scarcest things to the fastest coders?

Ask HN: How has your company adapted interviews in the AI world?

MiniForth – A small Lean tutorial for programming language semantics

ML Drift: Next-Gen GPU AI/ML Inference at the Edge

Learn Calculus by Coding in Python – Ed Pratowski (2025)

Terraform 2026 Update

I can't believe PowerShell is good

Prometheus, a Gift Link Search Engine

Aulico: A TradingView Alternative

Attendee – open-source API for building meeting bots

Defense Against the Super-Worms (2025)

NSA Advisory

GL650 updated to cover Red Hat Satellite 6.19 with RHEL 10 managed hosts

AI agent on your notch, equipped with his own computer

Flapping Airplanes

NPM is experiencing degraded package install and publishing

Show HN: Agent Middleware – permits and signed receipts for agent tool calls

I have an issue with what agets affirm, do you have too?

Shame HN: Distracted Driving on Tesla FSD

Rara Avis

Left to Write (1 of 3): Adaptive Keyboards for One-Handed Users

Ask HN: What is the advantage of PHP over C?

Nokia, T-Mobile and Nvidia complete first AI-RAN call

Show HN: Statement Proof – PDF bank statement to CSV, proved or refused