7 comments

  • mkornaukhov2 hours ago
    I've recently understood how RSA works and thought it was a cool achievement. But this article with "basic" math... Not so enjoyable for just a dev =)
  • atoav58 minutes ago
    A big part of what makes maths hard for non-math-people is math notation. That is like if a well versed python programmer told you it is as simple as:<p><pre><code> result = [[{&quot;x&quot;: x, &quot;y&quot;: y, &quot;v&quot;: (x+y if (x+y)%2==0 else None)} for (x, y) in row] for row in data] </code></pre> Now with a bit of reasoning another programmer that hasn&#x27;t used python might be able to figure out what that means. But what if my audience is non-programmers? The moment they encounter the first unexplained square brackets and then an opening curly brace it will essentially feel like telling them: &quot;Here is a riddle for you&quot; or potentially even like &quot;I expect you to know this, dummy&quot;.<p>Not that this text was particular bad in that regard, but I wish more math people had a heightened awareness of the fact that for many the hard part is not understanding the concept (e.g. fourier transformation), but the foreign looking signs mathematicians have decided to use to write them down.<p>That is as if someone explaines the way to the next train station to you in a foreign language. The hard part isn&#x27;t understanding the way, it is understanding the noises that are supposed to make up the description.<p>And as a programmer who from time to time has to translate maths into discrete programs (or the other way around) the hard part was always parsing the <i>notation</i> and when I figured it out I was usually like: &quot;Ohh, this is just a simple algorithm doing <i>that</i>.<p>So if you want to explain a math concept to programmers you should chose one of two routes:<p>(A) Stay with your notation and explain every character that isn&#x27;t visible on a regular keyboard in length and gently lead the reader into being able to read the notation or<p>(B) let go of the notation and first explain what it <i>does</i> and <i>how</i>, e.g. for our FFT example: <i>FFT slices your list of values into frequency buckets, figures out how much of each frequency is present, and returns those strengths as numbers.</i> And then you can work backwards from that understanding towards your notation explaining which sign relates to which part of the concept (e.g. to the number of buckets).<p>I would prefer the latter, since it explains both the concept and gives the mathematician a chance to explain how and why math notation can be useful on top, e.g. to figure out certain properties of the method that may even have practical implications.
    • mac-monet14 minutes ago
      Was nodding along as I was reading this. I recently was given a paper and spoke with the engineer implementing it. The paper was incredibly dense and hard to parse. But through talking with the engineer and rewriting some terms to more common names, the math turned out to be quite simple. Echoing your sentiment, I wish more mathematicians would use simple terminology. My personal theory as to why this isn&#x27;t done is the same reason why overengineering happens, that the writer is trying to cover every base but makes the hottest path a jumbled mess.
  • oleganza36 minutes ago
    ECDSA is a horrible workaround for patent on Schnorr signatures. Here&#x27;s my talk from 2019 about the issue.<p><a href="https:&#x2F;&#x2F;www.youtube.com&#x2F;live&#x2F;2IpZWSWUIVE?si=-LRRbU2mJgL9LiNP&amp;t=6456" rel="nofollow">https:&#x2F;&#x2F;www.youtube.com&#x2F;live&#x2F;2IpZWSWUIVE?si=-LRRbU2mJgL9LiNP...</a>
  • some_furry37 minutes ago
    In addition to the malleability attack (high-S and low-S both being valid for a given value of R), ECDSA doesn&#x27;t provide a property called exclusive ownership: <a href="https:&#x2F;&#x2F;soatok.blog&#x2F;2023&#x2F;04&#x2F;03&#x2F;asymmetric-cryptographic-commitments&#x2F;#ecdsa-signatures" rel="nofollow">https:&#x2F;&#x2F;soatok.blog&#x2F;2023&#x2F;04&#x2F;03&#x2F;asymmetric-cryptographic-comm...</a><p>In contrast, EdDSA (which is based on Schorr signatures) does, by construction: the public key is included in one of the hashes, which binds the signature to a particular public key.<p>I haven&#x27;t investigated whether cryptocurrency&#x27;s use of Schnorr satisfies this property or not. (Indeed, I do not care about cryptocurrency at all.) So it&#x27;s an exercise to the reader if it&#x27;s satisfactory or not :3
  • joezydeco5 hours ago
    Your definition of &quot;basic math&quot; greatly differs from mine...
    • j16sdiz3 hours ago
      &gt; abstract algebra is not a requirement.<p>and talks about fields and groups
      • mrkeen2 hours ago
        They&#x27;re just spooky names for simple concepts - and the article defines them on first use. If abstract algebra were a requirement, they&#x27;d skip these definitions.<p>Paraphrasing &#x27;Group&#x27; from the article to see if I&#x27;ve understood it:<p>A set of elements G, and some operation ⊕, where<p><pre><code> (g1 ⊕ g2) is also in G. &#x2F;&#x2F; &quot;Type-safety&quot; Some g0 exists such that (gn ⊕ g0) == (g0 ⊕ gn) == gn &#x2F;&#x2F; &quot;Zero&quot; For every g, there&#x27;s some inverse gi such that (g ⊕ gi) == (gi ⊕ g) == g0 &#x2F;&#x2F; &quot;Cancelling-out&quot; a ⊕ (b ⊕ c) == (a ⊕ b) ⊕ c &#x2F;&#x2F; &quot;Associative&quot; If (a ⊕ b) == (b ⊕ a) then the group is also &quot;abelian&#x2F;commutative&quot;</code></pre>
        • letmetweakit15 minutes ago
          They&#x27;re spooky names for simple concepts, with extremely deep consequences and hard theory, don&#x27;t be fooled.
  • NetMageSCW3 hours ago
    The article would be a lot better if it was what it said on the tin, instead of being filled with lots of unnecessary (as described in the article) digressions. If you couldn’t restrain yourself to sticking to the subject, at least put the digressions behind links or footnotes or pop-ups where they don’t detract from reading about the actual claimed intended subject.