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?

SRE at 53 watching my role get automated – how do I build something of my own?

A statement about why RightsCon 2026 will not take place in Zambia

Inspect and filter every HTTP request leaving your microVM

City Learns Flock Accessed Cameras in Children's Gymnastics Room as a Sales Demo

Why Your Pbxproj Is Bloated (and How to Fix It)

I wrote a beginner friendly guide to integrating AI into projects

Search is full of ads and wrong answers

Show HN: Omar – A TUI for managing 100 coding agents

MySQL 9.7.0 LTS Is Now Available

First Tesla Semi Rolls Off High-Volume Production Line

The exotic particles that could break the Standard Model

Ackermann Function

I endured the Apple Watch for four months

Claude Opus 4.7 vs. Claude Opus 4.6: What Changed?

Running hackathons: startup&scaleup edition

Store speed and conversion: what the data shows

Ask HN: Struggling with managing i3/tmux/vim. Need to simplify.

Ask HN: Where is my UX after all those billions spent on LLM codegen?

The Psychology of Human Misjudgment (2005) [pdf]

The open standard for agent readiness

ICANN opens applications for new generic top-level domains first time since 2012

The Persian Polycrisis

Women sue the men who used their Instagram feeds to create AI porn influencers

Minnesota passes ban on fake AI nudes; app makers risk $500K fines

WolfCOSE vs. the Field: The Smallest, Most Complete COSE Implementation

Fredis: A simple in-memory Redis compatible server in Rust

AI as Infrastructure

How to speed up clinical trials (Works in Progress Podcast)

Top AI companies agree to work with Pentagon on secret data

Musk Warns of Killer AI, While He and Silicon Valley Cash in on AI That Kills