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?

War Department Rebrands CDAO to Super Intelligence Office

Ups cargo plane collides with passenger jet at Miami International Airport

Zelenskyy accuses SpaceX of lying about Starshield

Top scorer in South Korea tax exam admits AI cheating

Everything is part of your interface, mkdir edition

Show HN: Pocket Garden – a player interface to over 130 AI based web games

Animated HTML presentations from a single Typst file

Working as Intended [video]

ML Modules for Mere Mortals

Bone-Marrow transplants offer surprising way to treat mitochondrial diseases

GTA6 Radio Wheels

Inbox Zero for the ADHD Mind

Can the AI boom make enough money to sustain itself?

Jensen Huang's exit from Nvidia impacts China's AI supply chain

I Investigated the Online Sports Betting Industry. DraftKings Closed My Account

Ask HN: Tips for maintainability of large software projects using agents?

Victoria University lecturers steer students away from AI use in education

Member-Governed AI Inference Cooperative

Five web developers built an iOS keyboard extension with Expo

A Multitasking Universal Operating System for Atari ST Computers

Japan's Hometown Tax

The Southern African Bi-Oceanic Railway Could Be a Game-Changer

Linting, but this time it's personal

The Joy of True Mental Effort

FOSDEM 2027 Accepted Stands: complete list

30 Years for Moving a Box

Grok Apps Exposed xAI's Business Secrets and People's Private Data

The Ocarina of Time remake in 100 screenshots

Building a 40k lumen DIY lamp

32 Coding Agent Apps Reviewed