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?

'Viking' was a job description, not a matter of heredity: Ancient DNA study

Ask HN: I've started using Coolify, any recommendations?

West Virginia sues Apple over child sex abuse material stored on iCloud

Panther – a scripting language designed for cybersecurity workflows

Bisq Decentralized Bitcoin

Show HN: Virtual Protest Protocol – Scaling activism via 50-person cells

Run Claude in a Podman Container

Harness engineering: leveraging Codex in an agent-first world

Show HN: I built a tool to send ArXiv papers to Kindle unharmed

Show HN: Snap n Eat – a food tracker using AI and chatbot

The Museum of Abandoned Ideas

Show HN: Graph-Based Firebase Alternative with Real-Time Sync

The original proposal of the WWW, HTMLized

Half of Jury Pool in Musk Trial Tossed After 'So Many' Said They 'Hate' Him

Chris Lattner: Claude C Compiler

China is running the EV playbook on humanoid robots – and it's working

Snake Game as a C Program Compiled into Each Frame

Accenture tells staffers: If you want a promotion, use AI at work

Show HN: MarketInsights – Your on-demand market research analyst

I built a tool that tells you NOT to build your startup idea – DontBuild.It

A Comprehensive Analysis of Hazardous Additives in Headphones

Keeping Google Play and Android app ecosystems safe in 2025

Show HN: Wordy – Learn languages from real movie and TV clips with quizzes

Reliable UIs Even with Language Models

Show HN: CodeLayers – See your codebase's dependency layers in 3D

Show HN: Elecxzy – A lightweight, Lisp-free Emacs-like editor in Electron

Hold on to Your Hardware

Firefox removes the support for Windows 7 users

How KIP-881 and KIP-392 Reduce Inter-AZ Networking Costs in Classic Kafka

Ask HN: What (other) jobs do you think of doing?