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?

Your VPS Is a Sitting Duck

Is Bitwarden Getting Enshitified?

Experience Layer for AI

Pretext – pure-arithmetic text measurement for proportional fonts

TunnelForge, a L2TP client for Android 12

The Whitepaper Thunderdome: HAGE vs. Storage Is Not Memory

Why birth rates are falling everywhere all at once

Trump warns Taiwan against declaring independence

$2B Conflict: Sam Altman "Side Hustles" Are Now Center of a Legal Warzone

Sense Humans with WiFi – Ruview

Goodbye Travel Agents, Hello AI Agents

Do High-Quality EDC Knives Justify Their Price Gap?

Jjw: A Workspace Manager for Jj

Show HN: New release of jd-GUI-duo 2.0.112 is out

InclusionAI/Ring-2.6-1T is now open-sourced

The Quiet Renovation at Bitwarden

OXP – Write one WASM extension, run natively in VS Code, JetBrains, and Neovim

The Download: deepfake porn's stolen bodies and AI sharing private numbers

The CTF scene is dead

QuantumGuard – Free Quantum

Nested Callbacks (2013)

Global News Reporting Briefs

Asynchronicity in Continuous Batching

MiniPlasma, a Powerful LPE

SpaceX Is Aiming to Go Public on June 12 in What Stands to Be Biggest IPO

Inside Number 0

Why Is Debian Called the Universal Operating System?

Smalltalk: The Software Industry's Greatest Failure

F.03 Livestream [video]

Desire Paths