taintegral

6 ms·

1.
by taintegral 10mo ago
(I made rkyv) I took a look at lite3/tron because I was interested in seeing how it approached some of the issues I ran into with rkyv. I ended up with some additional information related to points 1 and 2 I figured I'd write down
2.
by taintegral 1y ago
> 'AI safety' is a meaningless term I disagree with this assertion. As you said, safety is an attribute of action. We have many of examples of artificial intelligence which can take action, usually because they are equipped wit
3.
How to sort your library in exactly 51,271 steps(david.kolo.ski)
94 points by taintegral 2y ago|27 comments
4.
by taintegral 3y ago
Mixing milliseconds down to picoseconds made the columns too wide. All of the benchmark data is also available as JSON in the benchmark_results directory if you wanted to drop it into sheets or some other analysis.
5.
by taintegral 3y ago
Author here, you’re correct. You can customize your validation context for your specific needs. For example, if you don’t have allocation available (i.e. `#![no_std]` without the alloc crate) then you’ll probably need to write your own mapp
6.
by taintegral 3y ago
> 6) Morality will degrade. Prostitution, drug use, nihilism, and degeneracy of every sort will explode. > 7) America’s military will weaken dramatically as the quality of recruits plunges and we no longer have the money to properly m
7.
Google open-sources Rust crate audits(opensource.googleblog.com)
256 points by taintegral 3y ago|48 comments
8.
by taintegral 4y ago
If you can't track provenance to un-restrict the pointers because it's infeasible, then you have to give up on at least one of the optimization passes. In this case, the optimizations used are very fundamental and giving up on any
9.
by taintegral 4y ago
This analysis is correct but the solution is not feasible. Changing a modification through `x` to a modification through `y` does indeed violate the semantics of `restrict`. The problem is that in order to detect this situation, we'd h
10.
by taintegral 4y ago
`restrict` pointers have nothing to do with the underlying "object" they point into (an array in this case). `restrict` lets the compiler assume that reads through a restricted pointer or any pointer expressions derived from it ar
11.
People are digging through their trash and reusing Target’s pill bottles (2016)(qz.com)
2 points by taintegral 5y ago|0 comments
12.
by taintegral 5y ago
Really not sure why the state space would only grow as n^k / k!. As well as what n and k are in this case. Adding more tiles or more actors would both dramatically increase the size of the state space for that input.
13.
by taintegral 5y ago
I would really enjoy a proof that it is not!
14.
by taintegral 5y ago
I gave the thought some idle time, but it's been so long since I've constructed a proper hardness proof. If I do, I'll definitely make a post about it!
15.
by taintegral 5y ago
This is a great idea, and the low-level optimization tips are all excellent ones I have used in the past. I want to talk a little bit more about using bidirectional A* though, because I think it's very interesting. It's a great st
16.
by taintegral 5y ago
This is fixed now.
17.
by taintegral 5y ago
In my experience, the only way to make meaningful progress on performance from here on out is to: - Squeeze out more entropy (for example, rotating states for symmetric boards) - Make the heuristic function smarter (for example, by calculat
18.
by taintegral 5y ago
That would definitely work, and I’d be interested in the performance impact. This was written so that the state size would scale with the number of actors rather than the size of the grid. There is a degenerate case where a massive mostly e
19.
by taintegral 5y ago
Bounding the maximum number of actors is just an optimization for the cases we want to solve. Of course if you wanted to really solve any case you would need infinite space, and that’s not achievable either. If you desired, you can also jus
20.
by taintegral 5y ago
Done! Thanks for the boost, I appreciate it very much. :)
21.
by taintegral 5y ago
Thank you! As long as some people got to see it, that's enough for me. :)
22.
Solving NP-hard puzzles with the oldest trick in the book(davidkoloski.me)
463 points by taintegral 5y ago|56 comments
23.
by taintegral 6y ago
I think that's a really good point, and I definitely agree that rkyv, Cap'n Proto, and FlatBuffers all have different goals and design decisions. rkyv was primarily made with the intention of handling bulk structured data for game
24.
by taintegral 6y ago
I actually agree with you; these are serialization issues that are very important to solve. I wrote a little about endianness and how it could be approached in the book FAQ [1]. rkyv's open type system enables a lot of really powerful
25.
by taintegral 6y ago
You can also turn on the `strict` feature for C compatibility, but without any way to get the type definitions into a C header it's kind of pointless. I'm not interested in adding C compatibility because I don't want to write
26.
by taintegral 6y ago
> Oh here we go, tucked away under "Tradeoffs" in the docs: This is a pretty unfair way to put it. It's on the main page of the docs, which every developer will see. If you're not familiar with the rust community, you
27.
Rkyv is faster than {bincode, capnp, cbor, flatbuffers, postcard, prost, }(davidkoloski.me)
28 points by taintegral 6y ago|11 comments