Tootfinder

from my link log —
Disassembling vs decompressing terabytes of random data with Zig and Capstone: what are the failure rates?
https://jstrieb.github.io/posts/random-instructions/
saved 2025-11-06

Randomness in Narrative Video Games: Aesthetics of Different Random Systems
https://azhdarchid.com/randomness-in-narrative-video-games-aesthetics-of-different-random-systems/
Some of these considerations & differences als…

Randomness in Narrative Video Games: Aesthetics of Different Random Systems
On virtual dice, cards, and other alternatives.

Der #Bundestag hat die #Rentenreform beschlossen. Fünf Klarstellungen zur sozialen Absicherung älterer Menschen von @… , Sarah Yolanda…

📢 Bundestag stimmt für Rentenpaket der schwarz-roten Regierung
Der Bundestag hat dem Rentenpaket der Bundesregierung zugestimmt. 319 Abgeordnete stimmten dafür, 225 dagegen, 53 enthielten sich. Damit ist die sogenannte Kanzlermehrheit erreicht. Der namentlichen Abstimmung war ein wochenlanger Streit innerhalb der Union vorausgegangen.
➡️

Bundestag stimmt für Rentenpaket der schwarz-roten Regierung
Der Bundestag hat dem Rentenpaket der Bundesregierung zugestimmt. 319 Abgeordnete stimmten dafür, 225 dagegen, 53 enthielten sich. Damit ist die sogenannte Kanzlermehrheit erreicht. Der namentlichen Abstimmung war ein wochenlanger Streit innerhalb der Union vorausgegangen.

Gluing Random Unitaries with Inverses and Applications to Strong Pseudorandom Unitaries
Prabhanjan Ananth, John Bostanci, Aditya Gulati, Yao-Ting Lin
https://arxiv.org/abs/2510.04085

Gluing Random Unitaries with Inverses and Applications to Strong Pseudorandom Unitaries
Gluing theorem for random unitaries [Schuster, Haferkamp, Huang, QIP 2025] have found numerous applications, including designing low depth random unitaries [Schuster, Haferkamp, Huang, QIP 2025], random unitaries in ${\sf QAC0}$ [Foxman, Parham, Vasconcelos, Yuen'25] and generically shortening the key length of pseudorandom unitaries [Ananth, Bostanci, Gulati, Lin EUROCRYPT'25]. We present an alternate method of combining Haar random unitaries from the gluing lemma from [Schuster, Haferkamp, Hu…

MIXER: Mixed Hyperspherical Random Embedding Neural Network for Texture Recognition
Ricardo T. Fares, Lucas C. Ribas
https://arxiv.org/abs/2510.03228 https://

MIXER: Mixed Hyperspherical Random Embedding Neural Network for Texture Recognition
Randomized neural networks for representation learning have consistently achieved prominent results in texture recognition tasks, effectively combining the advantages of both traditional techniques and learning-based approaches. However, existing approaches have so far focused mainly on improving cross-information prediction, without introducing significant advancements to the overall randomized network architecture. In this paper, we propose Mixer, a novel randomized neural network for texture…

Zehn Jahre später: "Pillars of Eternity" bekommt rundenbasierten Kampfmodus
Im klassischen Rollenspiel "Pillars of Eternity" kann man bald auch rundenbasiert kämpfen: Zehn Jahre nach Release testet Obsidian einen neuen Spielmodus.

Understanding #Docker Internals: Building a Container Runtime in Python
https://muhammadraza.me/2024/building-container-runtime-python/

Out-of-bag prediction balls for random forests in metric spaces
Diego Serrano, Eduardo Garc\'ia-Portugu\'es
https://arxiv.org/abs/2510.04299 https://

Out-of-bag prediction balls for random forests in metric spaces
Statistical methods for metric spaces provide a general and versatile framework for analyzing complex data types. We introduce a novel approach for constructing confidence regions around new predictions from any bagged regression algorithm with metric-space-valued responses. This includes the recent extensions of random forests for metric responses: Fréchet random forests (Capitaine et al., 2024), random forest weighted local constant Fréchet regression (Qiu et al., 2024), and metric random f…

Improved Search-to-Decision Reduction for Random Local Functions
Kel Zin Tan, Prashant Nalini Vasudevan
https://arxiv.org/abs/2510.02944 https://arxiv.org/…

Improved Search-to-Decision Reduction for Random Local Functions
A random local function defined by a $d$-ary predicate $P$ is one where each output bit is computed by applying $P$ to $d$ randomly chosen bits of its input. These represent natural distributions of instances for constraint satisfaction problems. They were put forward by Goldreich as candidates for low-complexity one-way functions, and have subsequently been widely studied also as potential pseudo-random generators. We present a new search-to-decision reduction for random local functions defi…