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?

AA-Briefcase: a frontier knowledge work evaluation

Sheaves in Haskell

Steady States in Dyson's Theory of the Cell

US court rules Ohio can restrict children's use of social media

Meta lobbies Congress for protection from child-harm lawsuits

SpaceX shares fall as post-IPO frenzy loses steam

Bitcoin Has Lost Nearly Half Its Value in 11 Months

Show HN: Wolffish – An OS personal desktop AI agent

Ask Ad Manager by Google Ads

Shutting Down Fornjot

Bun (the JavaScript runtime) is being vibe-ported from Zig to rust

TrophyLab - Access to aggressor equipment and its analysis

Too much Chinese science is ignored by the West

Human Dignity

Long-term remission of neuromyelitis optica w hematopoietic stem cell transplant

Please Stop Talking About AGI (2025)

AI Tool That Analyzes Reddit Complaints and Suggests Micro-SaaS Ideas

Europe's Cloud Problem Isn't the Tech. It's the Mindset

Indian IT stocks slump up to 7% as Accenture cuts revenue outlook

Where Multi-Agent teams outperform Single Agent runs (and where they don't)

The hard part begins after the lab experiments end

Co/Core – An AI Cooperative

AI Development Company

Non-Terrifying Spirituality for Children

My Mathematical Regression

Whatever Recall – Local AI-knowledge embedded directly within your code

The FreeBSD-Update(8) Screensaver

Show HN: Speechmark – On-device meeting notes for Mac (no bot, no cloud)

A startup claims it broke through a bottleneck that's holding back LLMs

Samsung Demonstrates 3D Stacked FETs with Triple Nanosheet Channels at 42nm