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?

Breathtaking

Street Fishing in the Canals of 'Little Venice' – Treviso, Italy

Reality Is a Shared Hallucination (1997)

Show HN: VidMark – Frame.io-style timestamped comments for Google Drive

Waveoverhangs – Steep overhangs without supports

Jensen says Nvidia now has 'zero percent' market share in China

UAE Plans to Run 50% of Government on Agentic AI Within Two Years

Icestream – enabling efficient streaming writes in Apache Iceberg

Techm Studios

Keeping HamClock Alive

I'm Fighting Two Wars

The Planet Is Dying but You've Got Work on Monday

Milei Ends Argentina's Deficit After 123 Years – Global Finance Magazine

Onion Futures Act

Ask HN: How do you show your free software projects to the world?

AI for Teams: Team-in-the-Loop

Training language models to be warm can reduce accuracy and increase sycophancy

Australian police officers can be tracked via taser and body-cam bluetooth

How A.I. Is Transforming China's Entertainment Industry

Duralang – decorator makes every LangChain LLM/tool/MCP call a Temporal Activity

Most Companies Aren't Anywhere Near Ready for AI

WolfCOSE: Zero alloc, PQC, MISRA-C, FIPS 140-3 built with wolfCrypt

Performance of a large language model on the reasoning tasks of a physician

Llama.ttf: a font file which is also a large language model and inference engine

Show HN: HypergraphZ – A Hypergraph Implementation in Zig

Erm: A Local CLI That Strips Ums, Uhs, and Erms from Speech

Show HN: Interpretable AutoResearch – Legible Agent Workflows

Bose SoundTouch Cloud Replacement

My Agent Memory Library Helps Write Indie Articles

Skin Trackers – S&P-style indices for the CS2 skin market