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?

Hex1bThe .NET Terminal Application Stack

What If Everyone Saw Your Whole Digital Life?

Ask HN: Would you want to know when and how you die?

The Technical Realities of Email Privacy

Something Is Very Wrong in San Francisco

Hubble tension, dark energy, and α from one number, zero free parameters

All Gists Discussed on HN

Discussion of GitHub repos on HN

"polarization" might, in part, be a proximity issue

France to ditch Palantir's AI data tools in favour of domestic provider

Property Graph Support in PostgreSQL 19

How to Deploy Hermes AI Agent with Docker and HTTPS

US moves to offer Iran sanctions relief

Skill Fablize for Hermes

OBS Agentic Control Interface

Trump admin tries to block Clean Air Act lawsuit over xAI's gas turbines

The Limits of Altruism

Web Search API for Agents 70x Cheaper Than Exa

OpenAI spending hit $34B last year ahead of planned IPO, $21B losses

Building Production AI Apps on Claude Code and Cloudflare [video]

How HN: Nova BRAIN – STIG scanning and POA&M automation dashboard

GoJS – Interactive diagramming for every industry

How to make small models punch way above their weight with DeepClause

Gravitational-wave detections double with new catalog

Framer 3.0

OpenAI's financials have leaked, showing $21B in losses against $13B in revenue

Spin separates giant planets from 'failed stars'

Show HN: I Built a Free Text Based Audio Editor

How SpaceX's arrival impacts the stock market

PP-OCRv6