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?

Agent-config&Claude Code mods

US unveils sanctions on ICC in move court condems as 'assault on rule of law'

Ful

ModRetro Chromatic: Transparent

Portfolio Risk Lab: uncertainty-aware rebalancing in Python

Branches in Branch-Free Code

Microsoft is about to hobble your O-365 Family Storage

Show HN: Plannotator Inbox – Decision Making Surface for Agents

Walmart exec speaks out on dynamic pricing again after watchdog calls out patent

15-Minute Lesson Plan: A.I.-Assisted Mathematics

Rampart: Browser native on-device PII radaction

English Instead of Code

Show HN: Cactus Needle – Local tool calling and speech-to-text in JavaScript

A Practical Guide to Naming Things

OpenAI will start watermarking ChatGPT's text in the EU

Show HN: LumiBridge – 448x64 LED display with SDR ship tracking

Ben Affleck is an AI nerd

U-Space: Uncovering When and Why Uncertainty Arises in Language Models

I'm still around.. I'm just not writing here

Show HN: PDF/ePub reader where you ask AI and each answer links to the passage

Ross Douthat: I'm Writing a Column for the Free Press

AI Could End Encryption as We Know It

What mathematicians should know about the Lean Theorem Prover: reliability & AI

Remember Orkut? Its founder wants to bring it back

Jasmin: A language for high-assurance and high-speed cryptography

The Rise and Fall of the Plasma Screen

THX-01: An Open-Source Decision Model That Runs on Your Phone and Beats Jev

Show HN: The rarest tech books and docs you've probably never read

CXMT's covert campaign to obtain Samsung tech by any means necessary

Scam American companies are using to manipulate ingredient gets listed first