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?

Making TinyLLM Go Brrrrr

Paul Graham, Founder Y Combinator [video]

Timeline of Microsoft's SmartNIC Tech (Azure Boost)

Mars Terraforming Research Roadmap

5-Minute Crafts Has a Cybercrime Problem [video]

Nvidia IGX Thor powers industrial, medical and robotics edge AI applications

Show HN: Composer – AI architect / MCP for software architecture diagrams

The Catholic Priest Who Helped Write Anthropic's A.I. Ethics Code

I simulated a 19th-century utopian commune with AI agents

Why OpenAI Decided to Buy 'TBPN,' Tech's Hottest News Show

Referi – A trusted network for job referrals

Show HN: LM Gate – Auth and access-control gateway for self-hosted LLM back ends

Show HN: Claudebar, the missing interactive menu bar for Claude Code

Open-source runtime security toolkit for autonomous AI agents covering OWASP Top

AutoGameStudio – Autoresearch for Game Development

NanoClaw's architecture is a masterclass in doing less

Convex for Enterprise

git-leash - time focused controls for Git

FP: Agent Native Issue Tracking

UpMocker: Browser-based mockups for chats and posts

Show HN: Wordie – Spaced repetition vocab app built around sentences not quizzes

Hex editor should color-code bytes

Stack Overflow (Beta)

GEN-1: Scaling Embodied Foundation Models to Mastery

Title: MCPNest – The missing App Store for MCP servers (983 servers indexed)

Show HN: A Minimal Basic Inspired by Brainfuck

SpaceX has held talks with Saudi fund for $5B investment in IPO

Climate change may produce "fast-food" phytoplankton

I Built an SMS Gateway with a $20 Android Phone – Jonno.nz

How we caught the Axios supply chain attack