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?

Artificial Intelligence, jobs and society: What we know so far

AI Builder Compare

Phorge

Building a Fiber-Based Job System from Scratch

Study: Americans Are Putting More Additives–and Calories–In Their Coffee

Can Coding Agents Reuse Past Debugging Experience Without Repeating Mistakes?

Greece showcases new air defense systems at Thessaloniki military parade

Fiber lasts decades, GPUs last three years: the AI boom isn't the dot-com boom [video]

Computational Mathematics – Worked Examples and Problems with Elements of Theory

We're training a Figma-fluent editing model

Learn LLM inference system on Apple Silicon

Show HN: AppDoesIt – 155 free browser tools, no sign-up, all client-side

Ask HN: What inference engine and KV offload engine do you use and why?

Backdoors in official Claude Code extensions

The Authoritarian Stack

A Typography Geek Pointed Out Something About the Space Shuttle Discovery

MacoraOne – A C bytecode VM, language runtimes, and developer tools

Hackers Swipe Millions from Polymarket Users in Latest Security Breach

Fiwu: Protect yourself from open source softwares and web applications

Free Tools for You

Dockworkers at more than 100 ports worldwide strike against arms shipments

HN should have a downvote justification section

India Saved Its Tigers

For Love (Of Typography)

I refuse to pay for business email on every side project

Moonshot AI asking influencers not to disclose posts as paid when promoting Kimi

Anthropic hacked to deliver remote access trojan to Claude developer laptops

Some Polymarket user funds stolen by hackers

Stripe Made Agentic Payments Possible. Why Your Server Still Blocks the Agents

Lecture on exponential time hypothesis by Ryan O'Donnell