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?

CSS Grid Lanes

A List of Books to Learn Programming with Ruby and Rails (2023)

When Your Private Fund Turns $1 into 60 Cents

The 'Race Against Time' to Save Music Legends' Decaying Tapes

Show HN: AI interview coach I built at 17 after bombing my first interview

A "Ready-to-Use" Template for LLVM Out-of-Tree Passes

The gift card accountability sink

Where Was My Generic Prescription Drug Made?

AskHnWisdom

Toffee Crisp and Blue Riband can't be called chocolate any more

Verify long-horizon tasks with GEPA on the judge

Show HN: Fylo – Forms, but Fun

These are the flying discs the government wants you to know about

Deprecated Developers: A manifesto for building what comes next

Braid: Bounded reasoning for LLMs using symbolic Mermaid graphs

He Built a Privacy Tool. Now He's Going to Prison [video]

Embracing New Technologies and Players in Payments

Mini-SGLang: Efficient Inference Engine in a Nutshell

Categories in RSS Feed Titles

Buteyko Method

Chemical Hygiene

Show HN: Netrinos – A keep it simple Mesh VPN for small teams

Jeffrey Epstein Files Released

Can You Get a "0% Down, Near-Treasury Rate" Mortgage from the Options Market?

Show HN: I Built an Image Captioning Tool Using Llama.cpp

Cold Cases in the AI Era

The lightest notes app implementation

A Message from AI Research Leaders: Join Us in Supporting OpenReview

School security AI flagged clarinet as a gun. Exec says it wasn't an error

The Big-O Complexity of Vibe Coders