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?

Show HN: Hound Media Server – Media Server Alternative to Plex+Stremio

Why India Baffles China

Show HN: Wg-admin – web UI for an existing WireGuard host

Beautiful Messaging at Scale

Try real Omarchy Linux in your browser

Tell HN: OpenAI brings back 5 hour limit for plus and business standard users

Why front ends fail when you approach them like a back end

Show HN: A DIY pure sine-wave solar inverter I built from scratch

Rttx – a tiling terminal for GNOME first stable release

MCP server architecture for platform teams

Show HN: Real-time manga and manhwa translation from your phone

My full statement regarding DOOM Eternal (2022)

NetBSD 11 from Scratch

Apple's "Think Different" inspired ad made by AI

Ask HN: What LLM are you using?

Using large language models for research in the natural sciences

Show HN: SharpLineup: fantasy football projections priced from betting markets

Israeli ministers keep telling everyone their brutal plans, why are they ignored

Making software hurts now

Where every AI coding tool keeps its config

Stockfish 19

Benchmarks show scores. Dashboards show usage. What ships?

Show HN: LLM Council: survival-of-the-fittest multi-modal deliberation

Show HN: Evidence-linked forensic financial investigation

Phairplay – AirPlay and Miracast for Android TV

Do We Still Need Burp Suite for Web Security Testing?

The New US Dollar, the One Epstein Built

I'm going Founder Mode on my cancer

Mod runs DLSS 5 neural rendering on a second GPU via ReShade, boosts FPS 127%

Company does not have processes. It has habits