dekimir
I hope you're right, but when I think about all those lawyers caught submitting unproofread LLM output to a judge... I'm not sure humankind is wise enough to avoid the slopification.
[1] https://twitter.com/feedliness/status/1638580147304505349?s=...
"I think every successful CEO, including myself, is tired of all the whining"
Impacted, yes. But "no service"? That's dubious.
I hear you on foreign SIM working. I got online at a cafe just long enough to buy a Yessim eSIM. When I activated it and turned on data roaming, I had LTE working on... the Rogers network! That I didn't expect.
It feels like there's a big, fundamental problem affecting a variety of Rogers infra, where BGP and cell problems are just symptoms we can observe. CloudFlare says it looks more like a failure than an attack; I'm not entirely convinced.
This is changing as we discover better ways of coding IO operations.
https://www.globenewswire.com/news-release/2019/11/05/194114...
https://itnext.io/modern-storage-is-plenty-fast-it-is-the-ap...
Makes much more sense now, thanks.
A bit difficult, yes, but far from uncommon. Witness Linux, Scylla, RedHat, GitLab, Firefox, WordPress...
Google Asks Workers Who Went Abroad for Covid to Return
Isn't this a core feature of distributed systems? How can you be "consistent" if there's a network failure between some writer and the stream? How can you tell a network failure from a network delay? How can you tell a network delay from any other delay?
And finally, how can you even talk about "up-to-date" data if the reader doesn't provide their "date" (ie, a logical timestamp)?
West-coast shuffle: tech power moving to Seattle
Off the top of my head:
- glslang supports all previous GLSL versions and profiles, which adds many checks and corner cases throughout the code
- it's tricky to generate correct SPIR-V; for instance, it took me a while to properly understand the constraints around basic-block ordering
Disclaimer: I left Google in 2016 and haven't looked at glslang/shaderc since. I am only offering personal opinions here.
Alternatively, are you available for consulting on the topic? I couldn't find any contact info in your profile. :(
"Since Zalewski has already done the work of figuring out, empirically, what heuristics are likely to exercise more code paths, it seems like a waste to ignore that and just generate totally random values."
Dan does, in fact, explicitly suggest "using fuzzing-like mutators", as you put it, in QuickCheck's random value generator. But those mutators work on continuous file contents, not on a bunch of disparate parameter values generated at distinct moments in the program. An early version of RamFuzz tried to apply AFL to the log file recording all generated random values, but all that yielded was invalid logs that couldn't be replayed. I don't know how else one would leverage Zalewski's heuristics in a random-value generator, though I'm obviously open to suggestions.