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?

A History of Software Publishing Corporation

ATProto Permissioned Data Proposal Draft

A modern CLI for Java projects

I automated my job (and it made me a better leader)

Linux Foundation Is Pursuing Trusted Identity Infrastructure for AI Agents

How to find AI-conservative companies to work for?

German Rail Service Suspended Due to Radio Interference

Old Man's Journey

All train services in Germany halted after train radio communications disruption

Lobu: Build AI teammates that watch and act

Expert-aware quantisation: near-Q4 quality at near-Q2 size?

How to Increase Your Luck Surface Area (2010)

No AI Co-Authors. A Manifesto

Key activities for sustainable engineering team

Closing the Loop: What to Do After a Design Critique Ends

Pg_graphwright: A Postgres knowledge-graph index that inherits row-level-SEC

A new novel parser architecture is being put into Oxc (Reported 2-3x Speedup)

Memiry Check-In Agents

Svoxx.com

Brussels Clears €76M German Chip Subsidy for Munich

4 years as a content writer working with AI

When is an AI agent's approval prompt a security boundary?

Halvar's Guide to Entrepreneurship

Visualizing multi-dimensional array shapes recursively

Anthropic gives Claude a permanent seat in your Slack channels

SovietRxiv: Rediscovering the Soviet scientific archive, in English

UN commission of inquiry says Israel committing genocide by targeting children

New car registrations: +4% year-to-date; battery-electric 20% market share [pdf]

Quartz Crystals: The Heartbeat of Our Digital World

Show HN: Foundation models that predict patient response in clinical trials