Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•10mo ago

Comments

nine_k•10mo 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•10mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•10mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•10mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•10mo 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•10mo 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•10mo 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•10mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Coal plant forced to stay open due to emergency order isn't even running

Show HN: Prepare for coding interviews via deliberate practice

What's on HTTP?

I built an AI baseball manager that runs all 30 MLB teams

Gea – The fastest compiled UI framework

A BEAM-native personal autonomous AI agent built on Elixir/OTP

iCloud Photo Sharing Sucks – Can AI Help Me Replace It?

An alternative derivation of Shannon entropy

Rolls-Royce scraps goal to go all-electric by 2030

Stop Building AI "Teams." Start Building Software Factories. – Owen Zanzal

Make your Linux keyboard act like a 'Tosh

Radicle 1.7.0 – Daffodil

IBM completes acquisition of Confluent

Google Backs Down: Will Grant Hotseat in EU Browser Choice Screen

Next.js 16.2

ScreenSaverGallery: Turn your inactive device into a digital art gallery

Seeing types where others don't: static type inference for jq

What to Watch in March: Häxan (1922)

We Made AI Gamble. What Poker Revealed About Frontier LLMs

Former Syrian Assad Prison Official Convicted of Torture, US Immigration Fraud

We Made LLMs Gamble: Heres What Poker Revealed About Frontier AI Models

Read Less, Steer More

Trashing American Allies Turns Out to Be Bad for National Security

Alibaba Starts Major Revamp to Heighten Focus on AI Profits

Why attacks on gasfields like South Pars are a major escalation

Show HN: Stop GPU pods placement getting bottlenecked by reserved VRAM

A look at content scrambling in DVDs

Clinical-grade autonomous cytopathology through whole-slide edge tomography

ZJIT removes redundant object loads and stores

Trendslop