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?

A Self-Hosting Point-and-Click Editor for Any Application [pdf]

Replacing Google Analytics with Matomo on a Pi in a Cupboard

The LLM Looked Smart. The Metrics Disagreed

Why does Amazon have no Western rivals?

3D R/Place

Found the song from the viral runway watch ad with 110M Instagram views

188,000 Show HN posts, 14 years of data: what predicts GitHub stars

Hypen – Declarative UI Language for Cross-Platform Development

Show HN: Cheap-IM – CPU-only voice agent approximating Thinking Machines' demo

Zero, a systems language for small native agent tools

ZeroBloat: Open-source desktop app for removing Android bloatware

Show HN: Building ClueDay, a daily clue-based word-game

Target can't measure their own bins

Searching "remove definition" on Google results in pointless AI text

Show HN: I containerized my AI agents and dev tools

I made realtime raytraced reflections for my portfolio site

Show HN: Agetor - An open-source Harness Orchestrator

Do LLMs hold the opinions they give you?

Does Wellington have the most beautiful commute in the world?

Do less so you can do better (2020)

WriteUp: 16 Bytes of x86 that turn Matrix rain into sound

Scientists have invented a way to erase bad memories. But should we?

Rust Async and the Arm Generic Timer

Dealing with a Fake a World

Design posters showcasing your country's electrical grid

100% Vibe Code

Why ML is a metaphor for life

Finding the Time on AArch32

Meta AI Incognito Mode Chats

Financial Services Hackathon for Autism