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?

Would SpaceXAI Acquire Vercel?

Pdfboss – fast rust-based pdf library, with Python bindings

TwitterWebViewer has been permanently discontinued

Claude Max for OSS developer plan of Matz (Ruby) is running out

Archil Persistent Sandboxes

Ask HN: How do we get our US Cellular (T-Mobile?) phone number back? (complex)

Reflexio: Reduce task failure by 36% while saving token by more than 50%

Dimethylmercury Poison MIT

What Hanging from a Bar for 30 Seconds Can Do for Your Body

Build with Muse Image: generate, edit, and compose images on Meta Model API

Show HN: SplatIt. Self-hosted game servers for Splatoon on Wii U

Spotify Backstage Meet LiteLLM for Corporate AI Governance

Sonic Pi

Claude: Free Plan for Scientists

Accel-SIM 2.0: Validated GPU Simulation with Full Hopper Support

France opens door to fighter jet cooperation with Sweden

A Little Less Software Clutter

Vertical Tornado/Waterspout [video]

CSVLint helps you to check that your CSV file is readable

Ask HN: AI writes better code than me. How to keep my identity?

Show HN: Blast – Open-source sandbox-as-a-service

Researchers Put Spinach into Bread and Saw the Body's Insulin Response Change

U.K. Supreme Court Opens Door for Spyware Victims to Sue Foreign States

WAL and S3: Lakebase storage for the era of agents

PJ Harvey Tuesday #5

Artwork-TUI – spreadsheet-driven generative art tool in the terminal

Brain Doesn't Think in Words

Firekeep

Origami Projector: a Glitch-like app for site editing

Disturbed loners probably pose an exponentially increasing threat to society