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?

Too many people are shockingly bad at prioritisation

Mise System Packages

The Touch of God

How Musk's tactics left investors clamoring for SpaceX stock and ignoring risks

Active AUR malicious packages incident

Even "illegible" Mythos reasoning traces seem pretty legible

Iraq Goes Solar [video]

There is a shadow hanging over this Fable thing

Small investors scrambled to buy SpaceX, despite belief valuation 'stupid'

Kimi K2.7 Code

Why news.Y Combinator.com UI designed looking like designed by 5 year kid

The world’s first trillionaire is a killer

3D Mercator Earth Map That acts as Live Intelligence platform for shipping

Running an AI-native engineering org

How Much SpaceX Are You About to Own?

AI Will Steal Your Motivation If You Let It

Realistic Superintelligence

On CPU Physics and CPU Cycles

Making the Invisible Visible

Ask HN: What do you think about US Government's Geographic Ban on Fable?

How a Linguist Helped Me Understand C

Animation Vocabulary

El Niño and the Iran war may spark hunger crisis for more than 100M

Dave Eggers doesn't need a smartphone, the internet or your Flock camera

Fable 5 is gone from model lists

Show HN: LLMRender, a 10kb Markdown+LaTeX renderer for React

Sam Bankman-Fried loses fraud conviction appeal

How flat is replacing fat in AWS data center networks

Our response to the US ban on Fable 5 and Mythos 5

ProofLayer Rules – runtime security, red-team evals for LangGraph