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?

Not-a-Linux distro review: SerenityOS is a Unix-y love letter to the '90s (2021)

NATO Scrambles Eurofighters, F-16s After Drone Enters Latvian Airspace

Quantum Annealing, Or, Do Weird Stuff (2013)

The New Berlin Wall

StoryScope: Investigating Idiosyncrasies in AI Fiction

Quantum Annealing

Evaluating Your Agentic Harnesses

Show HN: Rank and Run – No free version of this card game existed, so I made one

StarCraft: Brood War now runs natively on a 68k Amiga – first alpha release

Beyond the Userspace Call Stack: Subsystem Context for Detection Engineering

Unfit to Boot: Breaking U-Boot's Fit Signature Verification

Fish are facing a summer of death in UK's poisoned rivers

Show HN: Take a break, play some puzzles

Why does Opus 5 feel worse to work with?

Firetiger Joins Cursor

Major oil slick washes up on Iran coast after Hormuz ship strike

Source download: Browse, inspect and download every asset as a ZIP

Ask HN: Why was my Show HN flagged?

A Probe Direction Is a Property of Its Prompt

I want extern "fil-C"

WordPress Plugin Generator with AI

BuyMeACoffee dropped support for many countries, and nobody cares (2024)

Deep-Imager|One-Stop AI Image Generation Platform

Give Up on Your Creative Dreams

Building a software factory for AI SDK

Open knowledge compiler: a compiler for the open knowledge format

Chatbots are doing the work of Congress with little oversight

DeepSeek peak/off-peak pricing update

Gemini 3.7 Flash: On the Intelligence vs. Time per Task Pareto frontier

I burned $157,143 in tokens last month. I paid $400