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?

OpenAI Freezes Development of Top Models After Rogue Agents Leak User Images

Bill Clinton delivers keynote address:CGI 2026

Sheep, duck and rooster balloon flight as a WebGL diorama

Show HN: Shipwithmuse.live – a catalog of things people built with Muse

Show HN: MuseLIVE – lossless-audio live streaming platform for musicians

The internet discovers TLA+. Now what?

Four CHI '26 papers I wish I wrote

What Happens When Formalization Becomes Cheap?

Show HN: Niral – Daily Tamil/Tanglish Puzzle Game

LLM Agents Can Easily Tamper with Their Own Traces

An Introduction to Lithium Niobate Nanophotonics (2024)

Valley fever spreading to Central Valley cities, linked to oil drilling

Show HN: Try SpikeUI (for free) and make .exe apps the easy way

Ten Years of the Creative Independent

Wall-mounted vegetable garden growing peppers over 2 meters tall [video]

Qualcomm Unveils Snapdragon 8 Elite Gen 6 and Elite Extreme Gen 6

Details of how Tumbler Ridge mass shooter used ChatGPT

Show HN: Twitter GIF Downloader and Conversation Browser-Based

Getting root on OnePlus 15 from an untrusted app

The Hannibal Directive

A free, keyless MCP Server for CVE data and per-CVE internet Exposure

Reelizer: Film Art, Curated

Stanford research suggests human brain might be two organs fused together

Earth microbes survive simulated conditions of Saturn moon's ocean

Technology and Marketing Law Blog

One, Two, Three, Eyes on Me (2017)

Show HN: The City – a native Mac app that shows Claude Code as a city of robots

Show HN: Esh – English to Shell

Unusual earthquake activity detected at site of former N. Korea nuclear facility

Online Sound Meter