frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Introduce the Vouch/Denouncement Contribution Model

https://github.com/ghostty-org/ghostty/pull/10559
1•DustinEchoes•2m ago•0 comments

Show HN: SSHcode – Always-On Claude Code/OpenCode over Tailscale and Hetzner

https://github.com/sultanvaliyev/sshcode
1•sultanvaliyev•2m ago•0 comments

Microsoft appointed a quality czar. He has no direct reports and no budget

https://jpcaparas.medium.com/microsoft-appointed-a-quality-czar-he-has-no-direct-reports-and-no-b...
1•RickJWagner•4m ago•0 comments

Multi-agent coordination on Claude Code: 8 production pain points and patterns

https://gist.github.com/sigalovskinick/6cc1cef061f76b7edd198e0ebc863397
1•nikolasi•4m ago•0 comments

Washington Post CEO Will Lewis Steps Down After Stormy Tenure

https://www.nytimes.com/2026/02/07/technology/washington-post-will-lewis.html
1•jbegley•5m ago•0 comments

DevXT – Building the Future with AI That Acts

https://devxt.com
2•superpecmuscles•5m ago•4 comments

A Minimal OpenClaw Built with the OpenCode SDK

https://github.com/CefBoud/MonClaw
1•cefboud•6m ago•0 comments

The silent death of Good Code

https://amit.prasad.me/blog/rip-good-code
2•amitprasad•6m ago•0 comments

The Internal Negotiation You Have When Your Heart Rate Gets Uncomfortable

https://www.vo2maxpro.com/blog/internal-negotiation-heart-rate
1•GoodluckH•8m ago•0 comments

Show HN: Glance – Fast CSV inspection for the terminal (SIMD-accelerated)

https://github.com/AveryClapp/glance
2•AveryClapp•9m ago•0 comments

Busy for the Next Fifty to Sixty Bud

https://pestlemortar.substack.com/p/busy-for-the-next-fifty-to-sixty-had-all-my-money-in-bitcoin-...
1•mithradiumn•9m ago•0 comments

Imperative

https://pestlemortar.substack.com/p/imperative
1•mithradiumn•10m ago•0 comments

Show HN: I decomposed 87 tasks to find where AI agents structurally collapse

https://github.com/XxCotHGxX/Instruction_Entropy
1•XxCotHGxX•14m ago•1 comments

I went back to Linux and it was a mistake

https://www.theverge.com/report/875077/linux-was-a-mistake
2•timpera•15m ago•1 comments

Octrafic – open-source AI-assisted API testing from the CLI

https://github.com/Octrafic/octrafic-cli
1•mbadyl•17m ago•1 comments

US Accuses China of Secret Nuclear Testing

https://www.reuters.com/world/china/trump-has-been-clear-wanting-new-nuclear-arms-control-treaty-...
2•jandrewrogers•17m ago•1 comments

Peacock. A New Programming Language

1•hashhooshy•22m ago•1 comments

A postcard arrived: 'If you're reading this I'm dead, and I really liked you'

https://www.washingtonpost.com/lifestyle/2026/02/07/postcard-death-teacher-glickman/
2•bookofjoe•23m ago•1 comments

What to know about the software selloff

https://www.morningstar.com/markets/what-know-about-software-stock-selloff
2•RickJWagner•27m ago•0 comments

Show HN: Syntux – generative UI for websites, not agents

https://www.getsyntux.com/
3•Goose78•28m ago•0 comments

Microsoft appointed a quality czar. He has no direct reports and no budget

https://jpcaparas.medium.com/ab75cef97954
2•birdculture•28m ago•0 comments

AI overlay that reads anything on your screen (invisible to screen capture)

https://lowlighter.app/
1•andylytic•29m ago•1 comments

Show HN: Seafloor, be up and running with OpenClaw in 20 seconds

https://seafloor.bot/
1•k0mplex•30m ago•0 comments

Tesla turbine-inspired structure generates electricity using compressed air

https://techxplore.com/news/2026-01-tesla-turbine-generates-electricity-compressed.html
2•PaulHoule•31m ago•0 comments

State Department deleting 17 years of tweets (2009-2025); preservation needed

https://www.npr.org/2026/02/07/nx-s1-5704785/state-department-trump-posts-x
3•sleazylice•31m ago•1 comments

Learning to code, or building side projects with AI help, this one's for you

https://codeslick.dev/learn
1•vitorlourenco•32m ago•0 comments

Effulgence RPG Engine [video]

https://www.youtube.com/watch?v=xFQOUe9S7dU
1•msuniverse2026•33m ago•0 comments

Five disciplines discovered the same math independently – none of them knew

https://freethemath.org
4•energyscholar•34m ago•1 comments

We Scanned an AI Assistant for Security Issues: 12,465 Vulnerabilities

https://codeslick.dev/blog/openclaw-security-audit
1•vitorlourenco•35m ago•0 comments

Amazon no longer defend cloud customers against video patent infringement claims

https://ipfray.com/amazon-no-longer-defends-cloud-customers-against-video-patent-infringement-cla...
2•ffworld•35m ago•0 comments
Open in hackernews

