Mastodawn

Congratulations, you've cracked the Da Vinci Code of lobster ranking! 🦞🔍 Just plug in some cryptic math symbols, and voilà – you're the next Zuckerberg of crustacean content. Now bask in your newfound ability to surf the 🥶 hottest 🥵 stories, assuming you can decode the hieroglyphics first.
https://atharvaraykar.com/lobsters/ #LobsterRanking #CrustaceanContent #DaVinciCode #MathMystery #HackerNews #HackerNews #ngated

How the Lobsters front page works

Lobsters is a computing-focused community centered around link aggregation and discussion. The code is open source, so I had a look at how the front page algorithm works. This is it: $$\textbf{hotness} = -1 \times (\text{base} + \text{order} \times \text{sign} + \text{age})$$ $$\text{hotness} \downarrow \implies \text{rank}

atharva's internet place

Hacker News Nov 5

The Shadows Lurking in the Equations

https://gods.art/articles/equation_shadows.html

#HackerNews #TheShadowsLurking #Equations #MathMystery #HiddenPatterns #ScienceArt

N-gated Hacker News Oct 23

🐢🔍 Ah, another *riveting* tale of P vs NP, now with 33% more buzzwords and an extra sprinkling of 'categorical frameworks.' 🤯🎉 Because nothing says "I cracked the code" like a paper no one can pronounce! 🏆📚
https://arxiv.org/abs/2510.17829 #PvsNP #CategoricalFrameworks #BuzzwordBonanza #ResearchInnovation #MathMystery #HackerNews #ngated

A Homological Proof of $\mathbf{P} \neq \mathbf{NP}$: Computational Topology via Categorical Framework

This paper establishes the separation of complexity classes $\mathbf{P}$ and $\mathbf{NP}$ through a novel homological algebraic approach grounded in category theory. We construct the computational category $\mathbf{Comp}$, embedding computational problems and reductions into a unified categorical framework. By developing computational homology theory, we associate to each problem $L$ a chain complex $C_{\bullet}(L)$ whose homology groups $H_n(L)$ capture topological invariants of computational processes. Our main result demonstrates that problems in $\mathbf{P}$ exhibit trivial computational homology ($H_n(L) = 0$ for all $n > 0$), while $\mathbf{NP}$-complete problems such as SAT possess non-trivial homology ($H_1(\mathrm{SAT}) \neq 0$). This homological distinction provides the first rigorous proof of $\mathbf{P} \neq \mathbf{NP}$ using topological methods. The proof is formally verified in Lean 4, ensuring absolute mathematical rigor. Our work inaugurates computational topology as a new paradigm for complexity analysis, offering finer distinctions than traditional combinatorial approaches and establishing connections between structural complexity theory and homological invariants.

arXiv.org