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?

Nvidia Challenges Apple Silicon with New RTX Spark PC Chip

Show HN: Cloud CI and agentic workflows for embedded hardware development

Why _Am_ I Interested in Your Company?

AI Agent Discovery via DNS

Human-Centered Reinforcement Learning [pdf]

Self-Hosting on the Dark Web

Nvidia Nemotron 3 Super

BYD will pay for crashes on its FSD competitor, something Tesla never has

React adoption drops from 36% to 20% once you remove Vercel-hosted launches

Why is Lidl opening a pub?

Nvidia CEO Jensen Huang Delivers Keynote at Computex 2026 in Taiwan (Good Audio) [video]

Efficiently Cooling Satellite Components in Space

Nvidia CEO Jensen Huang speaks at Computex 2026 (2:06:24 Video)

A JavaScript PoC FROST side channel a browser tab that senses your SSD activity

The Spam Economy Comes to Work

The Axis That Made the Chips

Termux: X11 is a fledged X server built with Android NDK

Undigested fructose linked to anxiety and brain inflammation

When Background AI Agents Become a Security Boundary Problem

Nvidia announces new AI chip for personal computers

Google's top result is 16yo when searching for "Ubuntu 24.04 install fonts"

Thermal conductivity modulation as a mechanism of thermotolerance in tardigrades

Why Melanoma Spreads More in Middle Age

Sixteen Kids and a Hit Man (2024)

Lynching Postcard

Show HN: Postbase – 100% open source Alternative to Firebase and Supabase [video]

Rebuilding the Access Edge: Why We Replaced PPPoE with a Custom DHCP Server

Show HN: Curtab – Each command in its own interactive terminal tab

China Aims A.I. At Predicting Who Could Pose a Political Risk

Show HN: Open-source sync-engine for managing websites at scale