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?

Marque – Domain Registrar on the AT Protocol

A New Register Allocator for ZJIT

Hermes Desktop – One-Click Installer for the Nous Research Hermes Agent

IBM commits $5B to secure open-source software

We need to own our computing experience

The Anatomy of an LLM

You can now use your Gmail account in Proton Mail

Show HN: Shaderbang – Shebang for Shaders

Machine Media: The Death of the Open Web

Midday – Open Source Invoicing, Time Tracking, File Reconciliation, Storage, etc

Motorola stops its phones from hijacking the Amazon app, which was 'unintended'

Money Printer Pro – Open-source AI content generator

Claude Opus 4.8 coming today?

Show HN: Electrical Grid Mapping Launchpad

DeepSeek-OCR Visualized

Show HN: Generate Claude Code Workflows using Spec Driven Development approach

Understand Vision Language Models

Show HN: AT4K Launcher - Apple TV inspired Launcher for Android TVs

Racket v9.2 is now available

Dirk and Linus discuss AI and kernel development

The lost Doves Type: A Thames mystery solved

Back from 1 week in SF from Paris

The Problem with the Ferrari Luce EV Offers a Lesson for Every Leader

OLM to PST Converter PDS OLM to PST Converter

Norway will come under France's nuclear umbrella

China works on AI token futures market

The Thirty-Million-Line Problem (2015)

Show HN: Open-source tool for deploying applications to K8s/OpenShift

The Witcher 3: Wild Hunt – Songs of the Past Announced

Show HN: Reassign – a 24-hour dial for planning your day