Packed Data Support in Haskell

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

77•matt_d•10mo ago

Comments

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

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

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

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

cstrahan•10mo ago

No, one example of why being variable sized integers.

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

carterschonwald•10mo ago

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

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

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

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Lucent: YouTube Focus Mode and Auto 4K open source

Show HN: MuninnDB – ACT-R decay and Hebbian memory for AI agents

Microgpt on the ESP32 – But Why?

Shattered Glass (1998)

Upgrading the Samsung Trifold battery by 71% using SiC

Ask HN: How do solo founders find academic co-founders for STTR grants?

Would You Buy Generic AI?

Show HN: Arbor – AI research workbench, question to knowledge graph

PEP 827 – Type Manipulation

Regenerator 2000: interactive disassembler for the C64 and other 6502 systems

CEOs are betting big on AI while barely using it

The AI Bubble Is an Information War

Google violates its 14-day deprecation policy for Gemini 3 Pro Preview

US Stock Market has lost $1 TRILLION in value since open Tuesday

A lightweight, embeddable Prolog interpreter written in C11

Blackberry Growth Monitoring and Feature Quantification with UAV Remote Sensing

The Court's (Selective) Impatience Is a Vice

Show HN: Boosted LightFace – A Hybrid DNN and GBM Model for Facial Recognition

Isn't P2P WebRTC better than SSH for connecting to Mac terminal from iPhone?

Anthropic's Claude sees 'elevated errors' as it tops Apple's free apps

Bio-Inspired Adapters: Improving Models Beyond LoRA Fine-Tuning

Show HN: Design Jam, ASCII wireframes and annotations that export as AI prompts

Show HN: Free Math Sheets – Generate math worksheets for K-5 problems

What the First Billionaire Reveals About the First Trillionaire

A New Rembrandt Discovered

What AI-justified mass layoffs reveal about what we were never owed

Show HN: I rewrote an inventory app 4 times over 5 years before releasing v1

Floyd is an enterprise-level world model

Walk me through this "Safety Third" thing

Perplexity Computer Is Groundbreaking