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?

Good growth strategist, bad growth strategist

Show HN: Free VIN Decoder with AI Summaries on Cloudflare Workers and NHTSA Data

The new HTTP QUERY method explained

Colombia's president accuses Israel of compromising election software

OceanBase Uses Multi-Paxos for High Availability

Design an international money transfer system

Show HN: Demand Intelligence and AI Design

Words, Words, Words

OpenAI pitches ChatGPT ads to Cannes marketers ahead of IPO

Design Crit: We taught AI to judge design like a designer

Tapered Language Models

Will AI Kill Taylor Swifts: The Rise of Ultra-Personalized Music

DepsGuard – Hardens Package Manager

Show HN: Code Stitcher – The anti-agentic workflow

C++ Lifetime-End Pointer-Zap and OOTA Progress

Ask HN: NIST Randomness Beacon Interruption?

AI is accelerating the exposure of the gap between people

URL and HTML to Markdown API Optimized for LLMs

Ask HN: Do you use web apps on your smartphone?

Desktop Commander MCP

Show HN: AI Command Center

15 sorting algorithms in 6 minutes (2013) [video]

Stop your agent from saying it's done when it isn't

CodeTimeline – Visual AI-narrated history for any GitHub repo

Vortex Layer Theory

AI Code Stitcher - Agentic AI Avoidance.

Codex Fast mode isn't 50% faster, but still takes 2.5x usage

Guidance injection: reliable instructions for local LLMs

Corelayer0 – Turn any OpenAPI spec into a hosted MCP server

Picot: Codex style GUI for the Pi coding agent