HNHacker News
TopNewBestAskShowJobs

plopilop

591 karma · joined June 2, 2016

submissionscomments
plopilop··on Researchers achieve ‘absurdly fast’ algorithm for network flow
Mhh, while what you are saying is not wrong (though I'm not convinced about the constant thing, given everything is asymptotic), it's a bit imprecise.

A more exact formulation would be m^(1+o(1)) is equal to m^(1 + eps(m)) for some eps where eps(m) -> 0 for m -> infty

plopilop··on I hate LaTeX, I love LaTeX
Word has had automatic reference numbering for a while now (see for instance [0]). Not denying that it's not very known (nor pleasant to use), and I'm not even talking about bibliography.

I made my partner switch to Latex thanks to the bibliography. Writing tables almost made her switch back to Word.

[0]: https://www.sfu.ca/~ljilja/cnl/info/UseCrossReference/index....

plopilop··on PhD students face cash crisis with wages that don’t cover living costs
Here in France: I had a ~1 900€ salary after taxes (incl. income tax, 2 000€ otherwise) but because I was working in a company fulltime (the contract stated I was to devote myself 100% to my research, the reality was different but that's another topic).

My partner, on the other hand, has a public contract (with teaching charge), she gets around 1 400€ after taxes. Living with this in Paris is not easy (1 studio of 15m² will cost around 650-700€)

plopilop··on Amazon is using algorithms with little human intervention to fire Flex workers
I mean, we can get a more real example easily. Amazon had an AI recruiting tool that was biased against women. The explanation is very simple, the training dataset of successful hires mostly consisted of males so the AI though nothing better than penalizing women.

The question is, how do you detect such a bias, and how do you prevent it in the first place? We have some ideas when it comes to humans, but for code it's much more challenging.

https://www.reuters.com/article/us-amazon-com-jobs-automatio...

The subject of AI and ethics is, in my opinion, something that is not considered enough by the actors of the field, including developers.

https://www.propublica.org/article/machine-bias-risk-assessm...

https://www.boredpanda.com/google-translate-sexist/

https://openai.com/blog/multimodal-neurons/#biasandovergener...

https://www.theverge.com/2018/1/12/16882408/google-racist-go...

plopilop··on Stripe Identity
Maybe Stripe is not that much popular in Poland compared to other countries? I would not be surprised that they put priority on the countries where they already have a significant user base.
plopilop··on Do countries get the list of every passenger that's transiting their airspace?
In practical terms, non secret chats messages are stored, more or less cleartext, on Telegram servers. In this sense, yes, it is much less secure than Whatsapp. Though I don't know if, in whatsapp, the metadata is also e2e encrypted
plopilop··on Trust in blockchain-based systems
I would not use a blockchain (nor anything else) for e-voting to be honest. While I could get somewhat confident with some of the e-voting protocols (and that's not a given), it means that citizens should trust a protocol (and an implementation, and a machine) that only people having a doctorate in the field can assess. On the other hand, paper voting is simple, secure enough, and easy to understand by everyone.

In my opinion, e-voting is a solution to a problem that never existed.

plopilop··on A Family of Better Random Number Generators
The website does not seem to have been updated but the prediction security of PCG has been fully broken recently (and does not rely on the "Challenging" part of the spectrum): https://hal.inria.fr/hal-02700791/

Hence any cryptographic use of PCG is definitely prohibited

plopilop··on What I learned from doing over 60 technical interviews in 30 days
Not American, what is the difference between CV and resume? I always assumed they were synonyms.
plopilop··on Very Basic Intro to Elliptic Curve Cryptography
I don't think this works mod N. Since N is not a prime, you have no guarantee that for k your base, c belongs to the multiplicative group generated by k.

Take for instance N = 15, you can't find a log base 12 of 7, for instance (12 -> 9 -> 3 -> 6 -> 12). So you'd first need to find a fitting base, not sure how hard this is.

It has been proven [0] that factoring is as hard as solving DLP, but RSA also relies on the modular e-th root hypothesis, which we don't know to be as hard or easier than factoring.

In the end, because of [0] is you solve DLP you solve factoring yes, but we usually don't talk about DLP for RSA, even if as I said I was nitpicking.

[0] https://www2.eecs.berkeley.edu/Pubs/TechRpts/1984/5973.html

plopilop··on Very Basic Intro to Elliptic Curve Cryptography
I don't think so. Computing the discrete log of g^x assumes g to be known. In RSA the ciphertext is c = m^e and by definition, m is unknown.

The reverse operation of RSA is the modular e-th root, not the discrete log.

plopilop··on Very Basic Intro to Elliptic Curve Cryptography
Nitpicking, but RSA does not rely on the DLP, rather on factorisation and modular roots. I guess you meant Elgamal or Diffie-Hellman?
plopilop··on Very Basic Intro to Elliptic Curve Cryptography
> Couldn't I simply "brute force" the hop count?

Well, yes and no.

Yes, the bruteforce attack is a valid one. No, because usually the private key is around 256 bits, so you need to compute 2^255 hops on average to find the key.

The current biggest supercomputer can compute 10^17 flops/sec, assume you can do as many hops/sec. It still requires you 10^52 years to find the key.

The same is true for RSA : given a number N, find the two prime numbers p, q such that N = p * q. Trivial for N=15, a computer can do 13201225834171 = 1564571 * 8437601 in a matter of a second. However, current RSA N numbers have ~627 digits and we don't expect them to be factored in a reasonable amount of time.

As the other commenter said, there are much more efficient algorithms than bruteforce, but for current RSA keys (2048 bits) and ECC keys (256 bits), they are not reasonably efficient.

> Does this mean that a higher hop count is equal to a better private key?

So yes, the size of the key is a very important indicator of the strength of the key (but long keys can still be super weak if you don't generate them correctly). However bigger keys also result in longer encryption/decryption times.

plopilop··on Very Basic Intro to Elliptic Curve Cryptography
Big mistake in the article: the discrete log is not a trapdoor function, as far as we know, and elliptic curve crypto does not rely on trapdoors.

A trapdoor function is when you have a function hard to invert (for any x, given y = f(x), find x), which inversion becomes very easy once you know some additional info. For instance in RSA, given c = m^e mod N, it is hard to find m. Unless you know d such that e*d = 1 mod phi(N), then you can easily find m by computing m = c^d mod N.

There is no known way of easily inverting exponentiation on finite groups.

To quote Wikipedia, "Functions related to the hardness of the discrete logarithm problem [...] are not known to be trapdoor functions, because there is no known "trapdoor" information about the group that enables the efficient computation of discrete logarithms. "

plopilop··on Applying to PhD Programs in Computer Science (2014) [pdf]
I'm curious, how does it work in the US?

In Europe, you first study 3 years to get a bachelor's degree, then 2 more years for a master's degree (or an engineer degree), then you apply for a PhD which is supposed to last 3 years.

In natural sciences they do last 3 years in general, in human sciences they are usually quite longer.

plopilop··on Breaking RSA Security with a Low Noise D-Wave 2000Q Quantum Annealer
The authors give the following factorization with their algorithm: 231037 = 499 * 363. Not only is the product not equal to 231037, but 363 is also clearly not a prime as it is divisible by 3.

There is no discussion whatsoever about this failure, except for "The low noise D-Wave 2000Q factored correctly all integers N up to L_N= 17"

plopilop··on Folding@home now has 400k users fighting coronavirus
Well science goes frutstratingly slowly, especially in these fields. According to wikipedia the project has helped in 118 papers.

The idea of the single scientist singlehandedly solving everything is mostly a myth. Most of the time, people rely on hundreds of previous papers before making their own contribution. Taken together, all the minimal steps make a significant leap.

Folding@home can very well be part of this effort.

plopilop··on The exponential function is a miracle
(it's the other way round, e^(ix) = cos(x) + i sin(x))
plopilop··on Europe is edging towards making post-car cities a reality
When I lived in Paris, I used (for various jobs) lines 2, 6 and 13 to commute, also RER B. The mere idea of getting a seat during rush hour was delusional.

I remember once, at Denfert-Rochereau, I had to let two RER go to the south without me, as there was litteraly no place for me to go inside. Could not even put a foot in.

plopilop··on There is no evil like reCAPTCHA
> I think this is just what Google does when it thinks you're a "bot": i.e. they don't know who you are.

Maybe this is to prevent adversarial learning? If the images reload immediately, then the bot can learn (via a neural network) whether its solution was good or not. If there's a delay, it's the same, but the learning is slowed down by the same factor.

No idea if this is true, it just popped out of my head.

plopilop··on Why the French love to say no
Definitely french, linguee translates it as "commonplace", or "cliché"
plopilop··on Math Basics for Computer Science and Machine Learning [pdf]
> Furthermore the math presented in this book are all taught in 1st year courses for most CS programs I’ve encountered.

From what I see this book is much more complete than a first year course, or even the whole curriculum of a classical CS education.

I'm quite familiar with math, but I never encountered wavelet theory, Gauss-Seidel method, Rayleigh-Ritz theorem, and many more. My knowledge about other subjects such as Hermitian spaces, quaternions, finite elements is quite superficial.

And I've only listed elements of Part I.

plopilop··on What is a coder's worst nightmare?
The most common reason I've heard for not releasing the code is "because it's ugly". And truth to be told, many researchers do code horribly.
plopilop··on What is a coder's worst nightmare?
Almost happened to me. My paper got accepted, and one reviewer suggested an improvement of how I did the benchmarks. Doing so I noted a bug in my code, but thank god the bug was hindering the performances of my solution, so in the end my results were even stronger.
plopilop··on Gödel's Theorem
The number of functions (or rather programs) is countable though, as we can think of them as Turing machine. A Turing machine is a set of the form (states, transitions). Given that a Turing machine has finite number states and transitions, there are countably many such machines.

So indeed, we reach a contradiction, but the hypothesis was :

> To make things even easier, we can just throw out programs that loop infinitely or don’t return a 1 or a 0

so the contradiction tells us that \bar f is not in this set. More specifically, \bar f may loop infinitely at some point, I guess it does loop when you feed \bar f to itself.

plopilop··on Can optical illusions fool AI too?
From my layman point of view, this can lead to two different conclusions:

* The DNN is actually getting close to the way human brain works, as it falls into the same mistakes as the human eye;

* There is some kind of universality in these illusions, that every (or most of) vision systems will fall for.

But honestly I think that the second conclusion is a rewriting of the first one (what is a vision system? What is this universal property?).

Again I'm absolutely not an expert of the field so please correct me if I'm wrong.

plopilop··on Do We Worship Complexity?
I overall agree but I'd like to add some nuance: one-liners are hella compact but no way near maintainable in many cases. For instance 100% of code golf competition results should never be allowed in production.

Also there may be a balance between "some hierarchy in the code so it can evolve" and adhoc code that just works for the current problem. Only having to write a new class for a new feature because everything else is handed smoothly is a bliss.

plopilop··on Ask HN: What can be done to prevent a climate catastrophe?
That's a nice cherry-picking over the sources you're doing here. From Scientific American, quoting USGS:

> According to the U.S. Geological Survey (USGS), the world’s volcanoes, both on land and undersea, generate about 200 million tons of carbon dioxide (CO2) annually, while our automotive and industrial activities cause some 24 billion tons of CO2 emissions every year worldwide

But I guess you're more knowledgeable on the subject than the US geological survey?

> On average, human activities put out in just three to five days, the equivalent amount of carbon dioxide that volcanoes produce globally each year

https://www.usgs.gov/news/human-activities-produce-more-carb...

plopilop··on Ask HN: What can be done to prevent a climate catastrophe?
It's also affecting nutrient absorption. I don't see any quantitative number about this in the paper but it's been mentioned several time as having an impact.
plopilop··on Ask HN: What can be done to prevent a climate catastrophe?
Safe maybe, but still restraining fusion is not something as easy as restraining fission. I'm still betting it won't happen in the next 150 years, even though I'd love to be proven wrong.
← PreviousPage 3 of 6Next →