Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•11mo ago

Comments

nine_k•11mo 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•11mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•11mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•11mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•11mo 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•11mo 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•11mo 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•11mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Unauthenticated Object Write Vulnerability in MinIO

Show HN: Drowning in messages after 6 months as a CSM, I built a cat timer

Weather Prediction Markets Are Booming. Can They Improve Forecasts?

The Universal Standard Book Number

'It's a special thing to be on Planet Earth': Artemis crew welcomed home in

An LLM That Watches Your Logs and Kills Compromised Services at 3am

The biggest advance in AI since the LLM

Apollo Domain/IX User's Guide [pdf]

Show HN: Minimalist template for scientific and academic resumes

Electric Rail Bike for Abandoned Railroads [video]

Powell, Bessent discussed Anthropic's Mythos AI cyber threat with major US banks

A new interpretation of the Riemann Hypothesis based on wave interaction (Flux)

Excellence Is a Habit

Ideas for marketing a dev centric product (2019)

Is the 'Holy Grail of batteries' ready to bless us with its presence?

New town every hour blue sky account

Vance Says U.S.-Iran Peace Talks Break Down over Nuclear Issue

iPhone 18 Pro Leaked Designs

Bella: Hypergrah memory for AI agent(10x time horizon)

Online Phreak Box

The Local Universe's Expansion Rate Clearer Than Ever. But Still Doesn't Add Up

Why meaningful days look like nothing while you are living them

Show HN: Posse – Open-Source Web UI for Anthropic Managed Agents

Jury reaches no verdict on first day deliberating at Live Nation monopoly trial

Building a better crossword page for my daily cryptic hit – Whitebeard's Realm

How Ship Anchors Work [video]

Building a Z-Machine in the worst possible language – Whitebeard's Realm

A Mac Studio for Local AI – 6 Months Later

My research has build errors now and honestly should have always worked this way

Beyond Quantum with Khrennikov