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?

The Anatomy of a Learning Stall

A Proposal for an Open Credential Lifecycle Standard

Ask HN: Who here still codes without AI, and why?

Reverse Engineered Razer Keyboard Control

The best/only way to get VCs to pay for a new systems programming language

There Is No Sound of the 2020s. Yet

A Modern Proxmox Docker Architecture with Disposable VMs, VirtIO-FS, and ZFS

From the Legendary Lft: Microcontroller Magic ("Sum Ergo Demonstro") [video]

Static Web Server

I'm a Philosophy Professor. Here's Why I'm Training AI to Replace Me

The world of Japanese train melodies [video]

The Vientiane Mystery: When a Taxi Apps Randomly Stops Working

Show HN: Bgbgone – local Mac background remover CLI – MIT

C++: The Programming Language Cover Raises Unanswered Questions

The "Cat-Cam": Using Go and an Old Nokia Android to Catch a Midnight Intruder

Using the Screen Capture API to record a browser window

Ask HN: What are some agent-coded masterpieces?

A Little Explanation of Little's Law

The US Needs Mechanics and Electricians.Big Business Is Spending to Create Some

The Grad Student Who Broke Microplastics Research

Memory Caching: RNNs with Growing Memory

Writing your own print function in C without Libc

Spotify no OAuth,no premium web API fetching

Nike can't just do it any more

Project the aircraft passing overhead onto your ceiling, in real time

Show HN: Kyushu – A self-hostable WASM sandbox for JavaScript workers

Show HN: WinkTerm – AI that shares the same PTY as you in the terminal

Help Nearby – humanitarian map with UN data integration

Retrospective

Dimitri Bertsekas