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?

How to get the launchpad back in macOS 26

Doo – 0.2.0 Alpha Release

'The Fall of Icarus': How the remarkable shot was captured

Automate GEO tracking by turning the browser into an API

Making a Programming Language

rsyslog Goes AI First

DIY 1-pixel compressed-sensing camera with LED source but no moving parts

Oscar Live Coding Environment

I built a free tool that extracts Go code semantically for LLM context

Show HN: I made an AI tool that applies to jobs via cold email

Are sperm banks in Denmark rejecting donors based on their IQ?

The Mundanity of Excellence

Show HN: Monitor downloads and engagement in Figma Community

Show HN: Geetanjali – RAG-powered ethical guidance from the Bhagavad Gita

Retool uses Loop to turn production data into AI roadmap decisions

For US Businesses, Tariff Complexity Is "Death by a Thousand Papercuts"

Who has a right to the moon economy? Whoever gets there first

Increasing code performance with LTO [video]

US hits out at EU's 'suffocating regulations' after it fines Elon Musk's X

Quality vs. Quantity

Most Intense Solar Storm in Decades Shrunk Earth's Defense by 80% [video]

Show HN: IntentusNet-A Secure IntentRouter and Runtime for Multi-Agent Workflows

Joe Lonsdale Calls for Public Hangings

GitHub Actions Has a Package Manager, and It Might Be the Worst

2-Stage Motor System: Redefining EV Technology [video]

Watermelon Mosaic Virus

Ask HN: Why does every B2B SaaS have to look like Linear/Stripe?

Package Manager Design Tradeoffs

Is Pixelfed sawing off the branch that the Fediverse is sitting on?

Grok 4.20 tops alpha arena trading benchmark