frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Show HN: SafeClaw – a way to manage multiple Claude Code instances in containers

https://github.com/ykdojo/safeclaw
1•ykdojo•3m ago•0 comments

The Future of the Global Open-Source AI Ecosystem: From DeepSeek to AI+

https://huggingface.co/blog/huggingface/one-year-since-the-deepseek-moment-blog-3
1•gmays•3m ago•0 comments

The Evolution of the Interface

https://www.asktog.com/columns/038MacUITrends.html
1•dhruv3006•5m ago•0 comments

Azure: Virtual network routing appliance overview

https://learn.microsoft.com/en-us/azure/virtual-network/virtual-network-routing-appliance-overview
1•mariuz•5m ago•0 comments

Seedance2 – multi-shot AI video generation

https://www.genstory.app/story-template/seedance2-ai-story-generator
1•RyanMu•8m ago•1 comments

Πfs – The Data-Free Filesystem

https://github.com/philipl/pifs
1•ravenical•12m ago•0 comments

Go-busybox: A sandboxable port of busybox for AI agents

https://github.com/rcarmo/go-busybox
2•rcarmo•12m ago•0 comments

Quantization-Aware Distillation for NVFP4 Inference Accuracy Recovery [pdf]

https://research.nvidia.com/labs/nemotron/files/NVFP4-QAD-Report.pdf
1•gmays•13m ago•0 comments

xAI Merger Poses Bigger Threat to OpenAI, Anthropic

https://www.bloomberg.com/news/newsletters/2026-02-03/musk-s-xai-merger-poses-bigger-threat-to-op...
1•andsoitis•13m ago•0 comments

Atlas Airborne (Boston Dynamics and RAI Institute) [video]

https://www.youtube.com/watch?v=UNorxwlZlFk
1•lysace•14m ago•0 comments

Zen Tools

http://postmake.io/zen-list
1•Malfunction92•17m ago•0 comments

Is the Detachment in the Room? – Agents, Cruelty, and Empathy

https://hailey.at/posts/3mear2n7v3k2r
1•carnevalem•17m ago•0 comments

The purpose of Continuous Integration is to fail

https://blog.nix-ci.com/post/2026-02-05_the-purpose-of-ci-is-to-fail
1•zdw•19m ago•0 comments

Apfelstrudel: Live coding music environment with AI agent chat

https://github.com/rcarmo/apfelstrudel
1•rcarmo•20m ago•0 comments

What Is Stoicism?

https://stoacentral.com/guides/what-is-stoicism
3•0xmattf•21m ago•0 comments

What happens when a neighborhood is built around a farm

https://grist.org/cities/what-happens-when-a-neighborhood-is-built-around-a-farm/
1•Brajeshwar•21m ago•0 comments

Every major galaxy is speeding away from the Milky Way, except one

https://www.livescience.com/space/cosmology/every-major-galaxy-is-speeding-away-from-the-milky-wa...
2•Brajeshwar•21m ago•0 comments

Extreme Inequality Presages the Revolt Against It

https://www.noemamag.com/extreme-inequality-presages-the-revolt-against-it/
2•Brajeshwar•21m ago•0 comments

There's no such thing as "tech" (Ten years later)

1•dtjb•22m ago•0 comments

What Really Killed Flash Player: A Six-Year Campaign of Deliberate Platform Work

https://medium.com/@aglaforge/what-really-killed-flash-player-a-six-year-campaign-of-deliberate-p...
1•jbegley•23m ago•0 comments

Ask HN: Anyone orchestrating multiple AI coding agents in parallel?

1•buildingwdavid•24m ago•0 comments

Show HN: Knowledge-Bank

https://github.com/gabrywu-public/knowledge-bank
1•gabrywu•29m ago•0 comments

Show HN: The Codeverse Hub Linux

https://github.com/TheCodeVerseHub/CodeVerseLinuxDistro
3•sinisterMage•31m ago•2 comments

Take a trip to Japan's Dododo Land, the most irritating place on Earth

https://soranews24.com/2026/02/07/take-a-trip-to-japans-dododo-land-the-most-irritating-place-on-...
2•zdw•31m ago•0 comments

British drivers over 70 to face eye tests every three years

https://www.bbc.com/news/articles/c205nxy0p31o
43•bookofjoe•31m ago•15 comments

BookTalk: A Reading Companion That Captures Your Voice

https://github.com/bramses/BookTalk
1•_bramses•32m ago•0 comments

Is AI "good" yet? – tracking HN's sentiment on AI coding

https://www.is-ai-good-yet.com/#home
3•ilyaizen•33m ago•1 comments

Show HN: Amdb – Tree-sitter based memory for AI agents (Rust)

https://github.com/BETAER-08/amdb
1•try_betaer•33m ago•0 comments

OpenClaw Partners with VirusTotal for Skill Security

https://openclaw.ai/blog/virustotal-partnership
2•anhxuan•34m ago•0 comments

Show HN: Seedance 2.0 Release

https://seedancy2.com/
2•funnycoding•34m ago•0 comments
Open in hackernews

