Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
marcandrysco
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
3 ms
·
1.
▲
by
marcandrysco
5mo ago
Thank you for checking it out, and I am glad you are interested! You are right in that some bits are still needed to fully close the loop. The short of it: the idea is to write apps in Nako, compile it to WASM, and then publish it to run on
2.
▲
Show HN: Waputer – The WebAssembly Computer
(waputer.app)
7 points
by
marcandrysco
6mo ago
|
2 comments
3.
▲
by
marcandrysco
8y ago
We were able to update the paper on the ACM website: https://dl.acm.org/citation.cfm?id=2837654 , although looking at it now, they did not update the title. I'll see if they can fix that. There is very exciting news com
4.
▲
by
marcandrysco
11y ago
That really depends on what you are trying to get out of the algorithm. Using 64-bit integers, I don't think you can turn Grisu2 into an failure-free algorithm. However, you can definitely improve its reliability by handling special ca
5.
▲
by
marcandrysco
11y ago
Good catch! I mostly used __uint128_t out of haste. Ideally, I would like to remove dependencies on large integer types. For now, this remains future work.
6.
▲
by
marcandrysco
11y ago
This problem is even trickier than that. The core of the algorithm should be robust given different rounding modes, but the values in the lookup table may differ based on the rounding mode. While it may seem odd for the rounding mode to cha
7.
▲
by
marcandrysco
11y ago
It should be faster to replace the HP numbers entirely with 64-bit floats. Regardless, I think it would be a useful for two purposes: 1) it would serve as an implementation for chips with only 32-bit floats (maybe some kinds of embedded sys
8.
▲
by
marcandrysco
11y ago
Author here. We intend for the GitHub repo ( https://github.com/marcandrysco/Errol ) to be the primary source for Errol. We still want to add a few improvements to the existing implementation: selecting the middle-most s
9.
▲
by
marcandrysco
11y ago
Author here. The simplest way to describe those 42 values: the value we want to output (the shortest value) is very close to the midpoint between two floating-point values. Since the best answer so close to a midpoint, its difficult for the