Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•7mo ago

Comments

nine_k•7mo 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•7mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•7mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•7mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•7mo 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•7mo 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•7mo 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•7mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Satellite swarms set to photobomb more than 95% of some telescopes' images

I Learned to Stop Worrying and Love Spatial and Agentic (>AGI)

Claude Code Plugin Marketplaces

Show HN: Tracksy – a minimalist time-tracking tool I built for my freelance work

Ask HN: Are LLMs just expensive search and scripting tools? Is it that simple?

The Connection Machine (1985) [pdf]

Zimbabwe's forest and energy projects reveal the downside of carbon credits

The Sights and Sounds of Bhutan

The Constraints That Create Autonomy

Show HN: Sigma Runtime ERI (v0.1) – Open benchmark for attractor-based LLMs

Ehtml

Feeling Old: 44 Is the First Big Aging Cliff for Millennials

Linguistic Sightseeing: The Germanic Languages, Part I

Workplace hierarchies are gravity wells

One-Third of US Families Earn over $150k

Talent sorting in Germany is flawed

TrueMeter: AI Energy Agent That Optimizes Utility Bills

Creating AI Ready Data

Multivox: Volumetric Display

Corn's clean-energy promise is clashing with its climate footprint

47 Days to Demo. 47 GameDev Lessons Learned

Fog of War

Anthropic Interviewer: What 1,250 professionals told us about working with AI

Ask HN: Anyone here self-hosting databases and needing advanced features?

Show HN: Giftl – A simple, free gift registry

Beyond the dollar: Helping newsrooms reach sustainability

The End of the Train-Test Split

Launch HN: Browser Buddy (YC W24) – A recommendation system for Internet writing

Firecrawl getting blocked due to headlesness

Managing a Windfall