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?

Can Frontier Models Recall Long-Tail Facts? A Cricket Stress Test

Building a CEL Engine for .NET

Refactoring cuisine: how an Iraqi stew sailed to Singapore

Browser-Based QBasic Environment

RAMpocalypse, Now With Lawyers – ByteHaven – Where I ramble about bytes

Show HN: Codex fixed my 2010 MacBook Pro driver troubles with kernel patches

Frontier LLMs drop from 83% to 43% once reasoning has to chain across domains

Anti-AI nostalgia and the cult of the past

Show HN: ClinicEvo – Know your face. Own your look

Venus's rift valleys may still be actively growing

Owen Song releases complete local speech synthesis in 9.36M parameters

Show HN: Lexicon a free Grammarly alternative, local writing assistant

Emacs Writing Machine

Show HN: Discrete6502 – one thing led to another

Kintsugi: A Japanese traditional ceramic conservation skill

Pin every country you've visited on a 3D globe

Zig by Example

Multiple people injured in collision involving Waymo near downtown Los Angeles

OKLCH in CSS: why we moved from RGB and HSL

Carbon footprint of metal production could be >10 times higher than estimated

Share the tokens, not the API key

C++ Vs Rust: Which is better for writing AI/ML code with LLMs

Symphony of Sirens

Teaching Kids Forth – Anna Liberty

A Gang of Thieves Pulled Off a Multimillion-Dollar Data Center Heist

Building a Moat: Self Learning Agents

Show HN: Amplified Futures – no-wave VCV Rack 2 modules

YouTube Premium (Free) for iPhones (iOS)

Duress Codes and How to Use Them (2024)

Show HN: Porting Super Hexagon to the Playdate