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•12mo 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?

SpaceX just disclosed Musk's new compensation package

Queen Camilla Unites Winnie-the-Pooh with a Long-Lost Friend

Collective Speed Is Not the Summation of Individual Speed

Free Solar Radiation, Heat Flux,Temperature,Humidity Data from Dtdss Algorithm

Copy Fail: 732 Bytes to Root on Every Major Linux Distribution

What it takes to transpose a matrix

Meta's multi-billion-dollar Graviton deal

Tell HN: VS Code v1.117.0 automatically adds GitHub Copilot as your co author

Incompressible Knowledge Probes: Measuring what frontier models know

Humanoid Robots Will Work as Baggage Handlers at Tokyo Airport

Iran Proposes Bitcoin Oil Toll

Tesla Semi: first truck rolls off high-volume production line

House approves reauthorization of warrantless spy powers

Why Model Collapse in LLMs Is Inevitable with Self-Learning

Europe has a fuel problem: It doesn't know how much it has

Half of 'long shot' Polymarket bets on military action are successful

Ask HN: Is anyone still using the ChatGPT browser, Atlas?

AI optimism surges in Asia, unlike in the U.S.

The Shadow Glass

OpenObserve Raises $10M Series A

Monad Tutorials Timeline

Lessons from Building an OTel Normalizer for GenAI

Physicists reveal universal speed limit on quantum information scrambling

Talking About Dark Matter – Sixty Symbols [video]

Show HN: Vela Coach – an open-source coach that reads your Granola transcripts

Ashby's Law of Requisite Variety (Cybernetics)

Humanoid Robots Are Still a Body Problem with Jerry Pratt [video]

Meta stock drops on quarterly results 'internet disruptions' user numbers down

In Backlash Against Tech in Schools, Parents Are Winning Rollbacks

Tourist dies after being bitten at snake show while on vacation in Egypt