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?

Hackathons in the vibe coding era: our token economics experiment

Why EAV Sucks

GoJS is now free for personal, non-commercial use

Don't Be Fooled by Anthropic's Doom Troll [video]

Give your guard two minutes to fail

Built-In Tools vs. Custom Tools in LLM Agents

Australia 'on the same page' as Canada as it seeks deeper EU alliance

How Big Are Factorials?

Chester Zoo Mistakenly Advertises 'Child Predator Tour'

Mesh Welding with Spatial Hashing

Show HN: Llmbridge, a C++ LLM gateway with sub-millisecond overhead

Yogi-Isms

Exogenous creatine supplementation promotes tumor metastasis

Boomers Are Sacrificing Retirement Savings to Support Their Grandkids

Show HN: What weather do you like? Find it, anywhere on Earth, any month

Reasons your vibe-coded dashboard looks terrible

AI Regulation as Anthropic's Business Model

Boost.PolyCollection

Show HN: Hacking a $20 4G wireless hotspot into a texting device

Boston drops Flock after outside agencies gained access to vehicle data

Show HN: Prokop – Open-source AI coding workspace with cross-project memory

I Missed One TLB Shootdown and Somehow Ended Up Controlling a Page Table

Show HN: Open-source passive NFC tag that signs with ECDSA, verified on-chain

The Security Risks in 100k Enterprise AI Sessions

Java 27 Released

Google wants Spirit Airlines' data. Micro1 wants to pay more

Show HN: Forward newsletters to an address, get a typeset paper on your Kindle

Usenet's Back, Baby. (This Time, the Search Works.)

Over 12% of links posted to Hacker News are Show HN projects now

Nandns: Free dynamic DNS, DuckDNS-compatible, self-hostable