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?

Show HN: LidAwake – Keep your Mac awake with the lid closed (200 lines of Swift)

Tiled Rasterization for Large DOM Captures

Introducing Grok Bot

The Fanfare Around the Band Geese Was a Psyop

Show HN: Personal AI Policy Directory

Firefly Aerospace hits record $117.7M Q2 revenue, beating estimates by 34%

Blend2D – High Performance 2D Vector Graphics

Rocky Linux Founder Kurtzer Launches OpenWALDO to Open Up AI Training Data

Glyph – Content intelligence without the baggage

The brain may be about to have its Ozempic moment

Ask HN: How should I progress in my hacking journey?

Trystero

Ancient Engineering Marvel Was Built Without Rulers

How to Migrate from Airtable to Obsidian

Ask HN: What is your biggest bottleneck when developing with agents

Textdämmerung: On Arday, the EU, and How One Philosophizes with a Chatbot

Show HN: Openleetcode – local LeetCode runner where tests live in the repo

Microsoft to increase Windows OEM license pricing 7-10%

Anydoc: Word, PowerPoint, Excel, OpenDocument, RTF, ePub, CSV, PDF to Markdown

If the American Dream Is Dead, No One Told the People Who Are Still Chasing It

Gemini is Cooked, but GCP is Cooking

NVIDIA & partners to mobilize over $500B of third-party capital for AI buildout

AI Found a Zoom Takeover Flaw in Fewer Than 20 Prompts

My Answers to "Prove You Are Worthy to Post About Diets"

How much will cybersecurity costs rise?

Compression Is Prediction

OpenRouter is a example of the Application layer of AI

Next-Token Predictor Is An AI's Job, Not Its Species

Bluesky's active user base is shrinking as its focus expands beyond the app

The Idea of Immutable Social Media