Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•7mo ago

Comments

nine_k•7mo 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•7mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•7mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•7mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•7mo 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•7mo 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•7mo 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•7mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Police Sketch Maker

The end of the kernel Rust experiment

The Night People vs. "Creeping Meatballism"

Understanding how to take things forward

Wireless device 'speaks' to the brain with light

UMass Amherst Researchers Create Nanoparticle Vaccine That Prevents Cancer /Mice

Show HN: AI Art Platform: Video and Image Creator – VGenie

NYC congestion pricing cuts air pollution by 22% in six months

Show HN: AI Interview-to-Offer Agent Network

Ukraine's Daring Operation Spiderweb' Attack on Russia

Atomic time source failure at NIST Gaithersburg campus

Nothing in standard Ubuntu app set relies on curl?

Making macOS Bearable

POC for CVE-2025-55182 that works on Next.js 16.0.6

Will Calibri leave Pakistan sans Sharif? (2017)

Bacterially grown living materials with resistant and on-demand functionality

American Science, Shattered: Special report on research funding cuts

Racial Views of Donald Trump

Canonical Extends Kubernetes Long-Term Support to 15 Years

Lessons from Building (and Closing) Double Finance (YC W24)

You Have Billions Invested in Generative AI

On-World Interactions Using Wrist-Based Electrical Impedance Sensing

Tech In the D: MOT MOT (3 min video)

Show HN: Inferbench, collect/share datapoints on GPU's inference performance

Show all your application error using Cloudflare Error Page

The Greenhushing Trap

Scheduler Woes: Bisecting Early Performance Regressions Found in Linux 6.19

Fear of the Walking Zig: The Security Audit Gap

Show HN: Qyavix – A 155-byte DOM runtime inspired by React hooks

iPadOS 26.2 will restore Split View and Slide Over multitasking