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?

What the Halting Problem Means for Python Security

Tournesol – Collaborative Content Recommendations

The Truth About AI: It's Not Intelligence, It's a Trick – Prof Jiang Xueqin

Bring Back the Gatekeeper, Please

Heat adds to strains on areas with data centers

Journey to the Moon by Jules Verne

Red-Pill Robots Only, Please (2012) [pdf]

Ask HN: Why are so many "AI evangelists" posting such insufferable content?

Launchpanda: Save your product info once, launch everywhere

Ask HN: Will AI force CS to focus on what to build instead of how to build it?

Show HN: RetainFlow – Subscription Retention for WooCommerce

Interpretable Coreference Resolution Evaluation Using Explicit Semantics

The Next Evolution in Human Logic

Platonic Hydrocarbons

Meta makes cloud push to sell excess AI compute power capacity

No Te Dejes: La Lauren Pena Play

Jujutsu (JJ) Release v0.43.0

Amodei told lawmakers that open-source AI is moving down a "dangerous path"

Devin Desktop, Replacing Windsurf

Valve explains why it isn't subsidizing the Steam Machine

Should I go open-source or give free trial and then charge the users?

Qwen-Image-Agent: Bridging the Context Gap in Real-World Image Generation

Show HN: Context.md – A proposed standard for AI project context

My Most Profitable Experience: How I'm Trying to Hit $800/Day Fast

Messi or Ronaldo? Your political ideology may play a part

Google testing controversial webcam-based reCAPTCHA that asks for a hand scan

"Dimension 20s" Lore Keeper, Skye Smith, on Why AI Can't Replace Her

No laptop? No problem. Code on the Go brings the debugger to your phone

iPhone 18 Pro Could Use Qualcomm Modem in the US and C2 Elsewhere

Coordination Repository Pattern and Pi-Env