Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•7mo ago

Comments

nine_k•7mo 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•7mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•7mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•7mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•7mo 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•7mo 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•7mo 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•7mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Anytime Algorithm

TypeSlayer – a TypeScript types performance tool [video]

I build a live crypto-sentiment analyzer

Pebble Index

Neuroscientist Doris Tsao joins Astera to lead its new neuroscience program

Parachutists told to check software after jumper dangled from a plane

Tool for analyzing GitLab SOS bundles without Elasticsearch

A Letter from My Grandfather

A Friendly Guide to Exorcising Maxwell's Demon (Paper)

The Component Gallery

Fish Alpinism

Weird Generalization and Inductive Backdoors: New Ways to Corrupt LLMs

Slovenia gives cash constitutional protection

China's AI Power Play: Cheap Electricity from Biggest Grid

Portals must bend gravity [video]

GLM-4.6V: Open-Source Multimodal Models with Native Tool Use

Ask HN: Why are people using Claude or ChatGPT when Gemini is free?

Trump launches $1M 'gold card' immigration visas

Is it possible to fix the "Power Law" problem in user-generated content?

Are there Proton Drive alternatives with true client-only key handling?

OpenAI (2015)

Shapes Inc founders committed the cardinal sin of mass emailing by CCing

The Wild West tale of the first cow-buffalo hybrid

A list of parks around the world that are perfect to sit down and enjoy a book

Instagram gives users control of their algorithms in new feature

Oil Tanker U.S. Seized Has Faked Its Location Before, Data Shows

High Performance SSH/SCP

Show HN: DocLet – End-to-end encrypted storage with user-owned key branches

Incomplete list of mistakes in the design of CSS

Oracle Credit Risk Gauge Deteriorates After Earnings Report