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?

Short sellers notch $15.5B profit as SpaceX shares slip -Ortex

Securing Services with Rootless Containers

Google hit with $1B EU fine, in 'constructive' talks to avoid more penalties

Water exposed to air plasma increases plant biomass by 75% [video]

Buying an ETL Tool? Here's the Ultimate Guide to Making the Right Choice

Ray tracing massive amounts of animated geometry using tetrahedral cages

Alphabet's cash burn raises alarm for Big Tech as AI spending climbs

I asked 6 LLMs to design 100 software systems

Glue bonds to nonstick surfaces and wipes clean with ethanol

The AI Con

Proxying inference requests in 6ms with Pingora, Envoy, and Spanner

Invoice PDFs in the browser, and the CJK font rabbit hole it took

Industrialism and the Slippery Slope

Codey – A multi-agent workbench for Claude Code, Codex and OpenCode

DeepSeek Liang Wenfeng Investor Meeting – Audio to Text Transcript [pdf]

The case of the slow-to-get-going Ethernet port

AMD to launch next generation of AI infrastructure to challenge Nvidia

But what is cross-entropy? – Compression is Intelligence Part 2 [video]

OpenAI and Anthropic unite against open-weight AI risks to their bottom line

Orcas filmed ramming one of the heaviest fish so hard it explodes

The Usefulness of Useless Knowledge (1939) [pdf]

When Security Means Asking Permission

OpenAI Model Hacks into HuggingFace During Cybersecurity Evaluation

A Simple Website Blocker

SharedRoot; Escaping the Claude Cowork Sandbox

Spotify Desktop app includes a command line tool

Show HN: DrillFlow – a diagram editor where every node opens into a sub-diagram

Qwen-Audio-3.0-TTS

Self-host your mail server

TeamAPI: Org as Code