Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

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

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

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•8mo ago

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

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

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

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

TI-99/4A: Leaning More on the Firmware

From Language to Cognition: How LLMs Outgrow the Human Language Network

From Patch Cables to MIDI CC: Modular Thinking in Music Software

How Can I Make Useful Knowledge? On trying to be useful with words

How to design a new language that can be spoken, written, and read in 30 minutes

Cracking DXP and SXD

AI Contributions to Erdős Problems

Remembrance of Things Past (1759)

Going Founder Mode on Cancer

China builds a record-breaking hypergravity machine to compress space and time

Bags and the Creator Economy

Why Preserve Books? The New Physical Archive of the Internet Archive (2011)

Qualcomm Windows 11 on Arm SBC for <$80

Nearly 5M Accounts Removed Under Australia's New Social Media Ban

U.S. News & World Report v. OpenAI, Inc. (1:25-cv-09912)

Automating Screenshots with Claude Code

Show HN: Whisper – AI code reviewer that catches security issues and bugs

The Human in the Loop

Ella Minnow Pea: A Progressive Lipo-Grammatic Epistolary Fable

The Enshittification of Enshittification

Show HN: DownloadStuffs – Fast UI for Browsing and Downloading Internet Archive

The quick brown fox jumps over the lazy dog

Ultrathink is deprecated & How to enable 2x thinking tokens in Claude Code

Vibe Working with Code Agent

Sam Altman's blind spot on AI model power

AI systems that don't just make decisions, but remember and use the "why"

I want my MTV Rewind

Practical scripts for automating doc-generation regardless of tools

The Coming Industrialisation of Exploit Generation with LLMs

Show HN: Meepr – A Quiet Social Network