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?

Building a Local AI Workspace Inside VS Code

In-Kernel Broadcast Optimization: Co-Designing Kernels for RecSys Inference

ChatGPT adoption broadened in early 2026

Company behind GLiNER model released open source model for running LLM guardrail

Dependencies Are Someone Else's Attack Surface

AI Is Starting to Build Better AI (Recursive self-improvement)

AI overlay that stays invisible to screen recorders

Are LLM Useful for Solo Founders

US budget watchdog estimates Golden Dome will cost $1.2T

What Is RTSP Streaming and Why It Is Still Relevant in 2026

Show HN: Mealplannr – turn YouTube chef videos into weekly meal plans

GitLab Outage

New Project

Show HN: Awesome Stars- render github awesome list with live star/fork badges

A code (reformatting) conundrum in Python, and heuristics

Cook a Django project well, the agent-skill take on cookiecutter

Elon Musk went to court. The judge wasn't amused

French Defenestration

Learnings from Building an Ecommerce Chatbot for a Hardware Store

Ask HN: Do people still pay for simple utility tools, or use ChatGPT/Claude now?

High-Quality Chaos

After extensive work with agents, the non-technical sentence is the shape I see

How the World Became a Casino

Show HN: Game evolves itself with your wishes

Notepad++ v8.9.5 Release

Studio Kylemcdonald.net

Lies, damned lies, and Elastic's benchmarks

E3 started 31 years ago and gaming was never the same

Unauthorized Anthropic stock sales and investment scams

The Problem with "Mathematically Proven" Claims About LLMs