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?

Virgins, Unicorns and Medieval Literature (2017)

Show HN: Sentinel Core – Open-source AI video search with real-time dashboard

Show HN: I built a way for my family to access my accounts in an emergency

Show HN: PolyClaw – An Autonomous Docker-First MCP Agent for PolyMCP

YouTube adds new hurdles for ad blockers, and there's currently no way around it

Peer-Reviewers in the Coal Mine?

Contrepreneurs: The Mikkelsen Twins [video]

TIL: Docker Log Rotation

Chronic Pain: The Science of Unlearning Pain

Amodei suggests OpenAI doesn't "understand the risks they're taking"

Semantic ablation renders AI writing generic, boring and dangerous

The Cyber Arms Trade: How Commercial Spyware Is Reshaping Global Security

Show HN: YOPJ – Local AI coding agent with 8-layer security sandbox (no cloud)

Orion for Windows is taking shape

Justifying Text-Wrap: Pretty

Semantic Firewall v3: A Practical Audit Layer for AI

Open source Agent Testing (BSL 1.1)

The Essential Economics of Nigeria's Okrika Industry (2023)

Flynn Effect

Show HN: Open-source, SDK-first email infrastructure built for agents

Browse Code by Meaning

Retrocomputing (2020)

Show HN: Multi-provider iOS usage alerts for AI subscription caps

Height-Safe Peptides for Muscle Growth

The AI pro­ductiv­ity take-off is finally vis­ible

San Francisco's 24-Hour Diner Stops the Cosmic Clock (2023)

Large language models provide unreliable answers about public services

Why Didn't AI Replace Novelists?

Get a portable monitor, they're great

Hilbert Map of IPv6 address space