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?

Thruact – agents name a job, not a vendor

The Pyramid Community Relay

Show HN: AI as Cognitive Gym Equipment

U.S. bond intervention is like 'paying your mortgage with your credit card,'

Calamites is a genus of extinct arborescent (tree-like) horsetails

Why do we get sleepy? How neurons control sleep drive

One of the worst scientific papers I've ever seen

Multilingual people may have brains up to 13 years younger

Enlightenment

Show HN: New poems, written by real people

Wildfires across Europe detonate forgotten World War bombs

Sea Turtle Sex Crisis: Why 99% Are Now Female

The Optimization Theory of Everything

Gen-1.5 – The robot that one-shot learns with humans

What the Newest Research on Wildfire Smoke Tells Us

Citadel Offloads 80% of Portfolio Scooped Up from Situational Awareness

Device Goes Past Equilibrium [Steve Mould] [video]

Show HN: I launched the most generous leaderboard

FDA Approves Moderna's mRNA Flu Vaccine

Grasp: Simple protocol for code collaboration that uses interoperable servers

Song (server of Nostr-powered Git) is a simple personal Git server

Does Python still need to be async-first?

Self-host your own software factory

Model Genome: Fingerprinting Whether an LLM Was Trained from Scratch or Derived

Show HN: ClearVoice TTS, SOTA voice cloning model running offline, in an iOS app

Multi-Agent Harness for Visual Design

The Rise of the Sovereign Individual

New physics: LBL/Davis showing fusion persists at ultra low energies

ssh sshfighter.com

Show HN: Free Vision TUI Library for Go