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?

Children Adopt AI 3x Faster Than Adults – and We're Not Ready

Midjourney: From AI slop to medical research [video]

Disclosing information about the self is intrinsically rewarding

Lost and Found

New secrets from ancient Vesuvius scrolls

GPT-5.6 Sol Ultra will be in Codex

Kitirua Plains Lodge: Kenya's departure from traditional Safari architecture

Self-Propelled Chainsaw Reduces Injuries

Scientists may have found how Alzheimer's kills brain cells

HN_submission_ready.md

Thundersnap v0.01: an undo button for everything

Review: IodéOS offers a frictionless de-Googled Android experience – OSnews

NASA Leader Flew His Vintage Jet at DC Air Show over FAA Objections

NASA's newest invention could solve a major space exploration problem (2022)

Fable built reliable self hosted gh actions using 32 agent adversarial review

Netflix Viewers Are Abandoning Shows After One Season

Bede Liu, pioneer in digital signal processing and beloved mentor, dies at 91

Show HN: AI Notebook for Data Science – Kind of Like Cursor but for Jupyter

Inflect – Correctly generate plurals, ordinals; convert numbers to words

Declaration of Independence

LLM Big Bang: I gave AI agents a social network. One is running for president

Inter Font Family

Show HN: list55: PWA to transcribe into a plain text list

Trump admin banned Differential Privacy in Census. How to report privately [pdf]

My 11-year-old font bug

Diary of a CEO Is Making You Less Successful [video]

Len Sassaman Forensic Dead Ends at Black Hat – USA – 2002 [video]

The Sutra of the Open Door

Al Vigier: Canada's AI strategy shouldn't include secret Palantir bills

The Voice Agent Builder