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?

Rust in the Vibe Coding Era

Ask HN: A blog with heavy JavaScript to view – how?

Ask HN: Why is packages.ubuntu.com not being indexed by Google?

Hispano Suiza Carmen

ASM SHADER TOY – It's shader toy but you code in asm

Guix Proposed Consensus Document "Standing up for human crafting"

Show HN: Approve an AI agent's wire with Face ID,then watch a forged one fail

Chaining LLM and web bugs to Admin

Built SwiPR – swipe-to-review GitHub PRs with AI context

The Nerdy Escorts Cashing in on Silicon Valley's AI Boom

Some yes no questions about Trump, tech perspective

MCP security tracks API's playbook – we know how that ends

Quadratic funding democratizes allocation by rewarding projects w/ broad support

Firefox for Android's Play Integrity check hits custom ROMs

Copyright – Right Answer for Open Source Code, Wrong Answer for Open Source AI?

Ignore what everyone else is doing

Livestreaming Trilemma: HLS, WebRTC, MOQ

79% on LongMemEval: How We Beat Full-Context GPT-4 with a Local SQLite Database

Dealership revoked offer to buy back customer's BMW, blaming wayward AI chatbot

How We Automated Technical Implementation

Ask HN: What computer are you using for AI coding tools?

State of Brain Emulation Report 2025

Show HN: Bit Flip – Daily Coding Questions

What's New in WeatherMesh-6

Raress96/Dolby-Atmos-encoder: PoC Dolby Atmos encoder

ShinyHunters hacked 100 orgs by exploiting an Oracle PeopleSoft 0-day

Research Is Not Engineering at a Slower Speed

AI Cannot Desire

The Field Guide to Grid Lanes

SpaceX IPO Makes Elon Musk the First Trillionaire