frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Circular Obstacle Pathfinding (2017)

https://redblobgames.github.io/circular-obstacle-pathfinding/
1•kqr•44s ago•0 comments

Data-Center Builders Are Racing to Offload Stakes Worth Billions

https://www.wsj.com/finance/investing/data-center-builders-are-racing-to-offload-stakes-worth-bil...
1•doener•50s ago•0 comments

Spitting chips: A dive into the data and token industry, & who carries GPU risk

https://reneweconomy.com.au/spitting-chips-a-deep-dive-into-the-data-and-token-industry-and-who-c...
1•ggm•1m ago•0 comments

Why do some emoji look familiar?

https://jenniferdaniel.substack.com/p/why-do-some-new-emoji-look-familiar
2•lacieargyle•3m ago•0 comments

Chip toolmaker ASML expected to shine light on capacity and China challenges

https://www.reuters.com/world/china/chip-toolmaker-asml-expected-shine-light-capacity-china-chall...
2•technewssss•3m ago•0 comments

Show HN: QPilot – paste a manual test case, AI runs it in Chrome

https://github.com/broxhq/qpilot
1•Muhammad-21•5m ago•0 comments

Your 'App' Could Have Been a Webpage (so I fixed it for you)

https://danq.me/2026/07/09/your-app-could-have-been-a-webpage/
1•buildfocus•10m ago•0 comments

Satya Nadella has issued a warning to companies using AI

https://techcrunch.com/2026/07/13/satya-nadella-has-issued-a-shocking-warning-to-companies-using-ai/
2•nlpnerd•10m ago•0 comments

Improving Windows Search Box, with less clutter and more control

https://blogs.windows.com/windows-insider/2026/07/13/improving-windows-search-box-with-less-clutt...
1•thm•10m ago•0 comments

Simulating everything, sort of: The promise and limits of world models

https://arstechnica.com/ai/2026/07/simulating-everything-sort-of-the-promise-and-limits-of-world-...
2•thm•13m ago•0 comments

The OpenAI Super App, ChatGPT = Codex, Whither Chat

https://stratechery.com/2026/the-openai-super-app-chatgpt-codex-whither-chat/
1•swolpers•13m ago•0 comments

Global Nobel Laureates Assembly on AI and Nuclear War

https://globalnobelassembly.org/
2•dn2k•14m ago•0 comments

Don't Use aria-label on Static Text Elements (2024)

https://benmyers.dev/blog/dont-use-aria-label-on-static-text-elements/
1•birdculture•14m ago•0 comments

The Joy of Extending Tailwind

https://dan-webnotes.com/posts/2026-07-14-joy-extending-tailwind/
2•dandep•18m ago•0 comments

Why 2 Degrees of Global Warming Means And6 Degrees in Europe

https://www.tobiasreithmeier.de/en/blog/why-2-degrees-global-warming-means-6-in-europe
2•JuriKeller•20m ago•0 comments

Improve Router Hygiene to Protect Against Russian State-Sponsored Targeting

https://www.cisa.gov/news-events/cybersecurity-advisories/aa26-194a
2•giuliomagnifico•21m ago•0 comments

The Unfair Judge: A Mechanistic Interpretability Account of LLM-as-Judge

https://arxiv.org/abs/2607.11871
1•sbulaev•26m ago•0 comments

Euclid discovers the most ancient quasar in the Universe

https://www.esa.int/Science_Exploration/Space_Science/Euclid/Euclid_discovers_the_most_ancient_qu...
3•emot•28m ago•0 comments

Vizro: Upload spreadsheets. Get answers in minutes

https://www.vizro.ai
1•welsenesbros•30m ago•0 comments

UK Tokenization Roadmap Puts £33B on the Table and a Clock on the Wall

https://www.disruptionbanking.com/2026/07/14/uk-tokenization-roadmap-puts-33-billion-on-the-table...
2•emsidisii•33m ago•0 comments

Mensfeld/code-on-incus: Give each AI agent its own isolated machine

https://github.com/mensfeld/code-on-incus
1•Tomte•37m ago•0 comments

Rethinking MCP Security: A Large-Scale Study of Runtime MCP Servers

https://arxiv.org/abs/2607.11086
1•sbulaev•39m ago•0 comments

Making Software: How to make a font

https://www.makingsoftware.com/chapters/how-to-make-a-font
2•Garbage•39m ago•0 comments

The bubble of the age; or, The fallacy of railway investment (1848) [pdf]

https://dn721608.ca.archive.org/0/items/bubbleofageorfal00smit/bubbleofageorfal00smit.pdf
1•rfv6723•39m ago•0 comments

Zig creator calls Bun's Claude Rust rewrite 'unreviewed slop'

https://www.theregister.com/devops/2026/07/14/zig-creator-calls-buns-claude-rust-rewrite-unreview...
1•giamma•41m ago•4 comments

The Noise Floor of Latent Dissent, Interview with Harry Halpin Founder of NymVPN

https://diffractionscollective.com/2026/04/30/the-noise-floor-of-revolt-harry-halpin/
1•hansvs•42m ago•1 comments

JPEG for ASTC

https://github.com/BinomialLLC/basis_universal/wiki/JPEG-for-ASTC
1•edflsafoiewq•45m ago•0 comments

Ask HN: US Equivalent of Anabin?

1•xqb64•48m ago•0 comments

Introduction to Mainframe Scripting Languages

https://zubairidrisaweda.medium.com/introduction-to-mainframe-scripting-languages-83c1edd86e3e
2•rbanffy•48m ago•0 comments

Can a Dozen Blue States Block the Paramount-Warner Merger?

https://www.wsj.com/business/media/can-a-dozen-blue-states-block-the-paramount-warner-merger-494e...
3•JumpCrisscross•48m ago•0 comments
Open in hackernews

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?