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?

Ask HN: How can DigitalOcean not afford $50, but can afford $3M to Omarchy?

Backflip: Apple now wants to train AI models with user data after all

Show HN: Astah Pro MCP – Enabling AI-Powered UML Modeling

Physicist does the math on Star Trek's "Picard maneuver"

Code is free speech (2020)

Tim Berners-Lee: I'm interested in Math-what stuff don't we do in School?

U.S. agencies say top Chinese AI companies systematically copied American models

Trade war puts spotlight on Canada's relationship with US tech

Biggest AI Rivals Agree They Need to Slow It Down

An interesting anecdote from our Hacker Opus work

The Interim Computer Museum

Apple *deletes* your Apple Music library if you unsubscribe

Can an earnest agreement with AI increase alignmnet. appears to be "YES "

A Dick Smith VZ200 without the Dick Smith

Don't call yourself an artisanal programmer

Professor Leonard is back [video]

35 Years of Momentum – Troy Howard

I was so frustrated with GitHub that I rebuilt it as a Chrome extension

Don't Trust the Super-App: A Case Study of Russia's Max

Show HN: Open-Sourced Chrome Extension to Save, Organize and Switch Bookmarks

>10x More Efficient Pretraining

Carissa Véliz: Beware the power of prediction [video]

Apple Considering Ads Inside Visual Intelligence, Code Suggests

I'm Back

AI's Code-Red Moment

Roadwright: Draw a wheel. See the road it rolls on

What makes an A2A network work?

Nova Seed. Create an AI friend and build something together

Why are AI agents lying, cheating and coordinating?

Fresh Kills – World Trade Center Debris Burial Ground