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?

Talk: The P2P chat from 1983 that a VPN brought back to life

Grafana > Datadog

The Prague of Deus Ex: Mankind Divided

Hotseat – Bid for the #1 public ranking spot

Take-notes – turn a video, article or paper into one self-contained HTML note

AI;DR or Don't be a meat proxy

A cyberpunk game where the hacks are real (except one district)

Locus: Deterministic AST safety firewall for AI agents in pure Rust (<0.05ms)

Show HN: A simple budget app focused on how much you can spend each day

Minecraft Could Run on the Wii

Disclosure Has a Billionaire Problem

Opus 5 feels, in a word, hostile

Show HN: Mcploitable – The "Metasploitable" of the Model Context Protocol

My theme switch was running 3164 animations

The unbearable slowness of being: Why do we live at 10 bits/s?

Real world(ish) DeepSeek V4 Flash performance on a single MI300X

Building Without Predicting

I made a web puzzle game based on logic questions that 99% of people fail

Show HN: Free, non-profit crypto AML screening – no key, no trial

ChatGPT-Taught Experts Are Crippling Agentic AI

The Brain Is Just Specialized Agents Talking to Each Other – Dr. Jeff Beck [video]

New AirPods designed to capture paired color images

Amid intense backlash, people are vandalizing Flock surveillance cameras

Do we still need GitHub?

Tell HN: US LLM models are smarter outside US working hours

Edgerton, KS sues citizens trying to put data center ban before voters

System reminders – how Claude Code steers itself

My own embedding models benchmark focused on code duplication detection

The Controversial Academic (Nathan Cofnas) Who Ignited the Jason Arday Furor

Felony charges for citizen deleting phone data at US Border