Packed Data Support in Haskell

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

77•matt_d•9mo ago

Comments

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

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

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

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

cstrahan•9mo ago

No, one example of why being variable sized integers.

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

carterschonwald•9mo ago

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

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

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

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

Ask HN: Is OpenAPI enough for LLM-based API integrations?

Pre-Upload Video SEO Optimization

MLM Software Development

Is AI the Next Climate Change?

Show HN: Skill Gen: A meta skill for auto-generating skills from docs

We built a serverless GPU inference platform with predictable latency

Bridge AI with SKills

Show HN: Anoncast: Turn Blogs into Podcasts

InvoiceBingo

Game Boy Advance Audio Interpolation

When internal hostnames are leaked to the clown

Replit's Recent Pricing Change Is About Trust, Not Credits

Study: Older Cannabis Users Have Larger Brains, Better Cognition

NASA acknowledges the elephant in the room with the SLS rocket

New DeepSeek Research – The Future Is Here [video]

ICE seeks industry input on ad tech location data for investigative use

Claude Cowork and the Case of SaaSpocalypse

Show HN: An AI-Powered President Simulator

Astronauts Are Going Back to the Moon for the First Time in Half a Century

The CIA Is Sunsetting the World Factbook

Climate Change Economic Models Omit Shocks, Likely Flawed

Show HN: A text format for UI wireframes – comparing token costs across 4 format

Show HN: FIPSPad – a FIPS 140-3 and NIST SP 800-53 minimal Notepad app in Rust

Mick Jagger "Memo from Turner" (1970) [video]

Show HN: Use Claude Code to Query and Analyze Your Finances

4-Hour Builds: Anatomy of a Developer Experience Collapse

Spellcasting

OpenClaw Is Lonely [video]

Strava removes 2.3M rides from leaderboards in clampdown on cheats

Constant 14ms attention: 512→524K tokens (24.5x faster than FlashAttention)