What the hell is an elliptic curve?

https://onlynv.dev/blog/what-the-hell-is-an-elliptic-curve
65•thecommieaxo•9mo ago

Comments

Muromec•9mo ago
ECDH is an amazing example of layers of abstraction (and not just indirection) -- you have an algorithm working on points on the curve, which have their own math, but the curve is definef over GF which have their own math. Having to deal with that was interesting experience.
tamad•9mo ago
This is a simple explanation of an interesting and useful mathematical application my 12-15 yo students can conceptually grab onto. Good to have, they’ll enjoy it.
seanalltogether•9mo ago
> The ECDLP involves finding the integer k such that P = k * G, where P is a point on the curve, G is a known point (the generator point), and k is the ephemeral key. The difficulty of this problem is what makes ECC secure.

I feel like I'm missing something in the example below this statement. I can type in 'hello world' and there is no P on the curve in the graph if I zoom it out, just a bunch of points that seem disconnected from the curve itself.

slooonz•9mo ago
Yes. This is partly why this article is crap. k*G is never defined, and is the core operation in ECC (also: the article insist on using an elliptic curve in R, but you need to do it on a finite field, because on a smooth curve you can just use a smooth interpolation to solve the logarithm — and obviously once you go on a finite field the curve no longer looks nice, it’s just a seemingly random cloud of points).

