Packed Data Support in Haskell

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

77•matt_d•7mo ago

Comments

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

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

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

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

cstrahan•7mo ago

No, one example of why being variable sized integers.

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

carterschonwald•7mo ago

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

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

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

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Washington Must Break Its Promise on Social Security

Metaverse Solutions

Google, Nvidia, and OpenAI – Stratechery by Ben Thompson

I Went All-In on AI. The MIT Study Is Right

Hasktorch: LibTorch Haskell bindings for deep learning using FFI

Formal Proof: LLM Hallucinations Are Structural, Not Statistical (Coq Verified)

Unfinished infrastructure, wasted funds: Colombia's 'white elephants' exposed

We cut multi-turn AI agent cost/latency by ~80–90% with one small change

PG_AI_Query: AI-powered SQL generation and query analysis for PostgreSQL

Vibe coding is not the same as AI-Assisted engineering

How do you manage user feedback and early adopter input?

Kling O1, the first unified multi-modal video foundation model

AWS and Google build a fix for multi-cloud barriers they said didn't exist

Chatbot with Lazy Mode (LLMParty)

YouTube Transcript

Deep Metric Learning: A (Long) Survey

China's AJX-002 Xluuv and the Geopolitics of Undersea Power

In the Middle

I turned ChatGPT/Claude web sessions into a local REST API

What History's Fallen Societies Have in Common

WordPress plugin quirk resulted in UK Gov OBR Budget leak [pdf]

Who the Hell Is Using Facebook Dating?

Shopify Outage

Show HN: LogCost – map logging cost to specific log lines

Are We Trusting ChatGPT-5 with Our Mental Health

The Next Frontier in AI Isn't More Data

DeepSeek-v3.2: Pushing the Frontier of Open Large Language Models

Shopify Admin Down

India orders smartphone makers to preload state-owned cyber safety app

Is AI Eating the World?