Packed Data Support in Haskell

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

77•matt_d•7mo ago

Comments

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

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

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

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

cstrahan•7mo ago

No, one example of why being variable sized integers.

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

carterschonwald•7mo ago

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

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

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

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Bad Dye Job

Show HN: TidesDB – A storage engine that outperforms RocksDB

Russia Bans Roblox

Cassette tapes are making a comeback. Yes

Trees – J Wiki

I Think I Found Something Weird About Physical Constants

Thieves are starting to steal RAM now that it's as expensive as gold

Why is Anthropic saying "software engineering is done"?

Rare earths startup Vulcan Elements scores $600M US federal government deal

Nano Banana Pro – AI Image Editor with Perfect Text Rendering and 4K

From stadiums to cyberspace: How the metaverse will redefine sports fandom

Show HN: From Personal Script to Public Tool – How I Built a Windows Setup Gen

New homes in London were delayed by 'energy-hungry' data centres

Euler Conjecture and CDC 6600

Show HN: Kling O1 Image –Consistent Image Generation from Multi-Reference Inputs

AI coaching tool for Engineering Managers

How Epstein Infiltrated the Silicon Valley Network Behind Trump's New Tech Order

Marvell Acquires Celestial AI

Automatic fix for React CVE-2025-55182

Static analysis to prevent Zip Bombs and architectural bottlenecks

The 'extinct' antelope bringing hope in the Sahara Desert

Show HN: Win Setup Generator – My setup script turned into an open-source tool

KEF: A file format for easy encryption/decryption of data

Apple to resist India order to preload state-run app as political outcry builds

Can you discover unknown elements by calculating their spectra?

JWST discovers an ancient Milky Way-like spiral galaxy

Show HN: Video Watermark Remover – Remove Watermarks from Videos Instantly

'End-to-end encrypted' smart toilet camera is not end-to-end encrypted

Understand Research Papers

Show HN: A free AI Room Design tool that redesigns any room in seconds