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?

Groups and Diffie-Hellman

Old New York Stories – Jacques Barzun Interview

SlimTide Official Site – Advanced Gut and Metabolic Support

The blood cancer that became solvable

Code Is Cheap(er)

The Infinite Policeman – Chapter 1.99999999-> Whatever Happened to Dimension ℵ0

Devs Deserve PII Protection

How the Internet Invented Bread Clip Science

SpaceX IPO video sells Musk's space, AI, asteroid dreams to mom-n-pop investors

Sapient HRM-Text – a 1B PoC text gen model based on the HRM architecture

Meteor Burst Radio is long range radio which bounces of ionised meteor trails

How to Easily Create Your Own Blender Theme

Show HN: Altersend – File sharing without cloud

24. Gulaschprogrammiernacht started, Streams of Talks are available

Show HN: Encoding Audio Inside PNG Images [video]

Americans lead AI data centre backlash, global poll finds

Satya Nadella 'Not Sure' Who Said Microsoft Wanted to Make Addictive AI

Birds masturbate, and that's perfectly normal

I Didn't Become a Developer to Review AI Slop

Laptop makers are sacrificing ports and repairability for designs

How much value is AI creating?

Anthropic tops AI Arena rankings as it files for IPO

Anatomy of a Claude Code Session

Magit-difftastic: render diffs with difftastic inside magit's buffers

Hagezi DNS-blocklist is returning 404

The Pipeline Game: Reading Buying Pressure Before Leads Exist

Fine-tuning an LLM to write docs like it's 1995

Ask HN: What are the biggest problems you find in OpenClaw/Hermes?

No-Chat-Reports

The teenagers enlisted as agents of mayhem by Russia and Iran