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?

I Talked to a Squirrel Today

Over half of parents of 18-25 year-olds track adult children w smartphone apps

To study how chips work, MIT researchers built their own operating system

Can Ukraine Isolate Crimea?

Tell HN: The bloatification of SpaceX stock has started

Show HN: We polled 2,122 Americans on AI and regulation, and built a visualizer

"They screwed us": Personality clashes sent Anthropic's models offline

Chebyshev Polynomials and Their Derivatives in C

Boot Naked Linux

HTTPS: //webhook.site live testing of web hooks

AI Slop Has Taken over LinkedIn

Show HN: machine0 – Persistent NixOS VMs You Control from the CLI

GPT-5 Nano Vulnerability test results you should know before deploying

Show HN: An interactive Snake circuit you can take apart, no CPU

Why Dragon Quest Has Always Been More Popular in Japan (2023)

Verifiable Execution: Proving How Work Happened in Workflows and Agents

Ficus Elastica

"I reverse engineered Verizon's VoWiFi and called from a laptop modem"

Linux 7.0 Adds Support for BPF Filtering to IO_uring

Code a Database in 45 Steps

AI GPUs probably live longer than three years

UK unveils social media ban for users under 16

Show HN: We put voice agent on our website, learned retrieval isn't bottleneck

Large Text Compression Benchmark

Locus Founder from Locus (YC F25)

Britain Announces Social Media Ban for Children

AI Won't Fix a Company That Can't Ship

The Bright Side of ADHD: Dr. Ned Hallowell on Embracing and Succeeding with Add

Show HN: Continuous Nvidia CUDA PC Sampling Profiler

SHOW HN: I created a Show HN social app where you can show your projects