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?

Video: A Brief Overview of the Atari 800XL

Show HN: Yet another music player but written in Rust

Apple's Latest Attempt to Launch the New Siri Runs into Snags

GLM 5 – The Next-Gen Frontier

Iran's Digital Surveillance Machine Is Almost Complete

Deleted doesn't mean gone: How police recovered Nancy Guthrie's doorbell footage

A few design decisions for a new chat platform

Apple withholds 18.7.5 security update from iPhones and iPads supporting iOS 26

Building Modern Databases with the FDAP Stack

TypeScript 6.0 Beta

Three Conversations Worth Having with Your CTO

Microwave Oven Failure: Spontaneously turned on by its LED display (2024)

Show HN: Codingagents.md – The open directory for AI coding agents

You Don't Need It

Singing the Gospel of Collective Efficacy

So I Got an EEG

Show HN: DetectZeStack – REST API to detect any website's technology stack

I Vibe Coded a Game to the Front Page of Hacker News

FDA refuses to review Moderna's application for mRNA flu vaccine, company says

Show HN: Unpack – a lightweight way to steer Codex/Claude with phased docs

How Talking to a Rubber Duck Made Me a Better Developer

Sam 3: a unified foundation model for promptable segmentation in images/videos

Fyrox Rust Game Engine 1.0 Release Candidate 2

What is wrong with ChatGPT and this Harry Potter Question

From Muscle to Matrix

Are AI replicas of the dead an innovative medical tool or an ethical nightmare?

Intel cancelling Tower Semi co-manufacturing deal

Fontemon

Paragon accidentally uploaded a photo of its spyware control panel

The Death of Traditional Testing: Agentic Development Broke a 50-Year-Old Field