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?

Weird Al declined 'a nice pile of money' to star in AI ad

I put Claude Code on my Garmin running watch

The Underhanded C Contest

Motte-and-Bailey Fallacy

Break any AI scam phone call in just a few easy steps [video]

Show HN: GONK – Lightweight Edge-Native API Gateway in Go

Lawsuit alleges Samsung, SK Hynix, and Micron colluded to inflate DRAM prices

Opening up 'Zero-Knowledge Proof' technology to promote privacy in age assurance

Teaching AI to Reason About Software

KDE Linux Introduces "Developer Mode" Option, Easier Log Collection

'It's like having a dumb friend': Young San Franciscans hate AI

US opts not to renew Trump's trade deal with Mexico and Canada

Roost

Reap: Automatic Curation of Coding Agent Benchmarks

Ask HN: Could someone invite me to lobste.rs?

The Rape Gang Inquiry Report

Are Claude models broken with the Fable 5 update?

Cboe Seeks to List Prediction Market Type Options on Earnings Metrics

Crimson Room (2004)

Best Investments over the Last 100 Years? Almost All Are Tech Companies.

The empty corner in brain-to-text

Your Site, your rules: new AI traffic options for all customers

Large Hadron Collider is shut down by CERN to make it more powerful

Show HN: Simulate what AI agents do to an engineering org (no signup)

FSF Librephone update: Ensuring freedom, one blob at a time

Stop Quoting Steve Ballmer

Meta is reportedly building its own cloud business

What Can't Fable Do?

Flickr – Senior SRE – Remote (US) – Full-Time

Tidesman: Native MCP server for Apple Container's Linux container workflows