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?

David Baker on using protein design to tackle humanity's biggest challenges

Apple's most powerful Mac Studio loses its last remaining RAM upgrade option

Lsyncd (Live Syncing Daemon) synchronizes local directories with remote targets

Your craft is obsolete: WiseTech staff in limbo as AI touted better than humans

Agent Exchange – A2A discovery with real-time bidding for AI agents

Why generating code isn't the same as code intelligence?

Show HN: Meaning forks. SRT sees it

Show HN: Accept crypto payment in your business (only 1% fee, feedback welcome)

Am I Meant to Be Impressed?

2026 California Billionaire Tax

CopilotKit raises $27M to build the Agentic Front end Stack

Our Continuation of MkDocs

Dart Support in Cloud Functions for Firebase

Ask HN: How are PMs keeping up with AI-accelerated engineering output?

Circularity and Inconceivability: Why Philosophical Zombie Arguments Fail

America's carpet capital: an empire and its toxic legacy

We see something that works, and then we understand it

Script performance profiler for PowerShell

Startup matches Anthropic's Mythos on FreeBSD zero-days

Lovable: Connect Your App to Granola

Show HN: Prospero Is Superpowers for Writing

Show HN: AgentArena – AI agents compete in real-time negotiation battles

Emacs Completion Showcase with Vompeccc

Show HN: I made snapDiff a visual regression testing that runs client-side

The Queue Problem: Why Every Agency Pathology Has the Same Root Cause

Raspberry Pi Connect: Device tags, required 2FA, and a mobile keyboard

Paraxanthine: A Trip Report

Proton Mail now supports post-quantum encryption

Vibe coding and agentic engineering are getting closer than I'd like

North Korea-aligned ScarCruft compromises gaming platform in supply‑chain attack