Packed Data Support in Haskell

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

77•matt_d•9mo ago

Comments

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

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

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

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

cstrahan•9mo ago

No, one example of why being variable sized integers.

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

carterschonwald•9mo ago

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

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

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

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

Evaluating TCP BBRv2 on the Dropbox edge network

Prankster launches Super Bowl party for AI agents

Show HN: A local-first documentation tool for AI agents (MCP)

Federal statement on Jeffrey Epstein's death dated day before he was found dead

Preserving the Open Web: Inside the New Wayback Machine Plugin for WordPress

Updates and Bot Wars

Seven Pages of a Sealed Watergate File Sat Undiscovered. Until Now.

Roundcube Webmail: SVG feImage bypasses image blocking to track email opens

Latest Epstein files reveal disgraced financier's Silicon Valley connections

Hackers arrested after being hired by Iowa to pentest courthouse win case [video

Google is killing authentic websites and I made it worse [video]

Specification Driven Development

A header-only C allocator library

Experts Have World Models. LLMs Have Word Models

Prepare your OSS repo for AI coding assistants

Hud: Runtime Code Sensor for Production-Safe AI Code

Beyond WaPo angst: Why journalists need to abandon hubris and look within

Show HN: Launchpick – Native macOS launcher and window switcher

The Little Bool of Doom

Discovery of Goethe's amber ant: its phylogenetic and evolutionary implications

Isledb: Database Built on Object Storage

Algorithmic Wage Discrimination

GitButler

Canadian startups need to stop playing slow

Simple tool to check SSL, HTTPS, TLS, Security headers and HTTP/3 support

Web design without design software

Show HN: Plexsonic, a Plex Music to Subsonic Bridge

EU to delay anti-deforestation law. Again

Show HN: Deploy to AWS in minutes – no DevOps required

How do you manage context window?