orlp

10 ms·

121.
by orlp 2y ago
Yes, I did already propose (at the office) a parity-agnostic chunker (we only need the number of lines + a splitpoint from the chunker) that can do parallel work and only needs a small moment of synchronization to find out which of the two
122.
by orlp 2y ago
It seems from a profile that on the eager engine the serial scanner is able to feed ~32 threads worth of decoding: https://share.firefox.dev/4hS1eJa . It might be worth speculating, or at least optimizing the serial chunker
123.
by orlp 2y ago
In this case "x" is 1/d where d is the unused fraction of space. So if you leave 0.1% of your hashtable unused your x is 1000 - quite problematic. However if you leave 12.5% of your hashtable unused your x is 8 - quite reason
124.
by orlp 2y ago
Skimming the paper [1], the key difference they used is that their hash table insertion algorithm will probe further than the first empty slot, instead of greedily filling the first empty slot it finds. They combine this with a clever probi
125.
by orlp 2y ago
We have a single-threaded chunker that scans serially over the file. This chunker exclusively finds unquoted newlines (using SIMD) to find clean parallelization boundaries, it doesn't do any further parsing. Those parallelization bound
126.
by orlp 2y ago
Disclaimer: I work for Polars inc. As a sanity check I just cloned https://github.com/h2oai/db-benchmark , ran the data generation script and ran on a 64 core AMD EPYC (AWS c7a.16xlarge): import polars as pl l
127.
by orlp 2y ago
We "evolved" dog breeds in microseconds in evolutionary terms. As long as the selective pressure is high change can come fast.
128.
by orlp 2y ago
All f64 bit patterns are valid.
129.
by orlp 2y ago
If using data violating some ToS taints the model trained on that data, then all of OpenAI's models are tainted by the millions of ToS'es they broke.
130.
by orlp 2y ago
I use the "VSCode Neovim" extension which lets me use a real Neovim instance inside VS Code, including my personalized vimrc and a lot of plugins. Not all plugins work but if they're just textual good chance they do.
131.
by orlp 2y ago
If you have access to the BMI2 instruction set I can do branchless UTF-8 encoding like in the article using only 9 instructions and 73 bytes of lookup tables: branchless_utf8: mov rax, rdi lzcnt ecx, esi
132.
by orlp 2y ago
Seems like LLVM knows about this quirk (note how it suddenly uses eax instead of rax for the multiply): https://rust.godbolt.org/z/8jh7YPhz4 .
133.
by orlp 2y ago
One dimension that is not explored is partitioning the queries in batches. The primary cost is doing lookups on the out-of-cache table, so if you have a sufficiently large amount of queries you can resolve a couple layers of the tree in o
134.
by orlp 2y ago
Seems a bit disrespectful to only list the big name professors in the title and shove the PhD student who seemingly actually wrote the pqconnect software (Jonathan D. Levin) into the ohters [sic] category.
135.
by orlp 2y ago
That's the next stage of deflection after passive voice. 1. In normal and honest language you state things you have done, and their consequences. 2. Passive voice attempts to deflect blame by only stating the consequences as if they ju
136.
by orlp 2y ago
I can really recommend samply: https://github.com/mstange/samply . It just works out of the box. It uses the Firefox profiler to view its recorded profiles. You can (don't have to, just can) even share them, I was
137.
by orlp 2y ago
Division by 195 is trivial. The answer is simply uint8_t div195(uint8_t x) { return x >= 195; }
138.
by orlp 2y ago
It's not entirely a coincidence but also not a general result that one should use the modular inverse as multiplier. 171 * 3 = 2^9 + 1, which is not surprising as we know that 171 * 3 = 1 (mod 2^8). So rearranged we have 171 / 2^9
139.
by orlp 2y ago
Yes, if you know something is an exact multiple of n = r*2^k where r is odd, you can divide out the multiple by right-shifting k followed by modular multiplication by the modular multiplicative inverse of r.
140.
by orlp 2y ago
What's not mentioned is that in most cases you have a constant divisor which lets you replace division by multiplication with the reciprocal. The reciprocal can be rounded to a nearby dyadic rational, letting you do the division with
141.
by orlp 2y ago
What do you base this on? The main repository ( https://github.com/excalidraw/excalidraw ) states it's MIT and this has been unchanged for 5 years. EDIT: I guess you were talking about tldraw rather than excalidraw.
142.
by orlp 2y ago
I'd suggest him to lead by example and fire himself.
143.
by orlp 2y ago
It turns out that only the identity gate and the left <-> right moving rules are reversible, plus their negated variants, see my other comment.
144.
by orlp 2y ago
A rule R is reversible if there exists a rule R^-1 such that for all a, b, c, d, e, f, g we see the following evolution (where . stands for "don't care"): a b c d e f g Apply rule R . b' c'
145.
by orlp 2y ago
Funnily enough syntax errors is the one thing that you can completely eliminate in LLMs simply by masking the output symbol probability vector to just those which are valid upcoming symbols.
146.
by orlp 2y ago
> You can't fit a reasonable hash into 10 cycles. Not 10 cycles, but my polymur-hash can hash any value <= 49 bytes in 21 cycles on an Apple ARM machine: https://github.com/orlp/polymur-hash/ . I think i
147.
by orlp 2y ago
> None of these hashes are cryptographic. I never said they were. > Crypto hashes don't have a problem of being slow.. they are designed to be slow. No they're not. Only password-based key derivation functions are designed t
148.
by orlp 2y ago
The point I'm trying to make is that everyone always cites the no hair theorem but completely leaves out the "stationary solution" part, leading to misconceptions. My thought experiment highlights that one can't treat
149.
by orlp 2y ago
If every line had an implicit await then it is indistinguishable from pre-emption, which I think is the point the person you're replying to is trying to make.
150.
by orlp 2y ago
Again, the no-hair theorem only talks about stationary solutions: > The no-hair theorem (which is a hypothesis) states that all *stationary* black hole solutions of... https://en.m.wikipedia.org/wiki/No-hair_theorem

More ›