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?

Why local AI – and why it matters

Braess's Paradox

Bobby Prince's Doom (1993) Soundtrack Inducted into Library of Congress

Phoebus Cartel

Build your own vulnerability harness

Finding the Link Uber Missed: How to Connect AI Code Spend to Business Value

Show HN: NetSentinel – a local network security scanner and connectivity monitor

BookMarkr – Local first visually organized bookmark Chrome extension

Unreal deprecrates Blueprints, their visual programming language in UE6.1

Lakehouse//RT: Real-Time Performance on a Unified Lakehouse

How to Drive an LLM

What 'Getting Your Hands Dirty' Means at LLM-Era

The new HTTP QUERY method explained

Gemini provides phone number of scammer posing as Delta Airlines

Ask HN: What do you use for scientific presentations?

Show HN: UAVs FYI – Drone database with supply chain data, API and CLI

GLM-5.2: Chop off 84% of the volume from a 1.5TB model, still retain 82% power

Claude Artifacts

Show HN: One-click fork of "Everything Claude Code" onto an isolated microVM

Trillions of dollars spent just to work on customer services?

Capitol Alpha Machine – interactive viz of congressional stock trades

GCP IAM Authorization Bypass

Show HN: Avera – a deterministic check that proves no regression was introduced

Build yor form back end infrastrture under 30sec

Elysia Marginata

RemotePower – self-hosted fleet monitoring with built-in vulnerability scanning

Show HN: I was drowning in browser tabs, so I built this

Icon.museum – A curated gallery of app icon design

Impossible Challenge

Terminal-Bench Challenges: long-horizon, token-intensive, single-task benchmarks