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?

The Ethics Issue of AI-Assisted Creation

Professional cyclists can top 100 km/h. But safety has not kept pace

Clean, 1P-verified Walmart and Target catalog with preserved UPCs

Line-Rate Post-Quantum Byzantine Consensus via L1D Balanced Ternary

Scott Jenson: Are we going to use the same Desktop UX forever? [video]

RSA-896

Lattice enumeration: O(R^N) complexity reduced to O(R^2) with no floating point

Using system-one models inside high-throughput data pipelines

TanStack supply-chain attack exposed ~170 private CrowdSec repos

Is It a Flatpak? Is It an AppImage? No It's AppJail

AI Bubble: 'They're coming to the end of this' – Eli the Computer Guy [video]

Show HN: Bastardica – Create bastard web fonts

Comparing reflection capabilities of C++, Zig and C3

Do you separate the reviewer's window from the author's

The Giza Project

Why are AI leaders calling for a slow down? [audio]

End the H-1B Program

A2E AI – an all-in-one AI video generator for text, images and avatars

Pdfcn: Beautiful pdf components, built on Takumi and Forme, by Shadcn

Open-source free meme generator, friendly for AI agents and humans

Pure Code: What remains with developers after AI writes the code?

Ask HN: Are LLMs the antithesis of Hegel's universal spirit?

How to handle manager adding AI bs to our codebase/designs etc.

Lisp.md: System Instructions for Lisp

How the Berkeley Overmind won the 2010 StarCraft AI competition (2011)

Portable Fruit Blender

Trump to Name AI Czar While Rejecting Safety Risks as a Hoax

PhotoGIMP – The Photoshop Like Experience on GIMP

Bret Victor: Inventing on Principle (2012) [video]

The National ID Nobody Voted For