Gist: the seed for the curve has unknown origin. Possible attack: let's say there is an attack possible on 1/10^6 curves. Just loop through a million curves until you find one vulnerable, and publish it into the standard.
When I tried to read Crime and Punishment, I got confused by all the characters. When I tried to look things up online, I got spoilers!
So I created an illustrated reader (using Claude Fable) which updates as you read, so that there are no spoilers buy you can follow along with the story.
I built a small, free site for reading public-domain books (magicbookshelf.org). Today, it has three books:
1. The Brothers Karamazov
2. Crime and Punishment
3. Pride and Prejudice
You don't have to make an account and there are no ads. I just think the classics deserve a nicer home than a wall of plain text.
When I first tried reading Karamazov, it was really difficult for me to keep up with everything.
Karamazov is the book where everyone gets lost in the names. Alexey / Alyosha / Alyoshka, Dmitri / Mitya, Fyodor Pavlovitch, Smerdyakov, two different Ivanovnas. The usual fix is to keep a wiki or a character list open, but those spoil everything that happens later.
So the reader comes with a companion I call the Margin: a guide to the people, places, and ideas in each book that only ever shows what you'd know at your current point.
For example.. Alyosha's entry while you're in chapter 3 and you get who he is by chapter 3, with nothing about his later arc.
A few notes:
The translation is Constance Garnett
There's optional narration if you'd rather listen.
I make and run it on my own, so if you spot a wrong note in the Margin, a typo, or an entry that gives away too much too early, please tell me.
Beyond the sensationalization here’s what Terry had to say -“ In any case, I would indeed say that this is a situation in which the AI-generated paper inadvertently highlighted a tighter connection between two areas of mathematics (in this case, the anatomy of integers and the theory of Markov processes) than had previously been made explicit in the literature (though there were hints and precursors scattered therein which one can see in retrospect). That would be a meaningful contribution to the anatomy of integers that goes well beyond the solution of this particular Erdos problem.”
You’re not doing calculus on a graph- you’re using a graph algorithm to automate the derivative taking process.
Essentially, you transform your function into a “circuit” or just a graph with edge labels according to the relationship between parts of the expression. The circuit has the nice property that there is an algorithm you can run on it, with very simple rules, which gets you the derivative of the function used to create that circuit.
So taking the derivative becomes:
1. Transform function F into circuit C.
2. Run compute_gradiant(c) to get the gradient of F.
Think about your blood vessels. They run, and branch, and then branch again, in an intricate pattern. Your DNA has to encode for this, but our DNA holds a finite amount of information.
So does it seem more likely that your DNA holds bit of information for every branch of every blood vessel? Or instead, does it just encode the information of “blood vessel branches half way into a new blood vessel, recursively”.
The fractal can be encoded with fewer bits, as the instructions to make the original vessel can be repeated at the split point.
It’s kind of like… you don’t store information of all humans in your lineage. Rather, you store information for one human, as well as information for how to make copies.
What if... the author wasn't aiming this post for a completely lay audience, but rather someone with a undergraduate/graduate level of mathematics/physics background who was interested in learning more about some phenomenon?
Was watching this lecture, and was startled to hear the Dan Boneh mention that P-256 might have a backdoor.
Gist: the seed for the curve has unknown origin. Possible attack: let's say there is an attack possible on 1/10^6 curves. Just loop through a million curves until you find one vulnerable, and publish it into the standard.
Note: I'm not affiliated with this project, but I saw it recently and think it's really cool. It seems they're trying to do for collaboration / office tools what signal did for messaging. Pretty awesome.
Ok so I am in a family group for Amazon prime, netflix, spotify, and hulu. So is the idea like I just have to create a skio account and then that manages all the group subscriptions? And presumably I can get better deals through skio than if I get all the subscriptions independently.
Seems dependent on getting good brands onboard. But overall, if costs are lower for me, and it is more convenient, I think this could work. Great idea if you can execute!
Four colors is sufficient for a planar graph, but insufficient for a general graph. A planar graph is any graph where the edges can be drawn in such a way that they only intersect at the endpoints (there is a more formal algebraic definition but that helps with the intuition).
Gist: the seed for the curve has unknown origin. Possible attack: let's say there is an attack possible on 1/10^6 curves. Just loop through a million curves until you find one vulnerable, and publish it into the standard.