gliptic

25 ms·

271.
by gliptic 10y ago
For that to be the case, in real hash functions, it would require you to be constrained to a certain number of possible preimages, not too many more than the number of possible hashes, so that it's likely that H^-1(H(x)) = x but there
272.
by gliptic 10y ago
If you can do a first-preimage attack, you can do a second-preimage attack. Just hash the document you have. Therefore a first-preimage attack is strictly more severe.
273.
by gliptic 10y ago
The main problems I find with hashers are: * No way to change password without storing things * No way to handle site-specific rules without storing things * No way to store auxiliary data (URLs, usernames, etc.) * No way to see which sites
274.
by gliptic 10y ago
What if I really do want the 'foo' crate to be inside the sub-module? If you want it in the crate root, you should put it in the crate root.
275.
by gliptic 10y ago
Maybe because ML algorithms of today aren't AGI. Also because humans have already trained on lots of data from birth. There's no reason machine intelligence would be much worse at this and still be called AGI. It's an active
276.
by gliptic 10y ago
I made a similar thing that is supposed to be vaguely require.js compatible in 541-588 bytes, depending on enabled features [1]. Not production ready :). [1] https://github.com/gliptic/hypjs/blob/master/s
277.
by gliptic 10y ago
It was implemented but then removed again. Fortunately, it can be implemented as a library in Rust ( https://github.com/oli-obk/rust-sa ).
278.
by gliptic 10y ago
Hah, no. Read his book. As I said, not so easily dismissed. Sure, historicity-deniers have been tainted by poor scholarship in the past, but this is nothing like that.
279.
by gliptic 10y ago
The whole field is mired in methods that don't work. A counterpoint is the book 'On the Historicity of Jesus' and 'Proving History' by Richard Carrier. It's not as easy to dismiss as many suppose.
280.
by gliptic 10y ago
I would use an analysed algorithm such as Argon2 and be done with it. If you're so worried about bcrypt, why do you use PBKDF2 which is no better?
281.
by gliptic 10y ago
What evidence do you have that your scheme is any more future proof than, say, Argon2? No, just using a bunch of different primitives is not going to guard against the kind of breaks found in bcrypt or scrypt, which aren't really break
282.
by gliptic 10y ago
If you think that's how AlphaGo works, you should maybe take a closer look.
283.
by gliptic 10y ago
True. Although, LuaJIT does pretty well on C-style code using its FFI library. But that's something it's designed for, so not really surprising.
284.
by gliptic 10y ago
LLVM is neither high-throughput nor low-latency. It does probably generate faster code, though.
285.
by gliptic 10y ago
"Static fire" = holding down the rocket and firing the engines for some time. It's a rehearsal of the whole launch procedure short of actually releasing the rocket.
286.
by gliptic 10y ago
That was because of the belief that he had used an illegal copy of the DLL, and that he had copied all implementation details (neither is true). A representative from RAD said they would withdraw the DMCA complaint now after that misunderst
287.
by gliptic 10y ago
It will not use (much) more memory than the size of the output in any case. 8MB is the window here, which just means the decompressor can discard data that falls outside this 8MB window as it is decompressing.
288.
by gliptic 10y ago
There are now actually open source decompressors[0] for Oodle formats, and yes, many use rANS. Especially LZNA's clever use of SSE2 to decode and update 16 symbol models is interesting. FSE (which is tANS) is a different beast, though,
289.
by gliptic 10y ago
Payloads are insured and the insurance cost in this case is reportedly more or less the same as on a new rocket. That makes it a no-brainer.
290.
by gliptic 10y ago
I think that is quite subjective. I prefer this version with one return. I don't want more returns than necessary, and I want them as far up in the nesting as possible so they are easy to see. Returns are, after all, control-flow alter
291.
by gliptic 10y ago
Since 0xCC is an interrupt, it's only useful for padding that isn't executed. If you want to align loops, you need NOPs. Single-instruction, multi-byte NOPs are certainly preferred by modern compilers.
292.
by gliptic 10y ago
It might compile, but it won't link.
293.
by gliptic 10y ago
Which was 4227 people ( http://www.ibtimes.co.uk/mars-one-admits-it-has-only-receive... ). I would hope that is because few believed Mars One was a viable venture. Musk's vision should be much more convincing.
294.
by gliptic 10y ago
Note that Stochastic Gradient Descent is not an alternative to backpropagation. They are typically used together.
295.
by gliptic 11y ago
It's not up to the SSD driver. The SSD driver will not see any effects of speculatively executed code and there's no way the CPU could speculatively send commands to the drive.
296.
by gliptic 11y ago
I don't know why you refer to V8. V8 isn't doing AOT compilation of general JavaScript.
297.
by gliptic 11y ago
Compiling JavaScript into WASM is most likely not going to result in better performance unless you make an extremely good static optimizing compiler, and probably not even then. It's very hard to do the kind of optimizations that JIT c
298.
by gliptic 11y ago
What you're missing is that the result of h(f(x), f(y)) is itself encrypted. They can't tell whether it's true or not.
299.
by gliptic 11y ago
For instance, more allocations necessary, extra pointer indirection, higher memory use, worse cache locality, needing the TN_ListItem* to perform list operations.
300.
by gliptic 11y ago
Making the components smaller doesn't mean you have to make the sensor area smaller, you can just put more of them in.

More ›