Packed Data Support in Haskell

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

77•matt_d•10mo ago

Comments

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

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

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

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

cstrahan•10mo ago

No, one example of why being variable sized integers.

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

carterschonwald•10mo ago

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

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

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

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

I traced $2B in grants and 45 states' lobbying behind age‑verification bills

The End of the Open Web

50 Years of Thinking Different

Show HN: Privacy Mask – prevent secrets leaking to AI agents

Show HN: fftool – A Terminal UI for FFmpeg – Shows Command Before It Runs

Benchmarking Hosted Browser Providers: Speed, Stealth, Captcha, and Concurrency

How to Run a Pool of Autonomous Coding Agents on Your Jira Backlog

Advertising was always going to come for AI chatbots. The real question is how

Show HN: I forked Python's Requests to add HTTP/3, async, and multiplexing

Beyond Agents.md: Harness Eng, Loop-Based Delivery, and Context-Aware Prompting

Updates on Analyst Platform for Data Analysts

AI Isn't People

Show HN: I wrote a free trilogy about perception, presence, and leadership

How Japan Is Buying Back Its Semiconductor Industry [video]

Show HN: Payment Hunter – AI-powered invoice reminders for freelancers

What do coders do after AI?

Slate: Moving Beyond ReAct and RLM

Safety Agents for Autonomous Systems

Claude can generate custom diagrams, and charts directly in your conversation

Claude now has Generative UI – interactive charts and diagrams

Show HN: Cigarette Rocket Booster – a rocket where the body itself is fuel

Show HN: JobStocks – track hiring changes at public companies vs. stock price

Source code of Swedish e-government services has been leaked

SSL/TLS and PKI History

Virtual Scrolling: Rendering messages without lag

Pentagon AI chief praises Palantir tech for speeding battlefield strikes

Major Outage in Datadog Web Application

Meta Acquires Moltbook

I hacked Perplexity Computer and got unlimited Claude Code

Gemini to Word exporter that preserves code blocks, tables, and headings