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?

Surge in scams as fraudsters use AI to target people

Monitoring LLM Inference with Prometheus and Grafana (vLLM, TGI, Llama.cpp)

Even More Batteries Included with Emacs

The next frontier of innovation is coming back to the physical world

Smashed Toilet Phone Web Server

DBOS Network Sensing: A Web Services Approach to Collaborative Awareness

Decouple the Agent: Why Prompts, Tools, and Models Don't Belong in Your Client

AI Has Amnesia. Here's Every System Built to Fix It

Ask HN: How do you design CLIs for agents?

Lsp85 – an lsp for the Intel 8085 assembly

Show HN: Go-To-Market for Engineers article series

Netlify Drop

Tech's Next IPO Wave Promises a Charitable Windfall

iOS 27's Reworked Stub Islands

Argentina Wants to Let AI Own Companies. Here's What That Means

CoCoMS (Construction Correspondence Management System)

Sync – Quality Control and Project Management System for AI Agents

Polis – the #1 tool for AI agent coordination

Why You Need to Become a Neuro-Punk Right Now

US and Iran reach cease fire agreement

Molecular Diversity as a Biosignature

Kevin Warsh Wants the Fed to Stop Explaining Everything

BEAVER: Enterprise benchmark for LLM Text-to-SQL from private data warehouses

Show HN: Astro Sidey – A simple, minimalistic personal blog theme

Your Database Is the Bottleneck. Not Your Code

On, Good Advice Delivered Poorly

Under the River

The More Confident in AI Security, the More Likely Breached, Study Finds

The hallucinogenic mushroom that contains no known psychedelic

Learn to Think in Systems, It'll Put You Ahead of 99% of People [video]