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?

Flow – A terminal dashboard for real-time network throughput

I was wrong about game development

Show HN: Tetris where every pixel is another Tetris (23,040 games in GLSL)

Plato Kills Socrates

Why African Borderlands Keep Burning

Show HN: Nectar, a Rust-like React that compiles to WebAssembly

PasteShape

Threads, Meta’s ‘Twitter Killer,’ Finds Its People

How to Read Something

The Revenge of the Philosophy Majors

LeRobot v0.6.0: Imagine, Evaluate, Improve

Specter PIERCER CE – first dedicated .onion web app pentesting tool

Claude ended a chat on its own after repeated abuse

Show HN: Keyhole – Share secrets with your AI agents

Speechify – WE'RE NUMBER ONE (for streaming quality+price)

Tau: A minimalist agent that teaches you to create coding agents

Instagram running ads promoting child sexual abuse material in India

The Computer Lab of Your Dreams

Victim Outreach

You Don't Own Your .io or .ai. You Rent a Country's Politics

Lightning Jazz

Ask HN: Why submit your AI-written article?

Netflix Viewers Are Abandoning Shows After One Season

Show HN: JWT Lens – decode and verify JWTs offline, provably no network

Learning to Replicate Expert Judgment in Financial Tasks

Typo – New CLI tools, Auto-correct mistyped shell commands

DOE emergency orders let PJM curtail data centers during the July heat wave

Trucking Startup Aims to Challenge Tesla. Paychecks Are Missing. So Is a Truck

Multilingual Experience Linked to Delayed Aging in Populations and Individuals

And yet It Moves