🐿️ ScourBrowse
LoginSign Up
You are offline. Trying to reconnect...
Copied to clipboard
Unable to share or copy to clipboard
🌍 Topological Codes

Surface Codes, Homological Error Correction, Quantum Preservation, Information Topology

The cheat codes of technological progress
exponentialview.coΒ·1hΒ·
Discuss: Hacker News
βš›οΈInformation Physics
Raymond Laflamme (1960-2025)
scottaaronson.blogΒ·2dΒ·
Discuss: Hacker News
βš›οΈQuantum Tape
Unla: Instantly turn APIs n MCP servers into MCP servers,no code changes needed
github.comΒ·3hΒ·
Discuss: Hacker News
πŸ”ŒInterface Evolution
Writing Toy Software Is a Joy
quiz.businessexplain.comΒ·12hΒ·
Discuss: Hacker News
πŸ”©Systems Programming
Bitmasking for Granular Backend RBAC: A Beginner's Guide
dev.toΒ·1dΒ·
Discuss: DEV
πŸ”Homomorphic Encryption
Quantizing for Noisy Flash Memory Channels
arxiv.orgΒ·2d
πŸ›‘οΈPreservation Proofs
🌐 What Is AWS Networking? (And Why It’s the Backbone of Your Cloud Setup)
dev.toΒ·5hΒ·
Discuss: DEV
πŸ–₯️Self-hosted Infrastructure
RepuNet: A Reputation System for Mitigating Malicious Clients in DFL
arxiv.orgΒ·12h
πŸ”BitFunnel
How to build a MCP (model context protocol) server for UI libraries + repo
dev.toΒ·4hΒ·
Discuss: DEV
πŸ”ŒInterface Evolution
A Set-to-Set Distance Measure in Hyperbolic Space
arxiv.orgΒ·2d
πŸŒ€Hyperbolic Geometry
Passwordless Auth: a JSON-Based Approach for modern authentication w/ SSSD & GNOME - DevConf.CZ 2025
youtube.comΒ·7h
πŸ”“Password Cracking
Optimal Parallel Algorithms for Convex Hulls in 2D and 3D under Noisy Primitive Operations
arxiv.orgΒ·2d
πŸ“ŠComputational Geometry
Tiny Deltas, Big Wins: Schema-less Thrift Patching at Planet Scale
hackernoon.comΒ·1d
πŸ“‹Protocol Buffers
Causal discovery in deterministic discrete LTI-DAE systems
arxiv.orgΒ·12h
🧠Machine Learning
Finetuning a Weather Foundation Model with Lightweight Decoders for Unseen Physical Processes
arxiv.orgΒ·1d
πŸ”Type Inference
Memory Safety in Web Rust System Zero Cost Secure(1750885516953300οΌ‰
dev.toΒ·19hΒ·
Discuss: DEV
πŸ¦€Rust Borrowing
The most efficient algorithm for detecting claws in general graphs, with a runtime of O(m Ξ”) β€” where m is the number of edges and Ξ” is the maximum degree β€” is n...
dev.toΒ·1dΒ·
Discuss: DEV
πŸ”—Topological Sorting
Counting with Categories (Part 2)
golem.ph.utexas.eduΒ·2d
πŸ”€Category Theory
High-order adaptive multi-domain time integration scheme for microscale lithium-ion batteries simulations
arxiv.orgΒ·1d
βš™οΈTape Engineering
Deformable Medical Image Registration with Effective Anatomical Structure Representation and Divide-and-Conquer Network
arxiv.orgΒ·1d
πŸŒ€Differential Geometry
Loading...Loading more...
AboutBlogChangelogRoadmap