Viewing profile — oxxoxoxooo
oxxoxoxooo
HN member- Joined
- Sat, May 30, 2020, 10:48 PM UTC
- HN karma
- 318
- Public activity
- 31 items
- HN profile
- View on Hacker News ↗
About oxxoxoxooo
No profile information was provided.
Recent public activity
-
comment
Comment #47859268
Hi! Congratulation on the launch, I hope the users will like these! Please, I do have a question about Desktop: there have been numerous reports of noisy PSU fan and little feedbac…
-
comment
Comment #47750169
On x86, there is no vector instruction to get the upper half of integer product (64-bits x 64-bits). ARM SVE2 and RISC-V RVV have one, x86 unfortunately does not (and probably wont…
- comment
- story
-
comment
Comment #46670845
Do you happen to know how does one access/use those A100 cores?
- story
-
comment
Comment #45502907
If you ever wondered, how Arduino came about: The Untold History of Arduino ( https://arduinohistory.github.io/ ).
- story
-
comment
Comment #41963172
Thank you very much for the answers, very informative! And congratulations on the discovery!
-
comment
Comment #41961295
Hi! Please, I also have a few questions: 1. I guess the most time consuming part is multiplication, right? What kind of FFT do you use? Schönhage-Strassen, multi-prime NTT, ..? Is …
-
comment
Comment #40323009
Thanks for the reply! If you don't mind asking more: what do you use for polynomial GCD? Apparently it is quite fast, do you use some standard algorithm implemented well or is ther…
-
comment
Comment #40310570
Please, what do you use for bigints? GMP?
-
comment
Comment #39542445
Prior art: Binarized Neural Networks: Training Deep Neural Networks with Weights and Activations Constrained to +1 or -1 https://arxiv.org/abs/1602.02830 Ternary Neural Networks fo…
-
comment
Comment #38899919
True. Except, it's trivial to mitigate this: one only needs to wrap the whole library under one giant #ifndef. Like here, for example: https://github.com/sheredom/utf8.h/blob/b7ed0…
-
comment
Comment #38166574
Thanks!
-
comment
Comment #38166259
> Implementations of big number math can and does contain bugs. (I used to hunt for those via fuzzing, which turned up an amazing number of them.) I'm curious, can you give some ex…
-
comment
Comment #37239424
And another one: The Genuine Sieve of Eratosthenes https://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf
-
comment
Comment #32988141
> This instruction is used in some bignum code Could you be more specific? I think for that to work one would also need the upper half of 64x64 multiplication and `vpmullq` provide…
- story
- story
-
comment
Comment #27136380
Hi fish, thanks for very interesting article, again! Do you think the very fast division on M1 has any implications for 128/64 narrowing division as well? Do you know of a faster w…
-
comment
Comment #27055681
I think that I shall never envision An op unlovely as division An op whose answer must be guessed And then, through multiply, assessed; An op for which we dearly pay, In cycles was…
-
comment
Comment #27055020
At the very bottom of the subsequent post [1], is it really possible for the second `qhat` (i.e. `q0`) to be off by 2? Any examples of that? [1] https://ridiculousfish.com/blog/pos…
-
comment
Comment #25597064
Not sure why this gets down voted, it is the correct definition of "telephoto" (i.e. "the physical length of the lens is shorter than the focal length").
- story