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?

Repository Is Your Swarm

Open Sourcing the YC Application

Hilbert Curve

Why Do We Feed Wildlife?

Schooling Has a Meaning Crisis. Paradoxically, AI Can Help

GitHub Actions vs. GitLab Pipeline

AWS Bedrock AgentCore enforces user context to prevent hijacked AI agents

Elven Rope, Ultra-High Molecular Weight Polyethylene, and LLMs (2025)

Testing CUDA kernel execution with GPU correctness harness

Show HN: Open source math games and puzzles

Thousands of years of indoor air pollution

A Man Who Proved the Blue Zones Are Fake – Saul Newman [video]

OpenAI Is Backing Away from Reddit as Reddit Tries to Become OpenAI?

Pitfalls of Benchmarking on Modern Systems

Escaping the Quicksand: A Call to Arms

The Religious Experience of Philip K. Dick by R. Crumb (1986)

Cognition and consciousness arise from analog computations, says new theory

Stop Making TUIs

The superfast and compatible < 100kb pure HTML/oldJS Jellyfin front-end

Japan tried to build an operating system for the world, the US intervened

Meta's Global Playbook for Fighting Child Safety Laws

Submit privacy-focused companies and projects on PrivBid.com

Code Doesn't Speak – It Compiles: Why Small Models Win

Seed: Minimal, self-modifying agent harness

Ask HN: Claude Code in Video Editor

Show HN: I built an open source video editor that you can control with an LLM

Building with Papert at My Elbow

35hp and $12,000 of Pure Joy [video]

Show HN: Just describe your idea and let AI build a playable game for you

California Draws More Startup Investment Than All Other 49 States Combined