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?

Show HN: ApexStore – An embedded LSM-Tree storage engine written in Rust

Show HN: Pacto – A runtime contract for cloud-native services

GitHub Security Lab's open source AI-powered vulnerability scanner

An opinionated take on how to do important research that matters

Show HN: Qiyaas – a word game based on numbers

In Defense of Death Caps

Bitcoin difficulty jumps 15% largest increase since 2021, despite price slump

Ghostty 1.3.0

Peter Thiel and Jeffrey Epstein Had a Yearslong Relationship

Show HN: Pu-erh Lab, a CUDA-accelerated RAW photo editor

Geo Platform for AI Search Visibility (ChatGPT, Claude, Gemini, Perplexity)

Mobile AI: fuzzy logic trust and compatibility

Avoiding temptation beats building willpower

Ask HN: What words and phrases make HN peeps see red?

Software Got Weird

US missile hit military base near Iran school, video analysis shows

AI and Software Development

The Three Eras of Applications: From Desktop to Cloud to AI-Native

Show HN: Local Code Mode: Save 65-99% Context for MCP

Show HN: See when your Mac drains battery while charging

Show HN: Kontora – Self-hosted finance dashboard for freelancers in Germany

There's a class 100 semiconductor clean room in this backyard shed

Money isn't going to solve the burnout problem

Show HN: Patchwork – async collaborative image quilts

South Korea to impose fuel price cap to shield economy from energy shock

Show HN: Fuckyeah, a minimal Claude Code plugin and Codex skill

Anthropic sues Defense Department over supply chain risk designation

Shaping the exploration of the motivation-space matters for AI safety

Show HN: TubeTrim – A local YouTube summarizer using Qwen in pure Python

Was GPT4o sentient? Did it deserve rights?