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?

The Toad Medicine Boom Was Built on a Myth

Ask HN: What's Next for LLMs?

What if I can just do it faster than talking to you?

Show HN: Atomadic- Zero-LLM Sub-200us MCP Action Interlock (Storefront Restored)

'The language of Pokémon is universal': fans are still catching after 30 years

Hey everyone, wanted to share something I built in case it helps someone here

RFK Jr tells US families to vaccinate children against measles amid outbreak

The Challenge of Recovering SpaceX's Starship at Sea [video]

Attio – Next Gen CRM

Cooked: A DIY Manifesto (2013) [pdf]

The diabolical world of convincing AI thirst traps

Why Were the Dabaos Late?

Crypto miners are stealing power in Southeast Asia

Europe Is a Country

Study of 2M newborns shows refusing vitamin K shot led to higher bleeding risk

New spinning drone hides in plain sight

Show HN: Blanked – Compare tech hiring processes by role and company

Reaping Without Sowing

Show HN: Shitty – fast terminal. Memory-unsafe and faster than yours

Show HN: I'm 16 y/o and Built the only AI Agent for Hardware and Software Dev

Show HN: DRM-CLI – open-source release manager for MSSQL/PostgreSQL/Oracle

A causal history can exist locally everywhere and globally nowhere

Wireless Transec Taxonomy

Supply and Demand Is Not What Most People Think

Bitcoin cold-wallet attack spreads to 4,500 addresses as losses near $89M

Wham! 10 Days in China [video]

What Else Do We Lose When People Give Up Booze?

AI poster wins Ohio State Fair contest

Negative social ties as risks for faster aging, inflammation, and multimorbidity

Mention of Synon, the real inventors of Rapid Application Development, in 1986 [pdf]