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?

Transmute – a self-hosted file converter with a web UI and REST API

Ask HN: Why hasn't someone built a decentralized compute network?

Google Scholar's citation exporter silently drops single-letter surnames

Show HN: My OSINT dashboard with 60 feeds now has a pseudonymous P2P testnet

Emacs: Save any buffer as PDF (my new buffer-to-pdf package)

GSoC2026: What to expect (image editing, animation, 3D, and engineering)

Have online worlds become the last free places for children?

Stop Begging Extension for LibreOffice

Should we be scared of China's surpluses?

AI music is flooding streaming services – but who wants it?

Five Banana Lessons

Lilly, AI biotech Profluent ink $2.25B pact in search of genetic 'holy grail'

Porsche will contest Laguna Seca in historic colors of the Apple Computer livery

Some Important Numbers for Developers (2018)

The world's longest railway tunnel is being built under the Alps

Ask HN: Tips for Longevity, as a Software Engineer

Modern jet engine turbines: each blade a single crystal (2015)

Ask HN: Please, I need your help to try out an iOS app I work on

Alert-Driven Monitoring

ImagePrint 1.52 Released

CPU Work and GPU Work

Fisheries and Aquaculture

Show HN: Hello, World in many different languages

NOAA forecaster on how this year's El Niño could shatter records

I Have Lived in Your Camp

The Petroleum System Is Entering Its Volatile Decline Phase

Company said I could move and then changed their mind

Show HN: I made a simulator for personal finance (5 year update)

Custom Voices and Voice Library

I'm a late arrival to short-form video – its effect on my life has shocked me