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?

Researchers Develop Method to Tell Authentic Artifacts from Fakes

Electron, We Have a Problem

Show HN: Socialize/Presence multiplayer interaction on blog posts

GoSF: Front End Go [video]

GoSF: I cloned my CTO and now write better go code with agents [video]

Postgres logical replication beyond one writer

GoSF: Tools to modernize your Go code [video]

Ask HN: Do you believe RSI is possible?

The support case of a customer claiming all they could see was a black screen

Small offline tools in one installable PWA, no back end or accounts

Aegis Solis: AI Coexistence Research Dataset with 112 Registered Questions

Tesla K80 / Kepler: 3× faster

Le Salon – IRC Beautiful.Shared via URL-Sharer

Show HN: Codemm – your coding agent writes exercises, a sandbox rejects bad ones

20 Years of Blogging

Haswell Native Raminit (NRI) + FSP Cross-Reference

Alice Huang reportedly instrumental in securing over $7.5B of Nvidia imports

'If something happens to Nvidia, it's going to be a catastrophe'

Decision Making Textbook

Game Theory Textbook

Bozzetto – reach consensus faster on engineering problems

Why Parental Consent Policies for Social Media Do Not Help Families

Do you get made fun of by your friends for staring at Google Maps for hours?

Noah Smith and Azeem Azhar Discuss the AI Boom

Ukraine's fiber-optic drones get squeezed by AI data center demand

Prepare for the AI Apocalypse Like You'd Prepare for a Snowstorm

A Journey Through Gödel, Escher, Bach: Can You Think Without Understanding?

SEC Enforcement Failures Abandon Investors, Benefit Crooks

Let's Talk About Why All This OT Stuff Is Connected

Rendering in Batches with Glimmer and Datastar