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?

What Sam Altman will tell the White House this week

Iran calls Ukraine's strikes on Iranian vessels 'hostile and criminal'

Why Los Angeles Stopped Repaving Its Streets

108 PRs in eight days: Accidentally discovering loop engineering

Canada must prepare for bigger wildfires, every summer – forever

AI agents are eating the Web, growing by 8,000% and rewiring business models

A Love Letter to Object Orientation

The Question Is the Hard Part

Installing Verified Facts into Transformer Weights by Direct Construction

Reviewing AI Code Is Not a Viable Argument

China considers tighter export controls on AI models and chips

Office Deployment Tool for Free

Surge: Blazing fast TUI download manager (outperforms aria2c by ~1.4x)

An Inside Look at the Token Reseller Market

SpaceX eyes tower catch for next Starship after auspicious end to 13th flight

Robotics development made dead simple (open source)

Show HN: Minnarone – Multimodal agents that watch, listen, and react live

Ask HN: I spent personal money on game dev. How to turn stalled project around?

Skill Router – a local-first router for large agent skill libraries

Repairing a "for parts" Canon 7D Mark II

International Olympiad in AI opens an official medal track for AI systems

New data suggests Scotland's 48% tax rate may be losing money

How do I get recommended on ChatGPT?

The logic behind C declarations (and the only correct way to declare pointers)

Canadian lab confirms process removes 90% of long-lived nuclear waste

Show HN: I built a transparent terminal wrapper for unobtrusive AI

WTA to require all players to undergo genetic sex testing

The Shift Project

X-Ray Video of My Hand Made with Stuff Bought Off Amazon

Magnus Played at 71% Accuracy – Or Was It 88.7%?