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?

Ask HN: cybersecurity refusal for turning a jailbroken kindle into a monitor

Akihiro Miwa, Actor and Singer with Gender-Fluid Glamour, Dies at 91

Forced to use a Pin in Windows 11, some alternatives

You cannot copyright AI generated material in the US

Godot Community Poll 2026

CVE-2026-25089: FortiSandbox unauthenticated command injection added to CISA KEV

Flowers for Algernon

Unheard 1965 David Bowie songs to be released – including Jimmy Page on guitar

'Likweli': A new monkey species discovered in the Congo Basin

ReRust – A collection of projects rewritten in Rust

Just Do Things

Show HN: Vektorgeist- A platform for AI operators and their agent's

What Doom taught us about AI-assisted incident response

Blood in the Datacenter

Neuromancer Teaser 2

Ask HN: Who gets credits on big math questions solved by LLMs?

Amtrak launches new study on New Haven-Providence route

New DHS rules limit foreign student visas to 4 years plus extensions

Truth Social to sell Wall Street firms the 'fastest' access to Trump's posts

We rewrote our custom visualisation renderers from SVG to be in Canvas

New Stock Dashboard

Show HN: HW/SW co-design blueprint for fault recovery in LLM training

Priora: Blind-rank features, get a Scope Score, export a Cursor-ready pack

Ring-Zero: Scaling Zero RL to a Trillion Parameters for Emergent Reasoning

Your AI agent doesn't know when its memory is gone

Anthropic Tried to Phantom Charge $16.6M

Roboflow Serverless Inference: A Thousand Models on a Shared GPU Fleet

Harness IDE: Run your coding agents on any machine

Why is healthcare so much slower than IT?

What do you do after you accidentally kill a child? (2024)