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?

Care for a Little More AI?

Where the brain ends and the mind begins

Qwen3.8-Max just got upgraded

Thousands of University of Sydney staff on strike over AI and job security

Making of Jonathan Blow's Newest Game, Part I: The Game Design Supercollider

Ask HN: In EU: what tech conferences you won't miss?

The Toothbrush Test

Xanadu Was Waiting for Agents

Google Scholar profile shadowbanned (with no recourse)

A New Observable

Rule Against Perpetuities

Claude Fable 5.1 tops Artificial Analysis Index but costs 20% more

Fake 10 Downing Street listing exposes 'unfit' Booking.com, says consumer group

Alex van Halen Knighted

Architecture of Disappearance: The Kill Cloud's Dispersal of Violence

What is your AI era PowerPoint alternative?

Lean Game Server

GoPro Is Being Bought for $285M and Pivoting to AI and Defense Optics

Quine Clique: 51 programs in 51 languages that all print each other

My Claude.md

Postgres 19: Monitoring only gets better

Antirez Brings Vision to DS4, DeepSeek V4 Flash Runs Locally on an M5 Max

Brazilian scientist wins $500K for growing food with fewer chemicals

Analysis of all companies in Y Combinator's S26 batch

The Handshake Deal Protocol

Show HN: I Have Been Clawed – Index of coding agent incidents

Show HN: DirectXSplat – D3D12 Gaussian splat renderer, up to 2.4× gsplat FPS

Show HN: I built a tool that runs 258 automated checks against a WordPress site

OpenAI's Astra uses "recurrent depth" to think silently

Show HN: Gawkbot – open-source Grok bot with local vms for each bot