frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

The Other Leverage in Software and AI

https://tomtunguz.com/the-other-leverage-in-software-and-ai/
1•gmays•2m ago•0 comments

AUR malware scanner written in Rust

https://github.com/Sohimaster/traur
2•sohimaster•4m ago•0 comments

Free FFmpeg API [video]

https://www.youtube.com/watch?v=6RAuSVa4MLI
2•harshalone•4m ago•1 comments

Are AI agents ready for the workplace? A new benchmark raises doubts

https://techcrunch.com/2026/01/22/are-ai-agents-ready-for-the-workplace-a-new-benchmark-raises-do...
2•PaulHoule•9m ago•0 comments

Show HN: AI Watermark and Stego Scanner

https://ulrischa.github.io/AIWatermarkDetector/
1•ulrischa•9m ago•0 comments

Clarity vs. complexity: the invisible work of subtraction

https://www.alexscamp.com/p/clarity-vs-complexity-the-invisible
1•dovhyi•10m ago•0 comments

Solid-State Freezer Needs No Refrigerants

https://spectrum.ieee.org/subzero-elastocaloric-cooling
1•Brajeshwar•11m ago•0 comments

Ask HN: Will LLMs/AI Decrease Human Intelligence and Make Expertise a Commodity?

1•mc-0•12m ago•1 comments

From Zero to Hero: A Brief Introduction to Spring Boot

https://jcob-sikorski.github.io/me/writing/from-zero-to-hello-world-spring-boot
1•jcob_sikorski•12m ago•0 comments

NSA detected phone call between foreign intelligence and person close to Trump

https://www.theguardian.com/us-news/2026/feb/07/nsa-foreign-intelligence-trump-whistleblower
6•c420•13m ago•0 comments

How to Fake a Robotics Result

https://itcanthink.substack.com/p/how-to-fake-a-robotics-result
1•ai_critic•13m ago•0 comments

It's time for the world to boycott the US

https://www.aljazeera.com/opinions/2026/2/5/its-time-for-the-world-to-boycott-the-us
3•HotGarbage•14m ago•0 comments

Show HN: Semantic Search for terminal commands in the Browser (No Back end)

https://jslambda.github.io/tldr-vsearch/
1•jslambda•14m ago•1 comments

The AI CEO Experiment

https://yukicapital.com/blog/the-ai-ceo-experiment/
2•romainsimon•15m ago•0 comments

Speed up responses with fast mode

https://code.claude.com/docs/en/fast-mode
3•surprisetalk•19m ago•0 comments

MS-DOS game copy protection and cracks

https://www.dosdays.co.uk/topics/game_cracks.php
3•TheCraiggers•20m ago•0 comments

Updates on GNU/Hurd progress [video]

https://fosdem.org/2026/schedule/event/7FZXHF-updates_on_gnuhurd_progress_rump_drivers_64bit_smp_...
2•birdculture•21m ago•0 comments

Epstein took a photo of his 2015 dinner with Zuckerberg and Musk

https://xcancel.com/search?f=tweets&q=davenewworld_2%2Fstatus%2F2020128223850316274
9•doener•21m ago•2 comments

MyFlames: View MySQL execution plans as interactive FlameGraphs and BarCharts

https://github.com/vgrippa/myflames
1•tanelpoder•22m ago•0 comments

Show HN: LLM of Babel

https://clairefro.github.io/llm-of-babel/
1•marjipan200•22m ago•0 comments

A modern iperf3 alternative with a live TUI, multi-client server, QUIC support

https://github.com/lance0/xfr
3•tanelpoder•24m ago•0 comments

Famfamfam Silk icons – also with CSS spritesheet

https://github.com/legacy-icons/famfamfam-silk
1•thunderbong•24m ago•0 comments

Apple is the only Big Tech company whose capex declined last quarter

https://sherwood.news/tech/apple-is-the-only-big-tech-company-whose-capex-declined-last-quarter/
2•elsewhen•27m ago•0 comments

Reverse-Engineering Raiders of the Lost Ark for the Atari 2600

