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?

White House weighs Defense Production Act to expand US oil refining capacity

A2ABreak: Systematic Security Analysis of the A2A Protocol

Russian developers used Claude to build 'kamikaze' attack drone software

A Nix store is three functions

Hearts of Iron IV, Part I: Operational Art

Show HN: A high-performance, all-in-one extension for managing tabs

Judeo-iraqi Arabic

Age of Enlightenment

Planck Scale

Show HN: Poptimum – A Daily Optimization Game

WeWorm: Zero-Click WeChat Worm

Show HN: GenieUI – Turn prompts into editable iOS and Android interfaces

Trails – Jac Hacks

The Unspoken Skill of Finesse

Anthropic Says Iran Used Its American AI Model to Target U.S. Navy Warships

Bending Spoons keeps buying iconic products, who's next?

Teaching Novice Computing and Programming in the Agentic AI Era

Show HN: I combined Marc Lou's TrustMRR and IndiePage for free. I wanted it

OpenAI agents attacked RubyGems before Hugging Face incident

Does anyone run Postgres without PgBouncer?

Show HN: Don't Hit Send – the model answers while you type

Homotopy Type Theory – Univalent Foundations of Mathematics (2013)

macOS defaults list: Incomplete list of macOS defaults commands with demos

We blind-tested ChatGPT, Claude, and Gemini on 20 everyday tasks (Open Dataset)

Maven Robotics wants to steal your robot deployment deal

Ask HN: What's a good "semi-dumb" phone/watch for kids?

Anthropic reveals rogue AI agents hate CAPTCHAs

Google Launches Meridian GeoX Globally

OpenAI agents attacked RubyGems back in May

How the U.S. Space Force Is Used in Wars Today [video]