4,235 karma · joined September 10, 2015
Not sure why, progress used to be way faster years ago.
For example, this "four year plan" should be implemented in 6 months at most, not 4 years.
And the "long-term features" that "should be considered carefully, could not be addressed in the next few years" (lol, seriously?!?) should have serious work start right now and be released as part as the next edition in 2024 (since they need an edition break to be ergonomic). These are basic misdesigns of the type system that should have been fixed 10 years ago.
Whoever is managing and paying for the Rust developers needs to fix this.
It just hashes the variable name and uses twice the hash value as the address of the variable in memory
For functions instead it uses twice the hash to store and lookup the function address at compile time, dedicating the whole compiler data segment except it seems for ds:0 to that table.
Note that in segmented x86-16, the code (plus constants) and stack are in dedicated segments, and string functions used to write the generated code write to yet another segment selected by es.
This seems to be the best strategy for compiler code size, although obviously it's vulnerable to hash collisions and only supports global non-array variables.
2. Proper security takes time and effort, so there is less time to devote to actual business, which means they are less likely to be successful at a scale that makes them widely known
1 is a unit.
You can, for example, generate a stencil mask of complex pixels in the prepass and use hierarchical early stencil reject to run a per-sample pass for complex pixels and a per-pixel pass for non-complex pixels (with imperfect SIMD lane utilization).
You can also use a pass to process the complex pixels mask and collect a buffer of (x, y, sample) coordinates to allow a later single hybrid per-pixel/per-sample compute shader pass with perfect SIMD lane utilization.
The script at https://github.com/eukaryo/reversi-scripts/blob/main/reversi... plays perfectly (assuming the whole thing is correct) a bunch of data computed by other scripts in the repository using the 36-empty-squares solutions, for which a regular machine is presumably suitable.
It seems that what it does is essentially look up a <=300GB table with all positions with 37-64 empty squares reachable from the weak solution, and runs edax with "-solve" for positions with <=36 empty squares.
find . -xdev -print0|xargs -0 cat > /dev/null
(ideally replacing cat with something that continues after errors)Without that, one must run Android to get access to mobile apps, which is essential.
SiFive Update - October 26, 2023
After years of growth, SiFive has reassessed its strategies and operations to focus on the most promising opportunities, leading to a restructuring. We believe this change is essential for our continued growth and industry leadership.
We are financially stable and continue to secure revenues and royalties from leading semiconductor companies. We are focused on maintaining our technological edge with investments in advanced R&D.
We recently launched the SiFive Performance P870 and SiFive Intelligence X390 products. Our commitment to our four product families: Essential, Intelligence, Performance, and Automotive remains strong, targeting sectors such as AI, ADAS, Electric Vehicles, Wearables, and Mobile.
With the increasing industry emphasis on AI and the need for adaptability in product design, SiFive aims to offer products that cater to these evolving needs.
SiFive has restructured to increase our agility, strengthen partnerships, and maintain our leadership in the RISC-V domain.
Regards,
Patrick
That's the only hardware/software system that guarantees both total freedom, support for mainstream apps, good security and a quality device.
Not having zero and associating one as the result of the nullary operation works as well, but then the natural definition of addition will result in x + y - 1 rather than x + y and it seems likely extension to rational numbers would not give an intuitive result.
If you are making one or few requests per IP you don't need this attack, and also aren't likely to have any effect on a Google-sized entity.
And the throttling seems even simple: give each IP address an initial allowance of A requests, then increase the allowance every T time up to a maximum of B. Perhaps A=B=10, T=150ms.
And in fact USB-C is not really physically reversible, because the hardware detects which way it's plugged in and permutes the signals, as opposed to mirroring all the wires, so there is indeed a "right" way of inserting an USB-C plug, except it's impossible to tell which it is without a dedicated hardware tester.
Rather, it can ask for two comparisons and act according to the results (e.g. it learns that 1 < 2 and 2 < 3 and returns [1, 2, 3]).
This makes the output unspecified in general, but it will be consistent with the information received and the calls made even if the comparator doesn't form an ordering, which is what one would expect.
I think a sort implementation should return elements in an order consistent with a subset of the comparison calls it makes, and that subset should be such that it fully determines the order.
An even better guarantee is that the subset should be the whole set of comparison calls.
Of course that's an incredibly dumb design, but unfortunately they are made like that.
Looks like the Go code generator and optimizer is absolutely terrible, since any reasonable optimizer has standard optimizations that prevent this.
Apparently they wrote their own rather than using something established like LLVM, and this is the result.
You can also do things like having a Linux machine with a powerful GPU but no GUI installed.
Then Firefox would be guaranteed to be strictly better than Chrome, since the baseline is the same and they can put in all the features that Google doesn't want because they would reduce their ad income, such as great ad-blocking support.
This might result in losing Google's search engine deal, but they can probably make a similar deal with an LLM-based search engine and even if the money might be less they don't need that much if they are only maintaining a fork and not the whole engine.
Basically the issue is that the only control available is turning the wheel, but an unstable scooter actually needs two controls: one to balance the board and one to control the speed.
Having a single control means that they are tied and thus that, discounting air resistance, if the user continuously leans forward, then the board has to continuously accelerate up to arbitrary speeds since turning the wheel to balance also results in acceleration.
Furthermore, it seems that they don't even have a motor powerful enough to always be able to balance the user along with air resistance, so if the rider continuously leans forward eventually the motor is no longer powerful enough, the board loses balance and the rider probably falls down and dies.
Not sure how they could even think of selling a design like that or how they are surviving the lawsuits.
The simplest fix seems to be using four wheels instead of one, which also removes the need of active balancing and is a normal proper design. If "leaning to accelerate" is desired instead of a more normal handle with a throttle control, then it should be achievable by adding suspension springs and detecting their extension.
Not sure if it's possible to have a proper design with one wheel; a thing that comes to mind is having a sort of "landing gear" that can come down and make the board stable on demand. An alternative could perhaps be an internal reaction flywheel, but not sure if that works and is feasible.
And if you are OK with uncomfortable then a simple closed-cell foam mat, while possibly a bit more expensive, seems far more reliable, durable and cleanable than this.
At 50 km/h, it moves 10-20 times faster than a hiker, and at <1000$ it's more than 100x cheaper than a plane or helicopter.
But requiring line of sight is a strong limitation because it means that you need to fly over the tree canopy and might not see under it, and you need to fly really high if target is on the other side of a mountain or hill and again you might not see well.
And of course cell phone coverage is not guaranteed so you can't use the easiest solution of putting a cell modem on it.
Maybe something where there are two drones, and one flies high with line of sight to both the user and the low-flying drone so that it can act as a relay like a satellite would?
Or something that uses radio frequencies that bounce over the atmosphere, and if bandwidth is not enough uses an automated pilot plus the ability to send photos every few seconds so the user can tell it in which general direction it should fly?
Or something that uses Starlink/Iridium/etc. to relay data?