Tootfinder

Starting to think about GPU acceleration of protocol decodes (rather than just basic math blocks) in ngscopeclient.
Here's the filter graph I'm thinking of using as a benchmark: dual lane QSGMII, 20M points per channel.
The filter graph takes 944 ms end to end to run on my box (2x Xeon 6144 2080 Ti).
Major time consumers:
* Eye pattern (~345 ms)
* QSGMII (~337 ms)
* CDR PLL (~310 ms)
* 8B10B (~160 ms)
* SGMII (~120 ms)
Note that the …

„Twelve Jokers In A Deck“ by Loonies and The Twitch Elite.
The following records are claimed in this intro:
Widest 4x4 RGB rotozoomer on OCS: 64 columns
Biggest 4x4 RGB rotozoomer on OCS running 50fps
with scroller and music: 64 x 57 = 3648 blocks
Most well-presented rotozoomer on OCS
Note: Released 28th June 2025
at Posadas DemoParty
#Amiga

A Lebesgue variant of the additive square problem
Ingrid Vukusic
https://arxiv.org/abs/2506.21200 https://arxiv.org/pdf/2506.21200

A Lebesgue variant of the additive square problem
The additive square problem is a relatively famous open problem in the area of combinatorics on words: Does there exist an infinite word over a finite alphabet, such that no two consecutive blocks of the same length have the same sum? In this note we solve a Lebesgue integral variant of the problem. The proof is based on Lebesgue's density theorem.

The building blocks of asymptotically flat spacetimes
Shadi Ali Ahmad
https://arxiv.org/abs/2506.11190 https://arxiv.org/pdf/2506.111…

The building blocks of asymptotically flat spacetimes
The classification of all possible induced representations arising from theories admitting a Poincaré symmetry has molded our very conception of particles in flat space. In this note, we argue that if one takes the same viewpoint on the asymptotic symmetry group instead of the global one, the familiar relativistic classification is enhanced to provide a new notion of excitations in asymptotically flat spacetimes. These excitations blur the line between the quantum description of a particle and…