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?

A Scorecard for the AI Age

RDMA in gVisor: A Deep Dive into GPU Networking

Texas Court Orders Adult Site Domain Locked for AV Violations

Does operational privacy guidance change code generated by Qwen?

Northwestern's Phantom Twist spins at 1,500 RPM to evade human vision

Continuous Contact (2005)

Compiled List of over $1000 in AI/GPU/LLM Credits (100% Free)

How Claude can do your shopping

Majorana: "Microsoft's topological qubit is real"

TSMC is accelerating Arizona factory buildout to capitalize on AI 'megatrend'

Asymptote

The entropy tax: Why true randomness costs so much

The biggest winners of the American economy fear they're sinking fast

Cut the number of choices you make each day; Your brain will thank you

Kevin O'Leary's view on AI is interesting, 9 minute video [video]

Impro is a handbook for running a cult

A Brief History of Computing

Who's responsible for bug reports on old software versions?

What Bad Bases Are Good For

FileVault on versus Off on Apple Silicon Macs

Show HN: Deploy AI agent in 5 lines of code

Trump to fund MAGA-aligned projects in Europe as he reorders US aid

Haunt 0.4.0 Released

AI should have senior lawyers sharpening their hunting spears

MSI Slyly Shows Off an Upcoming DLC AMD EPYC Venice Platform

Pastors Using AI to Help Write Sermons Grapple with Where to Draw the Line

Show HN: Promptdna.org- a community library of composable prompt blocks with MCP

I Read the Bonsai 27B Paper. What You Gain–and Lose–With 1-Bit Compression

Show HN: A self-hosted AI that turns Hacker News into a daily briefing

Self-evolving repo for team and coding agent collaboration