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?

Mother Earth Mother Board

US recession probabilities implied by the yield curve

Show HN: AnyHabit – A minimalist habit tracker for Raspberry Pi and Docker

Highlights from Git 2.54

Enhancing Sporting Organisation Efficiency with Generative AI

Reconstructing a Vue and Three.js app from a single Webpack bundle

Show HN: Tiltbump – another game in a single HTML file

WebP to PNG Converter – Convert WebP to PNG Online Free

AI agents are a security nightmare. Moving the dev workflow to QEMU

Kiss Principle

Pagetok – an all-in-one AI assistant on your Mac

Strongest Phentermine for Women: What to Expect Before You Start

Show HN: TapFi – Join any WiFi just by scanning the details with your camera

Help Me with Multiverse OS

CC: A P2P Network for Reproducible Autoresearch Code Experiments

All your agents are going async

The Anatomy of Tool Calling in LLMs: A Deep Dive

Xonsh shell 0.23 REFORGED – not just a release

Show HN: DSS, a new human-readable and plain format for XLS and spreadsheets

Show HN: OpenBridge – turn web chat access into an OpenAI-compatible endpoint

The Pirate Bay's Oldest Torrent Turned 22

Heatwaves in the Indo-Gangetic Plains: Why Local Conditions Matter

A Hot-Air Balloon Landed in a California Backyard. The Owner Says It's A '

Less human AI agents, please

Show HN: Alignear – Client communication layer for Linear teams

The Fencing Visualization System

Berea college makes tuition free with its endowment

Iran claims US backdoors knocked out networking equipment

Writing Node.js Addons with .NET Native AOT

Using Changesets in a polyglot monorepo