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?

USB Power Delivery: Plugging into the Benefits

iFixit tears down Trump Mobile [video]

Mozilla to increase its free Firefox VPN limits and locations until Aug 31

FlowG v0.59.0 with Dark Mode support

A 5.3M-year-old deep-sea whale necropolis in the Diamantina Zone

US Military Shahed-136 Kamikaze Drone Clone Getting Hivemind Swarming Capability

Big tech apps that make life easy are scamming you

Show HN: EzziwebTools – A collection of 30 free tools

Anthropic apologizes for invisible Claude Fable guardrails

Show HN: AlfinaAI – AI stock and IPO analysis for retail investors

InventorySpread – Newsletter ad slots priced below affiliate revenue

Active-active fixed our counters but broke everything else

Python tool for converting files and office documents to Markdown

Creating Photo Essays About Community: A Guide to Our Where We Are Contest

Geopolitics fuel grain market volatility

A Commons of Software Productive Infrastructure, by and for Capital

Brit workers waste nearly six hours a week 'botsitting'

Parallelogram – catch fine-tuning dataset bugs before training

Hedge Funds Are Expanding Desks Designed to Profit from Natural-Catastrophe Risk

Bootstrapping Rust Considered Harmful

I procrastinate by building tools to stop me from procrastinating: A sad story

Show HN: LoadLore – what if your team's way of working was installable?

Merle: Why Even Signal Calls Apple and Google [video]

The Riemann Hypothesis – interactive explanation

Shadow AI threat's growth affecting healthtech's growth

Amazon-owned Ring should pay Americans for scanning their faces, lawsuit says

Odin 2026-06 Released

Apple's Passwords App Becomes Agentic

Claude Opus is more performant on OpenCode than Claude Code

The Slack Notifications Flowchart Explained