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?

Parsing Unicode graphemes is not easy

Express Course

Sunlight night: US startup's demo of lighting Earth from space draws criticism

Ask HN: What QoL improvements have you made while doing "agentic" SWEngineering?

Meet The AI Agents Trying to Be Real-Life Journalists

Ask HN: How to report IP abuse to Cloudflare?

Highlighting What Changed: A Go Diff-Mask for AI Agent Screenshots

Show HN: HypeSeoul – AI-painted isometric map of Seoul that runs on Seoul time

Forced myself to use codex desktop app

Ask HN: Has anyone used Phoenix, Langfuse, or OpenObserve?

A small change in your Rails app that can save some money and time

Trump Likes It? NZ Election Edition

A small, grumpy desk creature that keeps notes while you are away

Show HN: 600+ Web Assets. Scroll for free inspiration...

What Is 'You Can See Everything' About?

MCP-warden local credential broker so AI agents never see your secrets

Roblox downloaded 145GB models from us (including adult content) without asking

Original Affluent Society

Daily Orbs

Gforth 1.0

The good old days (of programming)

DeepSeek reportedly raises $15B days after US restrictions

Hey, Y Combinator - What will happen to humans?

Grok deepfake case reopened after Bureau reporting

Gems of DuckDB 2.0.0

Simple NetBSD Webserver

GDPR change lets companies train AI on Europeans' personal data without consent

Keeping API keys out of our AI agent's sandbox, and what that doesn't solve

Show HN: Ulak – Run Docker without a local Docker daemon

OpenLDK: Bringing the Java World into Common Lisp