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?

Malaysia, Indonesia to Synchronise Cloud Seeding as Monsoon and El Niño Converge

Writing Fast Attention Backward Kernel for 5090 in CUDA

What to do (and not to do) when starting a new job

Why MCP Code Mode Loses Cold, and Wins Warm

The Boots Theory [video]

How to succeed at an acquirer post-acquihire

Using LLMs to Make the Emacs Web Browser Great Again

LLM-native Markdown editor Mac app

Show HN: A path through time-series anomaly detection, z-scores to deep learning

Gatekeepers Are Dead, Long Live the Gatekeepers

Show HN: GlassBox – what the browser reveals, and how identifiable you are

Please let me interact with your blog post

CI Should Be Disposable

US widens AI-driven investment gap with Europe

Data centers' 'oh shit' moment

How to Disagree

Can AI glasses replace the smartphone?

Show HN: AICostBudget – Estimate monthly AI API costs before launch

Protocols for transactional usage of object storage

Woman wrongly flagged by ID scanner as nationwide 'public safety concern'

Is Infinity Even or Odd?

Can AI ever be conscious? The question stems from a misconception

Scaling Laws, Honestly

The FTC's click-to-cancel rule was vacated. The statute underneath it wasn't

Show HN: PicoMQ – Durable Streams over HTTP, on object storage

Tallest timber tower tops out in Sydney

Show HN: Ruby script that prints a Ruby

If Eastern Europeans reported the world like the world reports Eastern Europe

Emacs 31 Highlights

Firefox intent to ship: JPEG XL