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?

Google vs. Canva

Improving our alignment and security efforts

Show HN: Secure agentic email infrastructure with beta desktop client

OpenAI delayed its new model's development after the Hugging Face hack

Rust Function Overloading – Call for Experimentation

The ColorChecker, photography's most important 24 squares, turns 50

Open Source Access Control Management Application

World's biggest dark matter detector spots a single weird particle

Claude Preserved thinking – Modifying a conversation now results in an error

Don't allow Gemini AI access to your Gmail

AI Coding Agent Skills for Real Engineers

Copilot code review can now approve pull requests

The Future Is Not Tech-Forward

What's within a 10-minute walk in 50 European cities

Library of ODE Solvers

How to Build a Notion AI Chatbot for Your Help Center

TikTok CEO says over two dozen Jewish organizations are telling them who to ban

Dyson Made a Camera-Equipped Toothbrush That Flosses for You

Inception: Mercury 2.5 Preview on OpenRouter

Moe expert offloading on a 2-core Celeron with 2.7GB RAM

ChatBlackGPT

I Want a Wife (1971) [pdf]

Decompiler Explorer

Beneath the Bottleneck: An R&D and Technology Review of Lithium and Rare Earths

Rootkit Evading Elastic Defend Module Load Detection

My local model setup on an M4 Pro Mac Mini

MapQuest is No. 1 on the App Store after refusing to change Lake Ontario's name

Welcome to the Old Internet Again

GitHub Down Again?

Show HN: TinyJS – small apps on Win/Mac/Linux