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?

How people are testing AI agents?

Frontier Overhangs

Some Old Expectations for the New Apple

Physics Problem Finder

The Armored Sarcophagus Saving Ukrainian Soldiers

OpenCode Reloaded

Proposed Group: Browser Data Portability Community Group

Raspberry Pi locks down RAM upgrades in Firmware [video]

Orphaned VMs: Running VMs Uninterrupted While Host Kernel Is Offline

0x025 – System One Models (Jev)

Xenobiome Command – a colony SIM that runs offline in the browser

Skill and UI kit to understand PRs faster

She died at the San Diego border. A surveillance camera was in plain sight

Move On – export your AI chats, file GDPR deletion, escalate if ignored

Show HN: I made ShipStreak to keep daily shipping gaps public

Pakistan Orders Hospital Beds Clear for Mass Casualty Ahead of Protest

Ask HN: Is Astra's writing starting to bother anyone else?

QBZ (Qobuz desktop client for Linux) shutting down

Show HN: Cheap and easy throwaway VPN server

AI staff complain of mental toll over fears of threat to society

Where Improvement Becomes the Problem

Bk2204/talk-rust-in-Git: GitHub repository with SHA-256 commit IDs

The Ultimate Reading List for Founders

Complex KDA:Understanding and Enhancing the Expressivity of Kimi Delta Attention

CP/M-80 2.2 Compilers

How Claude is uplifting biomolecular modeling

Beyond Context Windows: Evaluating Long-Term Memory for AI Agents

A Summer of AI Optimization

Be the first human to review your own code

AMD has now officially joined the trillion-dollar club