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?

Anthropic released a CLI to evaluate skills and plugins

QueryBrew: System-Agnostic SQL-to-SQL Query Optimization [pdf]

Project Blinkenlights

Good Alternative to the Cloud

Neom: The Largest Megaproject Collapsed [video]

Gov Newsom Signs Student-Backed Digital Literacy Bills Alongside Misguided Bans

Cold TAKE: Amazon's New Encryption Method Still Doesn't Deliver Real Privacy

Dave Ditzel's keynote/AMA on Esperanto's odyssey

What Is Your P(doom)?

The US Government Launched 3 Previously Unreported Investigations of Polymarket

An Algorithm for Proving Combinatorial Infeasibility

wolfSSL Announces wolfPSA

Michigan coal plant [J.H. Campbell] set to close was illegally kept open

Meta Sets Up Super IC Teams

What Is an Agent Multiplexer?

NASA: The National Artificial Stupidity Association (Omni 1985)

Show HN: Claude Read Aloud – Hear Claude's Replies Instead of Reading

Show HN: Loop Pedal for Video

How AI Is Changing Audio Restoration in 2026

Show HN: Spanda – Sub-microsecond LLM epistemic uncertainty in Rust

Show HN: ResolveHQ – A Helpdesk Built on Cloudflare Workers, D1, R2 and Queues

FreelanceFend – AI web app and extension to screen freelance clients

Rage Against the Machine

Pixel Wealth

The moon may have formed in just 5 hours, new simulations suggest

ASCII City Update 3: Maps and Exploration Update [video]

On 'scaling up' and being the right size

The Latest Wealth Flex: Big Trees

Yojam: A macOS default-browser shim that routes URLs through a rule engine

GPT-6 built this earth exploration site in 5 prompts