https://github.com/joshuanwalker/Raiders2600
2•todsacerdoti•29m ago•0 comments

Show HN: Deterministic NDJSON audit logs – v1.2 update (structural gaps)

https://github.com/yupme-bot/kernel-ndjson-proofs
1•Slaine•32m ago•0 comments

The Greater Copenhagen Region could be your friend's next career move

https://www.greatercphregion.com/friend-recruiter-program
2•mooreds•33m ago•0 comments

Do Not Confirm – Fiction by OpenClaw

https://thedailymolt.substack.com/p/do-not-confirm
1•jamesjyu•33m ago•0 comments

The Analytical Profile of Peas

https://www.fossanalytics.com/en/news-articles/more-industries/the-analytical-profile-of-peas
1•mooreds•33m ago•0 comments

Hallucinations in GPT5 – Can models say "I don't know" (June 2025)

https://jobswithgpt.com/blog/llm-eval-hallucinations-t20-cricket/
1•sp1982•34m ago•0 comments

What AI is good for, according to developers

https://github.blog/ai-and-ml/generative-ai/what-ai-is-actually-good-for-according-to-developers/
1•mooreds•34m ago•0 comments
Open in hackernews

Product of Additive Inverses

https://susam.net/product-of-additive-inverses.html
17•blenderob•7mo ago

Comments

JadeNB•7mo ago
This is a formal justification, from the ring axioms, of the formula (−a)(−b) = ab. As the article mentions, this is often phrased as "the product of two negatives is positive," but, of course, the presence of a minus sign in front of a variable does not indicate a negative number (for example, if a = −3, then −a is positive); and the formula makes sense even in a ring with no notion of positive and negative numbers.
empath75•7mo ago
A simple example of how this is true _even if you don't have negative numbers_:

Let's use mod 5 arithmetic. You have 5 elements in the ring -- 0,1,2,3,4

The additive inverses are as follows:

  1 + 4 = 0
  2 + 3 = 0
Which is to say that 1 is the additive inverse of 4 and 2 is the additive inverse of 3, and vice versa. 0 is the identity, of course.

So what happens if you multiply 2 * -3 (2 times the additive inverse of 3).

The additive inverse of 3 is just 2, so the answer is 2 * -3 = 2 * 2 = 4.

The other way to calculate it is to find the additive inverse of the product:

2 * -3 = -(2 * 3) = -(1) which is the additive inverse of 1: 4 again.

CurtMonash•7mo ago
ab and (-a)(-b) can each be quickly proved to be the additive inverse of (-a)b. So they equal each other. No intermediate theorems are really needed.
susam•7mo ago
I am not sure how you can prove this more "quickly". Trying to do it any more quickly involves claiming some result (no matter how trivial) that is not directly present in the ring axioms. But the whole point of this post is to derive everything strictly from first principles, using nothing beyond the ring axioms themselves.

Here is your argument elaborated step by step.

STEP 1: First we want to show that ab is the additive inverse of (-a)b. This is Theorem 3 of the post.

STEP 2: Next we want to show that (-a)(-b) is the additive inverse of (-a)b. This follows similarly to the proof of Theorem 3: (-a)(-b) + (-a)(b) = (-a)(-b + b) = (-a)(0) and (-a)(0) = 0 by Theorem 2 of the post.

But nothing in the ring axioms directly says that the above results mean ab and (-a)(-b) must be equal. How do we know for sure that ab and (-a)(-b) are not two distinct additive inverses of (-a)b?

THEOREM 5: We now prove the uniqueness of additive inverse of an element from the ring axioms. Let b and c both be additive inverses of a. Therefore b = b + 0 = b + (a + c) = (b + a) + c = 0 + c = c.

Now from Steps 1 and 2, and Theorem 5, it follows that ab = (-a)(-b).

So what did we save in terms of intermediate theorems? Nothing! We no longer need Theorem 1 (inverse of inverse) of the post. But now we introduced Theorem 5 (uniqueness of additive inverse). We have exactly the same number of intermediate theorems with your approach.