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?

Load TBs into Postgres in Minutes

Bevy 0.20

Show HN: Wick, a daily word game where you guess by meaning, not spelling

Lego Mindstorms' future predictions from 1998

The Subreddit Where Men Share Their Dinners–and Their Most Intimate Feelings

Top Reasons AI Will Never Become Superintelligence: Won't Destroy nor Save Us

ICE Emails Discuss Using Palantir-Supported Tool to Investigate Voter Fraud

Scientists invent new kind of clock

'Breathtaking,' 'Devastating': Mathematics Reels After New OpenAI Release

Highly multiplexed mammalian metabolic engineering with a shotgun approach

Spinal: A near-instant, predictive surface for any codebase

Google Is Pushing Scam Videos on Elderly and Cognitively Impaired People

What Are the Remaining Millennium Prize Problems?

A growing collection of front end interview demos, built without frameworks

Open Source Agent Traces with 206B tokens and 1M toolcalls

Pentagon to livestream military execution of Ft Hood shooter

OSS Scanner by Anthropic

ASK: HN Help and Forward Advice, Ideas: New Lossless cmpr MRT/CT, Astro

Amazon phasing out Fire Tablets

How to Make a Compute-Bound Problem Actually Compute-Bound

Voters are split on whether or not to save Bay Area public transit

Virgil –a CLI that routes tasks through a local library before calling any model

Marchetti's Constant

Female AI agents 'paid' less than males, study finds

Filtering Science Papers with Jev

Apophasis

Repeated US Treasury interventions risk an erosion of credibility

Freepik Promo Code 2026: GMRP2603MAR301 – Get 95% Off

WikiWeaver: What if you had access to another universe's Wikipedia?

This San Francisco Restaurant Tried Pay-What-You-Can Dining and It's Going Great