Show HN: Are the Riemann Hypothesis and Navier-Stokes the Same Problem?

https://www.academia.edu/145639105/Two_Millennium_Prize_Problems_A_Geometric_Framework_for_the_Riemann_Hypothesis_and_Navier_Stokes_Regularity
7•kristintynski•1mo ago
The functional equation ξ(s) = ξ(1-s) identifies σ with 1-σ. Topologically, this turns the critical strip into a torus. The critical line σ = ½ is the throat.

Now treat ξ(s) as a stream function. Its gradient is a velocity field. The flow is automatically:

• Incompressible (ξ is holomorphic → Cauchy-Riemann → ∇·v = 0)

• Symmetric (functional equation → v(σ) = v(1-σ))

THE CONNECTION

    Zeta Function          Fluid Dynamics
    ─────────────          ──────────────
    ξ(s)                   Stream function
    |ξ|²                   Pressure
    Zeros of ξ             Pressure minima (p = 0)
    σ = ½                  Torus throat
THE THEOREM

For symmetric incompressible flow on a torus, pressure minima must lie on the symmetry axis. Interactive: https://cliffordtorusflow.vercel.app/

Why? A symmetric function p(σ) = p(1-σ) can only have a unique minimum at σ = ½.

Zeros are pressure minima → zeros at σ = ½ → Riemann Hypothesis.

NOW FOR NAVIER-STOKES

Beltrami flows (where vorticity ∥ velocity, i.e., ω = λv) have a similar structure. The vortex stretching term—the thing that causes blow-ups—becomes:

    (ω·∇)v = (λv·∇)v = (λ/2)∇|v|²
That's a gradient. Gradients have zero curl: ∇ × (∇f) ≡ 0.

No curl contribution → no vorticity growth → no blow-up.

THE PUNCHLINE

Both problems are: "Given a symmetric structure on a torus, prove things concentrate at the throat."

• RH: Zeros (pressure minima) → throat (σ = ½)

• NS: Flow (enstrophy) → Beltrami manifold (no blow-up)

Same geometry. Same mechanism. Same problem.

Interactive visualization: https://cliffordtorusflow-git-main-kristins-projects-24a742b...

WHAT I VERIFIED

• 40,608+ points with certified interval arithmetic

• 46 rigorous tests pass

• Pressure minima all at σ = 0.500

• Enstrophy bounded (ratio = 1.00)

Repository: https://github.com/ktynski/clifford-torus-rh-ns-proof

Paper (18 pages): https://github.com/ktynski/clifford-torus-rh-ns-proof/blob/m...

Either I've found a deep connection, or I've made an error that connects two unrelated problems in the same wrong way. Both would be interesting.

Comments

kristintynski•1mo ago
Interactive Torus: https://cliffordtorusflow.vercel.app/
bhouston•1mo ago
As someone who knows the Navier-Stokes fairly well ( https://scholar.google.ca/citations?user=--UmWDUAAAAJ&hl=en ) I have to admit I this is completely impenetrable for me. I don't understand why there is a Pressure minima nor a Torus throat on the Fluid Dynamics side of things. Why does it jump to Beltrami flows off of a sudden? I have no clue how to interpret this. Maybe the issue is that I understand Navier-Stokes from an engineering/application standpoint rather than the theoretical side?
jjgreen•1mo ago
If you don't like this proof of the RH, the same author has four others to try: https://independent.academia.edu/KristinTynski
fjfaase•1mo ago
Verifying a limited set of points does not count as a mathematical proof, unless you have some proof that by verifying these points it implies to be true for all points.
kristintynski•1mo ago
The paper/codebase contain more than numerical verification, let me clarify the actual proof structure.

The proof is analytic, with numerical verification as a sanity check: 1. Anchoring lower bound (Hadamard product + zero density): A(s) ≥ c₁ · (σ-½)² · log³(t) Uses only: N(T) ~ (T/2π)log(T) [Riemann-von Mangoldt, unconditional - doesn't assume RH]

2. Curvature upper bound (growth estimates): |K| ≤ c₂ · log²(t) Uses only: Standard bounds on |ζ'/ζ| [Titchmarsh, unconditional]

3. Dominance (algebra): log³(t) >> log²(t), so A dominates |K| asymptotically Therefore E'' = E(K + A) > 0

The numerical verification checks that the argument works in the finite regime (low t) where asymptotic bounds may not apply. It's a sanity check, not the proof. The full circularity audit is in the repo - every dependency traces back to unconditional results (functional equation, zero density, growth estimates), never to RH itself.

fjfaase•1mo ago
There has been a recent number of submissions to wild proofs or theories generated with the help of AI. See [1] and [2] as examples.

According to the LinkedIn page [3] mentioned at the GitHub page, the author has bachelor degree in Communication from Boston College. Either the author is a self-made genius at the level of Ramanujan or has are rather superficial understanding of mathematics and is simply good at prompting the right AI agents.

[1] https://news.ycombinator.com/item?id=46379409

[2] https://news.ycombinator.com/item?id=46430060

[3] https://www.linkedin.com/in/kristintynski/

Retr0id•1mo ago
Or, it's all nonsense AI slop.