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?

Machine-Generated and Checked Proofs for a Verified Compiler (Experience Report)

What my dad taught me about AI coding in the 90s

How Far Can NYC Transit Take You?

Playing whack-a-mole is losing

Pluralistic: How Canada can help Americans and defeat America

Handling 8 thousand mouse refreshes per second in Godot Engine

UK will use Ukraine battlefield data to train AI and use it againsts protesters

FreeToken: Efficient Edge-Native Moe Serving with Bandwidth-Adaptive Execution

Iran Is Using Foreign Criminals to Attack Its Critics Overseas

The cost of today's "smart" devices

The Official Ig Nobel Card Game Is Born, Improbably

Bookshelf – Self-hosted eBook library that runs on object storage

Tiny, fast Windows Notepad replacement (source available)

SQLite as a Document Database (2020)

The text mode lie: why modern TUIs are a nightmare for accessibility

Evaluating Shrinking (Experience Report)

From Gradients to ChatGPT

Show HN: AiSyncing – Back up your AI coding assistant memories to GitHub

Directory navigator that doesn't require you to visit a folder first

War Machines: Netflix Confirms Sequel to Hit Sci-Fi Movie War Machine

Characterizing the spiral: potential mechanisms in AI-associated delusions

Mission impossible? Quantifying military emissions

Show HN: Flostep – Diagrams people can actually walkthrough

Lean: Postmortem for the Kernel Soundness Bug Hunt

Epigenetic aging biomarker responsiveness to longevity interventions in humans

Show HN: Mainly – a self-hosted mail client built for your multiple domains

Equations explained colorfully with KaTeX and Markdown

Codeanywhere Is Sunsetting

Show HN: Stigmergy, a Karpathy-style LLM wiki for a team, not one person

OpenDryFire – 10x cheaper laser dry-fire scoring from a webcam and mic