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?

AMD and Anthropic Sign Major Chips-and-Investment Deal

American Grilled Cheese Sandwich Essay (2024)

Show HN: ApplyAssists – AI resume builder using Google XYZ formula

Canceling "Hey"

AI cracks yet another century-old problem

AgentENV: A platform for running agent env at scale (Kimi K3 RL)

The Unreasonable Effectiveness of Constructive Data Modeling [video]

Show HN: Kokuin – A TypeScript library for deterministic JSON hashing

How to teach an old Intel Mac new tricks with OpenCore Legacy Patcher

Disclosures show CFPB pick's ties to several regulated firms

Why AI Will Not Replace the Classroom

Show HN: ProofLeague – friends can ask for proof when you start a workout

Show HN: Better Than HackerRank's Hiring Agent

Microsoft Defender for Endpoint leaves some Linux boxes defenseless after update

Activist charged with felony after giving border agent "duress code" that wiped

Trying to make the glass tablet for writing from Passengers

Show HN: I built the simple expense tracker I wanted to use

AI scraperbots keep hammering us from residential proxies

Microsoft seeks Supreme Court lifeline in pre-owned license battle

Prickly present: dancing cactus toy that raps in Polish about cocaine goes viral

Rethinking Security for the Age of AI – The Official Microsoft Blog

Show HN: Phonetic ASR transcript correction tool

Mayor Mamdani Unveils New Municipal Grocery Stores

Turn business SOPs into AI agents with real API endpoints

API Testing Chrome Extension(REST, Soap, WebSockets, SSE)

The Rise and Fall of Google's Privacy Sandbox

CME launches single stock futures to trade SpaceX, Micron and others 23h/day

Someone made TempleOS temple-run port

Should you still use Python-dotenv in 2026?

Kimi-K3 on Ollama