SnowflakeOnIce

8 ms·

1.
by SnowflakeOnIce 2mo ago
I worked on a system a couple years ago with a BERT-based model (64M parameters) used for classification. The rest of the system could process data at gigabytes per second, and so here tokenization at a measly few megabytes per second reall
2.
by SnowflakeOnIce 2mo ago
It's not just cosmic radiation or improperly built computers that result in bit flips. Row hammer is a thing :)
3.
by SnowflakeOnIce 3mo ago
Logout functionality is not the only use case for token invalidation. Another significant one is to revoke a token that has been exposed, like inadvertently pushed to GitHub. In that case you want to invalidate the token to a avoid unauthor
4.
by SnowflakeOnIce 4mo ago
Your general point here is reasonable. But to provide some domain knowledge context: secrets are leaked _very_ often! In public data (source code on GitHub, etc.) you can expect a prevalence somewhere in the range of 0.5-2.5 live secrets pe
5.
TruffleHog now detects public-key JWTs and verifies them for liveness(trufflesecurity.com)
2 points by SnowflakeOnIce 9mo ago|0 comments
6.
by SnowflakeOnIce 1y ago
Suppose you have access to certain memory. If you repeatedly read from that memory, can't you still corrupt/alter the physically adjacent memory you don't have access to? Does it really need to be a write operation you re
7.
by SnowflakeOnIce 1y ago
Example: A workstation or consumer GPU used both for rendering the desktop and running some GPGPU thing (like a deep neural network)
8.
by SnowflakeOnIce 1y ago
How is it a write-only attack vector?
9.
by SnowflakeOnIce 1y ago
> Lexing, parsing and even type checking are interleaved in most C++ compilers due to the ambiguous nature of many construct in the language. > > It is very hard to profile only one of these in isolation. And even with compiler bui
10.
by SnowflakeOnIce 1y ago
A simple hello world in C++ can pull in dozens of megabytes of header files. Years back I worked at a C++ shop with a big codebase (hundreds of millions of LOC when you included vendored dependencies). Compile times there were sometimes dom
11.
by SnowflakeOnIce 1y ago
https://en.m.wikipedia.org/wiki/Simultaneous_localization_an...
12.
by SnowflakeOnIce 1y ago
> Well, the current generation of LLMs blow away that Turing Test Maybe a weak version of Turing's test? Passing the stronger one (from Turing's paper "Computing Machinery and Intelligence") involves an "average
13.
by SnowflakeOnIce 1y ago
A lot of AI-based PDF processing renders the PDF as images and then works directly with that, rather than extracting text from the PDF programmatically. In such systems, text that was hidden for human view would also be hidden for the machi
14.
by SnowflakeOnIce 2y ago
"String interning" is discussed in the Java Language Spec, going back to the 1990s, and wasn't novel there. It goes back at least to Lisp implementations from the 1970s. Probably even earlier than that.
15.
by SnowflakeOnIce 2y ago
Yes, this was my own experience! When looking at universities, when I saw a high sticker price, I ignored that university, even if in hindsight I had a good chance of being accepted. I wish I had had someone when I was young who encouraged
16.
Show HN: Nosey Parker Explorer, a TUI for interactive review of secret exposures(github.com)
3 points by SnowflakeOnIce 2y ago|0 comments
17.
by SnowflakeOnIce 2y ago
About a dozen OSes / configurations were supported, and the entire test suite would take a few days to run on each such configuration. This was native desktop+server software, not a hosted SaaS thing. Major releases were put out every
18.
by SnowflakeOnIce 2y ago
At a previous job, with a huge C++ codebase and ~100 developers over 20 years, many platforms supported, a build could take hours, and the test suite took so long to run that it would take several days or weeks of real time to get through i
19.
by SnowflakeOnIce 2y ago
When doing appsec review in C or C++, yes!
20.
by SnowflakeOnIce 2y ago
> you can get 100% GPU utilization by just reading/writing to memory while doing 0 computations Indeed! Utilization is a proxy for what you actually want (which is good use of available hardware). 100% GPU utilization doesn't a
21.
by SnowflakeOnIce 2y ago
The common crawl only pulls documents less than a small limit (1MiB last I checked). Without special handling in this project, bigger documents than that would be missing. So indeed, not representative of the whole Internet.
22.
by SnowflakeOnIce 2y ago
'git clone --mirror' seems to pull down lots of additional content also.
23.
by SnowflakeOnIce 2y ago
There seems to be no such thing as a "private fork" on GitHub in 2024 [1]: > A fork is a new repository that shares code and visibility settings with the upstream repository. All forks of public repositories are public. You can
24.
by SnowflakeOnIce 2y ago
If your ranges end up sparsely distributed, using roaring bitmaps can speed things up a lot. https://roaringbitmap.org/
25.
by SnowflakeOnIce 2y ago
The classical synthesis approaches seem to have much more emphasis on correctness and specification than modern LLM-based synthesis though — things like deriving provably correct lock-free data structures. The LLM-based synthesis work I&#x2
26.
by SnowflakeOnIce 2y ago
It predates LLVM. That's one reason, anyway.
27.
by SnowflakeOnIce 2y ago
Yes and no. Latency across a stage is one reason why orchestras have conductors. An orchestra split across a stage can have enough latency between one side and another to cause chaos sans conductor. It takes noticeable time for sound to cro
28.
by SnowflakeOnIce 2y ago
30ms seems high! Though I might believe that. On higher-end pianos (mostly grands), there is "double escapement" action, which allows much faster note repetition than without. I suspect the latency would be lower on such pianos. &
29.
by SnowflakeOnIce 2y ago
This already happens. I have seen recruiters trying to get domain experts in various fields to write articles for AI training.
30.
by SnowflakeOnIce 3y ago
So a tiebreaker then?

More ›