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?

CodeCrucible: A blueprint for LLM-driven SAST

The Shape of Data (2022)

Russia charges Telegram founder Durov with facilitating terrorism

Scaling Agentic RL: 365,000 Environments for SWE, Terminal, and Search

Course Topography: Uphill Finishes

Show HN: Mcploitable – Vulnerable MCP Servers for the OWASP Agentic Top

Query cycles: a Rust compiler murder mystery

Show HN: Video Upscaler – AI video upscaling up to 4K

Show HN: Wikipedia Importance Map. Every article sized by its pagerank on a map

Show HN: EarPal – private multi-speaker interpreter, on-device, 30 languages

colorForth

Show HN: Recipeviz, make compact cards for your recipes

1 deceased software-frog, a rogue AI and two hacked corporations

Engineering Always-On Market Data Infrastructure for Crypto Trading

Hugging Face Incident Initial Post-Mortem

Post with links will no longer be nerfed on X

Slid phi 4.27% smaller than fib coding

Show HN: Get a security assessment of MCP servers directly from your terminal

What breaks when project management software loses internet access

Iceberg capsizes off the coast of Greenland

Show HN: Copy any element on a page as clean Tailwind v4 (HTML or JSX)

Should A.I. Move to Space? (Google's Project Suncatcher)

Show HN: Code Security Skills Codex-Inspired Workflows Packaged for Claude Code

RU AF jamming Sentinel-1 satellites over certain parts of Russia

GitHub Has Restricted Access to Star Data

The Actual Reason Why Google "Fell Out" of the AI Race Changes Everything

Daggermouth could be the first best-selling novel partly written by a chatbot

Trusting-Trust Attack Against a Linux Distribution Through Binary

Klong

Exercises in benchmarking and evals, part 7: DeepSWE, Senior SWE-Bench