Packed Data Support in Haskell

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

77•matt_d•9mo ago

Comments

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

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

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

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

cstrahan•9mo ago

No, one example of why being variable sized integers.

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

carterschonwald•9mo ago

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

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

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

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

How AI trained on birds is surfacing underwater mysteries

DirectStorage LLM Weight Streaming: 4x faster loading, MoE expert streaming

Exploring D&D 5th Edition Monster Features Using Julia

Toyota Developing a Console-Grade, Open-Source Game Engine – Flutter and Dart

GPT-5.3-Codex review after 4 days of use

Alphabet lines up 100-year sterling bond sale

AI Took over the Super Bowl, Accounting for 23% of Ads

Discord Is Not an Acceptable Choice for Free Software Projects (2020)

Show HN: Brood– an image-first design tool for iterating on visual ideas

Daily YouTube Digest for Your AI Agents

Luce: First Electric Ferrari. Designed by LoveFrom

Algorithmic Underwriting: The shift toward individual risk in health insurance

Large Language Model Reasoning Failures

Random driving on a 78-qubit processor reveals controllable prethermal plateau

I created a tool to help visualiza infrastructure interdependencies

CA Sues Gatalog for distributing computer code for 3D printing firearms [pdf]

Meta Distinguished Eng (IC9) on Influencing Engs, Failures, and Learnings [video]

100 Days of Sex: Day 108

Querystudio – A open-source database studio

Show HN: 3D Modelling in CSS

Build tiny, fast desktop apps with Bun

Effect of Novel Hypoglossal Stimulation on Airflow, Airway Collapsibility in OSA

Massie Threatens to Reveal Epstein Client Names If Bondi Won't Unredact Them

Discord Alternatives, Ranked

Illinois man pleads guilty to hacking Snapchats to steal nude photos

Carl Sagan's 1994 "Lost" Lecture: The Age of Exploration [video]

Another GitHub outage in the same day

US companies accused of 'AI washing' re: job losses

Testing Ads in ChatGPT

Linux servers that let you ditch the public cloud and reclaim your privacy