ivmaykov

5 ms·

1.
by ivmaykov 1y ago
> If you can't stomach Rust for some reason, and I'm one of those people, there are plenty of choices out there without all the pitfalls of C++ or C. Unless you are doing embedded programming ...
2.
by ivmaykov 2y ago
I know of at least one instance in which an employee at a $BigTechCompany was put on a PIP, successfully completed the PIP , and was fired the following week anyway. Box-checking exercise indeed.
3.
by ivmaykov 3y ago
If your wheel is turned because you are in a curve, your “right turn” button will be on top or maybe even on the left of the wheel, depending on how sharp the curve is. This can be disorienting and cause you to look away from the road and a
4.
by ivmaykov 3y ago
Just confirmed that my brain is much worse at producing randomness than python's random module. The site predicted my own "random" key strokes with ~67% accuracy. It was able to predict the output of a trivial python program
5.
by ivmaykov 4y ago
I may be wrong, but I thought it’s that you can’t have any fields with non trivial destructors, because the union wouldn’t know which destructor to call. So POD types / raw pointers / arrays of the above / structs of the abov
6.
by ivmaykov 4y ago
You would probably use std::variant in C++ if you want tagged unions. So you could have a struct or class with one std::variant field and some methods which can match on the type of the variant. But it would be kind of clunky.
7.
by ivmaykov 4y ago
No, mine was in closed-source internal code.
8.
by ivmaykov 4y ago
I wrote an unsafe library at a FAANG and used similar naming conventions. The init function was named along the lines of “MyClassName_UNSAFE::initUnsafeIUnderstandTheRisks()” And the library itself was called something like “library-name-un
9.
by ivmaykov 8y ago
I can think of hash functions that are homomorphic, but are not secure. A simple example is something like “sha256 each element separately and XOR all the resulting hashes together.” This would not be collusion resistant. We offer a proof t
10.
by ivmaykov 8y ago
Disclaimer: I’m one of the authors of the paper/blog post/code. If you want to use signatures over the hash as proof of data set integrity, you need two things. 1) you need to make sure that hash({a}) + hash({b}) == hash({a, b}).