Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
vlmutolo
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
31.
▲
by
vlmutolo
2y ago
Has anyone had a good experience with bluesound? Sends like they offer a similar product but with less big-corporate headache. Haven’t tried them myself, though. https://www.bluesound.com/
32.
▲
by
vlmutolo
2y ago
> Generate a stream of random bytes, pre-generation is advised to avoid dominating the benchmark. Current PRNGs are pretty fast. The Xoroshiro RNG "shootout" benchmark [0] lists some self-reported speeds. They claim 8+ GB/
33.
▲
by
vlmutolo
2y ago
My undergraduate advisor (David Chuss) at Villanova and some of his students recently put together a really nice visualization of the magnetic fields at the center of our galaxy. Last I talked to him about it, he said that the results were
34.
▲
by
vlmutolo
2y ago
> The whole game state is stored in one atom: app/state and entities are again atoms inside the main atom (like in our universe). I don’t know clojure. Is this normal terminology, ie to use “atom” this way? Seems like a bad name for
35.
▲
by
vlmutolo
2y ago
This is quantum mechanics notation and basic principles. |x> is pronounced “ket x” (the second half of the intentionally-misspelled word braket), and refers to a quantum state x. The quantum states |0> and |1> refer to the classica
36.
▲
by
vlmutolo
2y ago
It’s important to be able to see where the async function might pause execution. For example, if you’re holding a mutex lock, you probably want to avoid holding it “across” an await point so that it’s not locked for longer than necessary if
37.
▲
by
vlmutolo
2y ago
Also see “poptrie” [0] for an efficient way to do routing table-style lookups for CIDRs (longest prefix match). They basically use the “popcnt trick” to implement sparse arrays, use “direct indexing” for the first however many bits to reduc
38.
▲
by
vlmutolo
2y ago
My public high school offered a combined physics-math course (basically two different teachers and courses that coordinated with each other), and it was definitely an excellent way to learn calculus. We learned derivatives for mechanics aro
39.
▲
by
vlmutolo
3y ago
The thing is that most code has a straightforward, tree-like ownership model. It’s overkill to use a GC for everything. It also sometimes leads to memory bloat. What we really need is an ergonomic way to opt into different kinds of memory a
40.
▲
by
vlmutolo
3y ago
This is cool – I just heard a talk related to this subject from one of the authors, Daniel Genkin, who leads the group [0] that found this vulnerability. Seems like they're doing a lot of really interesting work. The talk I heard was s
41.
▲
by
vlmutolo
3y ago
This may be more about the indexing strategy than the hash function. Meaning: once we have the hash(es), how do we decide what index to use for the key? Open-addressing schemes like linear probing, quadratic probing, certain variants of Rob
42.
▲
by
vlmutolo
3y ago
The most expensive Unifi in-wall AP is $170. Even if you had ten of them, that’s only $1700. If you’re building a house, that’s not that expensive for making basic infrastructure work well.
43.
▲
by
vlmutolo
3y ago
The real solution is to plan for having a low-power access point in every room. Maybe even hidden in the ceiling of every room. Everything gets faster and more reliable when you limit crosstalk. If anything, I’d want my future home to have
44.
▲
by
vlmutolo
3y ago
So maybe "18 thousand million billion"
45.
▲
by
vlmutolo
3y ago
Rust often has convenience methods in its standard library for things like this that are common and tend to produce bugs when re-implemented over and over, and have a reasonable way to do it without making tradeoffs that will annoy some peo
46.
▲
by
vlmutolo
3y ago
I’m starting a PhD in a related field, and it seems like the biggest reason to be excited is simulation of small and complex physics systems, e.g. molecular interactions. Breaking RSA/ECDSA is very cool, but doesn’t actually enable new
47.
▲
by
vlmutolo
3y ago
keybr.com is my new favorite.
48.
▲
by
vlmutolo
3y ago
(This isn't really for kids, but for anyone else who has a similar question.) Dropout.tv is by far the best value of any streaming service. If you can get into their kind of content (it's only Dropout originals), it's endless
49.
▲
Chilled Drink Calculator
(omnicalculator.com)
1 points
by
vlmutolo
3y ago
|
0 comments
50.
▲
by
vlmutolo
3y ago
I’ve used Litmaps[0] to discover new papers in a field. They have an interesting “discover” mode where you input papers you consider to be “relevant” and they try to suggest other papers you’d think are relevant. If you subscribe to their s
51.
▲
by
vlmutolo
3y ago
@cart, what’s your primary motivation for developing a game engine? Do you eventually want to transition into building games and spend less time on the engine? Or is the engine itself the end goal? Always enjoy the Bevy progress writeups. T
52.
▲
by
vlmutolo
3y ago
> Examples of popular cryptographic hash algorithms: SHA, BCrypt, MD5. It's worth noting that MD5 is no longer considered a cryptographically secure hash function.
53.
▲
by
vlmutolo
3y ago
The iPad now has handwriting recognition in arbitrary text fields. You can just pick up the Apple Pencil and start writing somewhere. It’ll fill in with text as you write.
54.
▲
by
vlmutolo
3y ago
I think tweets are restricted by number of extended grapheme clusters. And probably also by number of bytes.
55.
▲
by
vlmutolo
3y ago
It also seems like Clickhouse could offer runtime detection of AVX and dispatch to the optimized functions in that case.
56.
▲
by
vlmutolo
3y ago
Counterintuitively, “Cache-oblivious” algorithms typically refer to algorithms that are cache-friendly even for an unknown cache size, or for multiple levels of caches of varying (unknown) sizes. A good example is the memory hierarchy, from
57.
▲
by
vlmutolo
3y ago
Well this all looks incredibly cool, and certainly beyond my current understanding of graph and vector databases. You mentioned in the release that you wrote your own knowledge management tool. Is that published somewhere?
58.
▲
by
vlmutolo
4y ago
They provide some examples in the “Recipes” section of the navigation menu at the bottom of the page. Here’s their example of implementing role-based access control: https://www.biscuitsec.org/docs/guides/rbac/
59.
▲
by
vlmutolo
4y ago
Typical is an interesting new serialization format that supports sum types. It introduces a mechanism called “asymmetric” fields that’s pretty clever. https://github.com/stepchowfun/typical
60.
▲
by
vlmutolo
4y ago
The speed comes from a clever incremental compilation model.
More ›