Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•10mo ago

Comments

nine_k•10mo 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•10mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•10mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•10mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•10mo 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•10mo 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•10mo 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•10mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Out-of-Context Reasoning in LLMs: A short primer and reading list

Show HN: RSS tool to remix feeds, build from webpages, and skip podcast reruns

J Stack Language

Koredex– Bot that automatically fixes failing pytest tests and proves it worked

GAN-based power devices: Physics, Reliability, and Perspectives

Show HN: Lag – Super fast comms (now avail on CLI)

Show HN: Dialtone watcher – what is my laptop doing and am I normal

Scrum Masters, Don't Fall for the Abilene Paradox

Waymo Fun: The Self-Driving Car Revolution

Codegen Is Not Productivity

An x86-64 back end for raven-uxn

Snail Mail Sign-Ups

FCC Chair Threatens to Revoke Broadcasters' Licenses over War Coverage

The Font Design Game

Transformers from Scratch

Show HN: Dumped Wix, my AEC consultancy's storefront is now an AI Edge

Heavens Gate website is still online

Modern Java is pretty cool and you can't avoid it anymore

Show HN: I built two AI entities with shared memory and a portable identity spec

Show HN: Yak – Voice typing tool in Tauri/Rust that auto-presses Enter for you

The Web's Most Tolerated Feature

NetBlocks says Iran blackout enters day 16 as arrests target Starlink users

Hntropy – high-signal "related:" comments create story pairs

We turned plastic waste into vinegar: A sunlight-powered breakthrough

Show HN: Red Grid MGRS – Open-Source DAGR-Class GPS Navigator for iPhone

Why the Best Developers Resist Longest

Show HN: Portable signed proof for agent, API, and MCP interactions

Show HN: ReadingIsFun – ePub reader that lets your coding agent read along

DepGra – Visualize dependency vulnerabilities as an interactive graph

XF-103: The American Super-Plane That Never Was – The National Interest