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?

Se-harness – portable, tool-agnostic AI coding harness generator

ASD Has Handed Australian and New Zealand Boards 16 Questions on Frontier AI

OpenAI launches GPT-5.6-Cyber – 95% completion on advanced cybersecurity tasks

LLMs and Xfwl4

SB116 Programmers Calculator

IsThisBS?

What Design Engineers Earn in Europe: Results from a Survey of 106

Moving integer division to floating-point is trivial

Peter Steinberger: "Fun Is Velocity" [video]

Half of Europe's towns and villages have fewer residents than 60 years ago

OLM to PST Converter

The AI threat to India's IT jobs machine

OpenAI wraps $7B share sale ahead of potential IPO

France Bans Unsolicited Telemarketing Calls

New Features in Python 3.15

MP3 piracy was born August 10, 1996

DeepSeek: Reverse Engineering an AI Assistant by Interviewing Itself

Trump Said to Have Used Military Jet to Leave Turkey Amid Threats

Show HN: Mcptoon – MCP CLI client that cuts tool discovery tokens by 97%

Bow Windshield

Coop Roost: Free, Open Source Child Safety Infrastructure for Every Platform

Show HN: ConfigLedger -Find configuration drift across code, CI, Docker and docs

Show HN: NiceShot AI – The analytics layer competitive games forgot to add

Tlbic Supplement v11.0: Added Question for Readers in Other Languages

Checkly: Metabase Security Incident

LLVM: Estimating Branch Probabilities

Show HN: Mychart-CLI, a local-first exporter for records you can view

Never Bet Against Elon

Clanker Constitution

Claude skill automating edits to songs