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?

Florida utility companies' lobbying linked to rising electric bills

Managed Deep Agents is now in public beta

Think, Don't Speak

Terafab by Tesla

Musk's SpaceX to build $100B launch facility in Louisiana

Buying power. Do Duke Energy's NC campaign donations fuel influence?

Show HN: Weavit UI – A Weaviate GUI for macOS, Windows and Linux

Linear probing for confidence estimation of simulations

The Commodore 77, an All-New Cyberpunk 2077 Collaboration

Big Tech's Frantic Race to Quell the Growing Backlash to AI

Letter from Dolly Parton to Eminem

Dependencies in the LLM API Reseller Ecosystem

Show HN: Building a marketplace where you post a need and pick who helps

Locking 1B coins for 200 years with OP_CHECKLOCKTIMEVERIFY

Show HN: Declaude

US consumer spending on Apple's App Store fell for the first time in a decade

Novel class of medications, orexin receptor antagonists, for insomnia

Show HN: Using Golang to Speed Up Monte Carlo Simulations

Nvidia Is Speedrunning the Creation of a Synthetic Hyperscaler

Amazon announced it's shuttering Mechanical Turk on Sept. 30

Self-Hosting Email: Achieving Proton's Zero-Access with Stalwart and WKD

Tom Robbins' Remington SL3 Typewriter from "Still Life with Woodpecker"

Ask HN: Interesting Tech Adjacent Jobs?

Europe Built a Single Market–Now It's Packaging It Away

Native Java with GraalVM and Virtual Threads on Kubernetes

US halts all immigrant visa applications amid tightening restrictions

Joint Optimization of Tool Creation and Use for Large Language Model Agents

Training LLMs to write tools generalized beyond self use

Free Startup Dataroom Template

Ora benchmarks every major AI agent on Vercel – Customers