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?

Show HN: Founder.best – Help your product get found by AI, not just Google

Pedagogy in the Times of AI [YT] [video]

Poor Economics: Banerjee and Duflo on Schooling in Developing Countries

Figure AI - Helix 2.5 Robot: Zero-Shot Home Generalization

Build Impossible Programs (2018)

Contrastive foundation model for ECG-based prediction of cardiovascular diseases

America's biggest companies challenge 2020 No Surprises Act

The smallest possible Linux distribution

Manitoba adopts permanent daylight time

OpenAI discloses new 'concerning' behavior

Show HN: Tasku Cloud – Sync, backup, web app

Cohere and Aleph Alpha Join Forces

Nasiba

You can now predict anything bruh

Intelligent Terminal 0.2.2572: Faster, Smoother, and More Reliable

Missouri governor orders guardrails on Flock cameras and ALPRs

Ask HN: What would you include in an academic workshop on vibe coding?

How not to solve Jane Street's ASIC puzzle. Kinda

Show HN: Real-Time Bluesky Post Firehose in < 256MB

Signal releases phonenumber-less signups in beta

Show HN: MCPJam - the first testing & evaluations platform for MCP servers

Show HN: Key Jump – jump to search results by pressing 1,2,3

Getting rid of bad habits without suffering, without clinics, more effective

ChatGPT for Word, Excel and PowerPoint

Show HN: Pi-jev-auto-mode – a probability model gates Pi's shell commands

Inside OpenAI’s agentic software factory

Don't Just Say Hello

Saturn's South Pole Features Newly Formed Atmospheric Decagon

256GB Mac Mini is too small. You need Elbowroom

AI could create a 'silicon species' that rivals humans, Microsoft chief warns