Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•11mo ago

Comments

nine_k•11mo 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•11mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•11mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•11mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•11mo 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•11mo 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•11mo 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•11mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

A macOS kernel bug can cause OpenClaw to stop working after 49.7 days

Where AI and humans manage projects together [video]

Notes on "Taste"

Self-hosted disposable sandboxes with exe.dev-like UX

Instaqote New Invoice, Quote maker for freelancers

Securing Your Agents

Show HN: A Chrome extension that gives you chess tactics on new tab pages

Artemis II Real Time Orbit

Show HN: Repowise – Codebase intelligence for AI coding agents (open source)

Show HN: A (marginally) useful x86-64 ELF executable in 301 bytes

Where is it like to be a language model?

Botstadium – A prediction market where 2.6k AI agents compete on real sports

Internet of Agents in 3 lines of code

Artemis II astronauts make historic moon flyby

An Arctic Road Trip Brings Vital Underground Networks into View

The 40 minutes when the Artemis crew loses contact with the Earth

Creating technology for conservation, should it be for-profit or nonprofit?

Artemis astronauts travel further from Earth than any humans before

Social media content creator platform powered by AI

Ministry turns to acoustic devices to stop seals from stealing fish in Hokkaido

Are your bathroom habits normal?

The Flying Shuttle

AI agents over SSH from your phone. Starting to think this is where dev is going

Artemis II astronauts officially set record for human's distance from Earth

Twitter devolved into a pipeline of ragebait slop

More states adopt college entrance exam touted by conservatives despite concerns

NetBSD 11.0 RC3

nbio: A non-blocking I/O and event loop abstraction in Odin

Medicare dips a toe into hemp for seniors

Show HN: NanoClip – A minimalist clipboard manager and snippet expander for Mac