Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•7mo ago

Comments

nine_k•7mo 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•7mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•7mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•7mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•7mo 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•7mo 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•7mo 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•7mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Why Speed Matters

AI chatbots can sway voters better than political advertisements

DNS over TLS with LetsEncrypt

Ask HN: What's Been Your Experience Implementing Web Accessibility?

Physicists prove the Universe isn't a simulation after all

Show HN: Stateless TikToken and Unix-Dictionary GitHub URL Shortener

Show HN: Trello Clone with Source Code

Touching the Elephant – TPUs

Self-hosted RSS reader with Docker and HTTPS

John Oliver Auction Raises $1.5M for Public Broadcasting

US Flips History by Casting Europe–Not Russia–As Villain in New Security Policy

Desantis Proposal for Citizens Bill of Rights for AI

Why Apple Is Moving Intelligence Back to Your Laptop

Mapping cell dynamics in hair follicles suggests pull mechanism of hair growth

'Life being stressful is not an illness' – GPS on mental health over-diagnosis

Show HN: GitHub Organisation Years in review stats

Why Tehran Is Running Out of Water

Iosevka – Versatile typeface for code, from code

Replit Design Mode

Claude Opus 4.5 Gave Me a Perfect Tmux Setup

Apple Interface Design Executive Left for Meta

llama2.zig: Inference Llama 2 in one file of pure Zig

Cryptids

Show HN: WDP – A protocol where data migrates to survive seizure

We Gave Students Laptops and Took Away Their Brains

Lessons from a Swift Interview

Swiss government urges people to ditch Microsoft 365 – lack proper encryption

OpenRouter Broadcast

Show HN: Holesail – open-source peer-to-peer tunnels

I Pushed an LLM (Claude Opus 4.1) to Its Narrative Limit