Very roughly speaking, putting the complication of "point at infinity" problem under the rug, a characteristic feature of a EC is that a straight line passing through two points on the curve will pass through a third point on the curve (yes, unless you take a vertical line, point at infinity). So you can define an "addition of points on the curve" : take two points A and B, draw a straight line passing through them, name the third intersection point between the line and the curve C, declare A + B = C (actually there’s a symmetry around the x axis involved for the usual properties of addition to hold, another complication, let's sweep it under the rug too).

(for A = B, take the tangent of the curve at A ; in R you can see that it works because you can take the limit as B goes arbitrarily close to A : that gives you the tangent ; in a finite field that’s less obvious but the algebraic proof is the same)

So k*G is just G + G + ... + G, k times.

If you want more details, your favorite reasoning LLM can do a better job explaining what I’ve swept under the rug.

SilverSlash•9mo ago
What a non-article. How did this get to the top of hn? I feel like I learned close to nothing.
Retr0id•9mo ago
As someone who already understands how ECC works, I learned a negative amount.
choonway•9mo ago
my favorite application of elliptic curves is this:

https://www.reddit.com/r/puzzles/comments/azf0zo/im_stuck_on...

punpunia•9mo ago
For me this article was not nearly deep enough for me to understand elliptical curve cryptography. What I learned was the equation of an elliptical curve and that it is used in cryptography, the rest was inscrutable.
hug•9mo ago
The entire problem of the article is summed up this paragraph:

> The ECDLP involves finding the integer k such that P=k⋅G, where P is a point on the curve, G is a known point (the generator point), and k is the ephemeral key. The difficulty of this problem is what makes ECC secure.

So uh. What is P? Why do I want to work it out? What’s G? Why do I know it, or not know it? Also k. I assume I know maybe one of these values, but maybe I know none.

Why does any of this make anything secure? I get, in general, that knowing numbers that someone else doesn’t know is good for me to be good at security with someone else, but is it?

… just not good.

nxpnsv•9mo ago
I feel this is what came out of the author’s llm chat of choice…
lelanthran•9mo ago
> What I learned was the equation of an elliptical curve and that it is used in cryptography, the rest was inscrutable.

It's not inscrutable, it's missing.

crispyambulance•9mo ago

   >   The ECDLP involves finding the integer k such that P=k⋅G, where P is a point on the curve, G is a known point (the generator point), and k is the ephemeral key. The difficulty of this problem is what makes ECC secure.
I am trying to match up the statement above with the visualization directly below it where they show the generator point, G, on the curve. The plot shows k, the ephemeral key, as another point-- but it's NOT an integer, k is a point! And then there's a Q, which is the public key, and that's not described in the paragraph above at all. Nor is P shown in the plot.

I don't get it?

coolThingsFirst•9mo ago
I have similar issues, it's poorly explained.
perihelions•9mo ago
The notation is inconsistent because it's an LLM and it's hallucinating notation.
zkmon•9mo ago
The form y^2 = x^3 + bx + c prohibits intuition and probably follows from the general form for an algebraic expression: ax^n + bx^(n-1) + ...

The whole idea of an algebraic expression is to relate x and y (for 2D). What's the simplest relation?

y/x = r => we have a straight line with slope r. Let's add a bit more detail.

(y-b)/(x-a) = r => we shift the origin to (a,b) and check how the line looks.

These relations can also get "self-aware". This is similar to how a rate of change can be self-aware (ex: d/dx f(x) = x). The rate of water drain out from a tap at the bottom of the water tank would depend on the water height which itself affected by the drain out. Something like that.

(y-b)/(x-a) = x => That is a "self-aware" relation, because we replaced r (a constant) with the variable x. So we have a parabola now.

Let's change gears a bit. we will use higher degree for variables

y^2/x^2 = r => For positive values of r, we have a pair of straight lines.

Now, ((y-a)(y-b))/((x-c)(x-d)) = r => What happened? we get a conic.

Let's make it self-aware

((y-a)(y-b))/((x-c)(x-d)) = x => There it is. A cubic equation

Digging deeper, we see that the self-awareness makes the curve to bring the left-side parts to join at finite distance rather than at negative infinity. To understand this, consider the pair of straight lines (y^2/x^2 = r). You might see that it is a pair of straight lines crossing each other. But you can also look at two sharply bent lines touching each other at a point. a conic has a bit smoother turn.

BrandoElFollito•9mo ago
This is a very cool way of presenting this, thanks
mr_mitm•9mo ago
> This is especially important for devices with limited resources, like smartphones and IoT devices. This efficiency is one of the reasons why ellipti

I doubt there has been a smartphone in history that had even the slightest issue with RSA. When thinking of devices with limited resources, we should probably think of smart cards and such.

Retr0id•9mo ago
The "enter text to sign" demo is pure nonsense. If I enter "AAAAA", it's "encrypted" to "4242424242". What's that supposed to mean? Was this vibe-coded?

Edit: The article has since been edited to disclaim "values are not encrypted realistically" - sure, use small numbers for demonstration purposes etc., but what is being demonstrated here? You've added scare-quotes to "encrypted" but what is the actual intended meaning?

zkmon•9mo ago
Unfortunately the article itself doesn't provide any insights or even the reason why it is called "elliptic" curve or why it makes a good candidate for cryptographic use. The author has no clue about the topic other than putting a catchy title.
tveita•9mo ago
For a more substantial explanation see e.g. "A gentle introduction to elliptic-curve cryptography"

https://media.ccc.de/v/31c3_-_6369_-_en_-_saal_1_-_201412272...

smallmancontrov•9mo ago
For those who are interested, the xargs.org intro article goes deeper and discusses point addition, continuous -> modular+discrete, and how it is used for key exchange.

https://curves.xargs.org/

josh-sematic•9mo ago
When I clicked the original article, I was hoping for something like this. Thank you!
coolThingsFirst•9mo ago
> The ECDLP involves finding the integer P is a point on the curve, G is a known point (the generator point), and k is the ephemeral key. The difficulty of this problem is what makes ECC secure.

But P on the image isn't on the curve it's at the origin.

nneonneo•9mo ago
Looking at elliptic curves over the reals makes for pretty pictures, but really fails to convey why ECC should be secure at all.

As an example, the function m => m^65537 is a completely useless encryption function over the reals because it's trivial to take 65537-th roots over R (even if the numbers are unwieldy in size), but it's a surprisingly strong encryption function when computed over certain finite groups (i.e. RSA).

Similarly, any ECC scheme defined over real numbers is pretty useless. It only gets interesting when you use a finite field. Unfortunately, the math is less simple that way.

Retr0id•9mo ago
Agreed. I have a draft article (far from finished) with my own attempt to explain ECC, and the opening diagram is the classic "pretty pictures" with a big red cross through them. They have surprisingly little relevance in the overall picture of ECC.
perihelions•9mo ago
Is this an AI slop? Is this an AI slop where the AI wrote and embedded an executable code example? That's a new one to me.
eapriv•9mo ago
Terrible. I stopped reading after this nonsense: “The graph of this equation looks like a smooth, looping curve, which is where the name "elliptic" comes from.”
lelanthran•9mo ago
This is an unusually poor explanation. There is no indication or example (using small numbers) of how ECC works, there's just a function and a picture of the curve it generates.
llm_nerd•9mo ago
I guess people are upvoting based purely on the title, as yeah this is just a horrible stump of a page. There is a much better (but still only an absolute intro) CloudFlare explanation at

https://blog.cloudflare.com/a-relatively-easy-to-understand-...

tempodox•9mo ago
The article doesn't answer the titular question, it's just an ad for vaporware.
VStack•9mo ago
We have a whole free playlist introducing ECs from a mathematical to practical applications to ECC: https://www.youtube.com/watch?v=sH8ybvIlLvM&list=PL6N_Y7ao_a...

We're working on a certified course that will should be available at https://quantumformalism.academy/courses. It will cover post-quantum cryptography as well.

sebtron•9mo ago
> The graph of this equation looks like a smooth, looping curve, which is where the name "elliptic" comes from.

This is completely made up. The name comes from "elliptic integral". From the Wikipedia page on Elliptic Curves:

> An elliptic curve is not an ellipse in the sense of a projective conic, which has genus zero: see elliptic integral for the origin of the term.

https://en.wikipedia.org/wiki/Elliptic_curve

pdpi•9mo ago
Pointless article.

Superficial description of what an elliptic curve is, even less than superficial description of what a discrete logarithm is (including absolutely no mention of what it being discrete means) or how that applies to elliptic curves, and there is no mention of finite fields either.

incogitomode•9mo ago
Article seems to have vanished, and the content was eerily similar to what I got from Gemini 2.5 Pro. Seems like spam for this service.