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?

Maybe Nepo Baby – A Wikipedia extension that flags (maybe) famous parents

Free Internship Aggregator

Show HN: Telem – Route agent web search across providers and inspect the traces

He Vanished During the 1912 Olympic Marathon–Then Finished It 54 Years Later

Benchmarking Pocket-Scale Inference

Government Is Inefficient, and (Partly) for Good Reason

OpenAI, Anthropic issue dire cyber threat warning

Fewer Americans Pay to Use LLMs Than Still Pay to Play World of Warcraft

Golink: A private shortlink service for tailnets

Get noticed in NYC on my backpack

Cartesia tops text-to-speech leaderboard with Sonic 3.6

Ask HN: How many of you juggle multiple agent sessions at the same time?

You Are Allowed to Reject LLMs

Mosaic – MCP Logic Puzzle

Everyone hates datacentres. Do we need them? – video

Accountability

Not American Enough

Show HN: OpenWand – A mission to remove chat interface from working with AI

There Aren’t Really 30 Million Vegetarians in Brazil

Why social media harms are hard to regulate

Rendering MNIST as a Matrix style screensaver

Warp for Desktop and Cloudflare for Teams

Ads and tracking infiltrated TVs. Now they're coming for monitors

Anthropic Gets Ready to Vie for Defense Contracts Again

Single file apps with Gleam and Bun

Why do OpenAI's GPT-2 weights beat mine? Part four: digging into dropout

I said Route 53 was a database. Colin took it personally

A philosopher's guide to thinking for yourself in an age built to think for you

Ask HN: Was Quad9 ECS down for anyone else today at UTC 1PM?

NASA Astronaut Jonny Kim Departs Agency to Continue Military Service