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?

Neuroergonomics (2011)

Show HN: Jev.Store – A dedicated directory of useful things made on Jev

Kiro adds jev to decide turn in preview

Initial-scale no longer needed

WBHM team expected to use "Gulf of America" in place of "Gulf of Mexico"

Is z.ai shipping a different ZCode client than the source?

Mission-Bound Authorization for OAuth 2.0

How to copy URLs of multiple Firefox tabs without installing an extension

What Even Is an OS Now?

AI and human tutoring yield equivalent GRE learning gains

IBM When is Watson going to regain the crown via television?

It's not hypothetical: the dangers of AI are here

Minimal Assumptions for Societal Resilience

Show HN: Farm.js – A full-stack framework with an AOT compiler for React

Carnegie: China Passes US as Top AI Talent Hub, 40.6% to 34.2%

Show HN: NerfWatch() – Track AI degradation with daily tests and community votes

Show HN: BuyerCue – Find potential customer by paid-placement evidence

Where's the Beef? [video]

Kafgres: Embedding a Kafka Broker into Postgres

The Animated Elliptic Curve

VAT-Inclusive vs. VAT-Exclusive Pricing: The Math Developers Get Wrong

Manchester City found guilty on 114 charges relating to financial breaches

IRS launches new mobile app, expanding digital services for taxpayers

"Someone just sent me an ad that features an AI version of me. What do I do?"

A terminal-first multiplayer thread for agent-authored work

Become the Thousand Servers

Std: Call_once vs. Std:Async

Comparing exception behavior of magic statics, std:call_once, and std:async

The hottest new hangout for middle schoolers is NPR's comment section?

Ask HN: Does your team still have humans review and understand code?