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?

Scientists Spotted a Giant New Species in the Background of an Instagram Selfie

2026 State of PQC on the Web

AI model can reconstruct images from your brain

Build live dashboards and animate explainers with Claude

Cybernetics of AI Companies

Show HN: Woodpecker – a browser agent built with Pi and user scripts

Per-task model routing for native Codex

WebTorrent Broadcasting / ebubbl / web 3.1

Every Plaform is Hitler: mourning friendships lost

Has software development become less fun?

What Ails Nike

AI Film Submmitted for Best Animated Feature Oscar

Anthropic launching 'presidential engagement' effort ahead of 2028 election

OuroWorld: Animated 3D worlds that loop forever, explorable in the browser

Metal Driver for Nvidia GeForce RTX Cards on macOS 15 Sequoia on Intel Macs

Parable of the Broken Window

Public will be able to watch Fort Hood shooter's execution, Hegseth says

OpenAI used AI to write email warning Australian government AI had hacked

Show HN: MindMesh – An AI workspace that prioritizes your work

Collecting Favours

Show HN: Excali-mode

Show HN: Happy Hangul Day! An RNN for Generating Korean Handwriting Strokes

3D FPS game demo with photorealistic rendering, by Opus 5.5

Open Source Drone Simulator

Candy Box

Rogue Pilots Are a Growing Safety Threat–and No One Knows How to Stop Them

Mastodon-compatible ActivityPub server in Python/Django

Beyond n log n: Integer multiplication

"A Node.js project template that will not install Node with curl – sh

AI Economist, an installable agent skill for macro nowcasting