oxxoxoxooo

5 ms·

1.
by oxxoxoxooo 5mo ago
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 feedback from FW [1], could you shed some light on the situation? A
2.
by oxxoxoxooo 6mo ago
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 for a long time as AVX10 does not add it, either).
3.
RISC-V Vector Primer(github.com)
69 points by oxxoxoxooo 8mo ago|22 comments
4.
by oxxoxoxooo 9mo ago
Do you happen to know how does one access/use those A100 cores?
5.
The RISC-V Instruction Tier List [video](youtube.com)
4 points by oxxoxoxooo 11mo ago|0 comments
6.
by oxxoxoxooo 1y ago
If you ever wondered, how Arduino came about: The Untold History of Arduino ( https://arduinohistory.github.io/ ).
7.
Crab Nebula (time-lapse movie 2008-2022)(app.astrobin.com)
3 points by oxxoxoxooo 1y ago|0 comments
8.
by oxxoxoxooo 2y ago
Thank you very much for the answers, very informative! And congratulations on the discovery!
9.
by oxxoxoxooo 2y ago
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 it implemented via floating-point numbers or integers? 2. No
10.
by oxxoxoxooo 2y ago
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 there some kind of algorithmic improvement? Is it described
11.
by oxxoxoxooo 2y ago
Please, what do you use for bigints? GMP?
12.
by oxxoxoxooo 3y ago
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 for Resource-Efficient AI Applications
13.
by oxxoxoxooo 3y ago
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/b7ed0a28eb92803c81d6...
14.
by oxxoxoxooo 3y ago
Thanks!
15.
by oxxoxoxooo 3y ago
> 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 examples what kind of bugs did you discover?
16.
by oxxoxoxooo 3y ago
And another one: The Genuine Sieve of Eratosthenes https://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf
17.
by oxxoxoxooo 4y ago
> 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` provides only the lower half. You could break one 64x64 multipli
18.
What If? 2(xkcd.com)
1 points by oxxoxoxooo 5y ago|0 comments
19.
“Risc V greatly underperforms”(gmplib.org)
310 points by oxxoxoxooo 5y ago|348 comments
20.
by oxxoxoxooo 5y ago
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 way than the method by Moller and Granlund? Do you plan
21.
by oxxoxoxooo 5y ago
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 wasted every day. Division code is often hairy; Long division&#
22.
by oxxoxoxooo 5y ago
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/posts/labor-of-division-epis...
23.
by oxxoxoxooo 6y ago
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").
24.
Gearing for Real Cyclists(acooke.org)
22 points by oxxoxoxooo 6y ago|11 comments
25.
An exponent one-fifth algorithm for deterministic integer factorisation(arxiv.org)
99 points by oxxoxoxooo 6y ago|20 comments
26.
by oxxoxoxooo 6y ago
Thank you for the reply! Could you be more specific? In the case of 1D FFT, the right half (possibly zero-padded) of the signal is completely mixed up with the left half after the first pass [of breath-first FFT]. If the right half was all
27.
by oxxoxoxooo 6y ago
What is "Native zero padding to model open systems"? And how come it is "up to 2x faster than simply padding input array with zeros"?
28.
by oxxoxoxooo 6y ago
If you are into integer sorting, this might be of interest as well: https://yourbasic.org/algorithms/fastest-sorting-algorithm/ https://sorting.cr.yp.to/
29.
by oxxoxoxooo 6y ago
Josh, Gerben! Have you tried a sorting network, instead of the bubble sort?