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?

The Birth of the American 12-string Guitar

Show HN: Horus-runtime – High Performance Computing workflow manager

America Stopped Reading

OpenAI is shutting down Atlas

Build a Basic AI Agent from Scratch: Security III

Show HN: Dozenal – A Game of Spatial Arithmetic

Ask HN: Why is every company encorporating AI everywhere?

If digital computers are conscious, they are conscious at the hardware level

How to Run an Autonomous Agent Against Your Own Server

A preferred way to design tools for AI agents

Show HN: Spsc-ring-threadsafe Python C ext. 100x faster as multiprocessing.Queue

Show HN: JavaScript/JSON and CSS minifier lib in minimal C89

How to Build an Automated SEO Workflow That Improves over Time

Big Companies Are Starting to Hire Again, Defying Predictions of AI Wipeout

How to Set Up an On-Premises Project Management Platform

Finance engineering roles are 2.6% of open finance-department jobs

How to Build a 50k Ton Forging Press

Beyond Lambda-Calculus: Intensional Computation (2017) [video]

Libsm64: Mario 64 as a library for use in external game engines

Is Software Solved?

The Odyssey Leaked on X: Bootleg Seen by Millions in Hours Before Takedown

Removing React.js from the codebase and adapting Htmx for UI interactivity

Why I Left Google DeepMind

"Please just use plain English, I don't understand what you're saying."

Show HN: Agent Console – A Local Dashboard for Codex and Claude Code

Brief notes on the OpenAI/Hugging Face incident

Resumepilot

Absolute Truths I Unlearned as Junior Developer (2019)

Heartbeats and Heart Attacks (2016)

Teaching LLMs to Update Beliefs for Efficient Long-Horizon Interaction