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?

The Sign-Off Layer Is Becoming the Real Engineering System

AI is code – and can't be prompted into being smarter

Why Linux Still Feels Unstable

Holy Git! Microsoft code-sharing site suffers downtime, despite move to Azure

NHS patients can't opt out of Palantir's data platform – but their hospital can

Federal Network Agency vs. Steam: Investigation into "Plantation Simulator"

The Minecraft community so nostalgia blinded

How to Become an AI-Native Software Engineer? What an AI-Native Team Looks Like

Why pushback is growing against New Jersey's crazy e-bike law

Vibe Coder vs. Software Engineer

Why can't I type and scroll at the same time?

Researchers uncovering ADHD links to other health conditions

Commanded, Meet EventSourcingDB

The Leading Deepfake Expert No Longer Trusts His Own Eyes

How Are You Feelin.today?

Show HN: Ray Hosting – Topology-aware game server orchestrator made from scratch

Why All the PRs?

Bring Siri AI to EU iPhone Users Safely

The Fertile Void

Companies are scrambling to curtail soaring AI costs

UK to announce Australia-style social media ban for teenagers

The Aeneid by Virgil (19B.C.E)

Show HN: Pg-status – lightweight HTTP sidecar for PG master/replica discovery

Claude Code Is Dead

Webxdc – Secure mini apps for chats

Paul Krugman breaks down problems with SpaceX valuation [video]

Is Musk the richest American ever now? No, except as a consumer

CoreAI_HTCE

From AGI to ASI

Pilot and 11 skydiving passengers killed in Missouri plane crash