As a very exciting follow-up to the recent article around the new NTFS driver being submitted for Linux 7.1 to address the shortcomings of the current Paragon NTFS3 driver and the prior read-only NTFS kernel driver, that work has been merged!..
Made public today was the Floating Point Divider State Sampling bug (stylized as FP-DSS or FPDSS) affecting original AMD Zen 1 (and Zen 1+) processors. The Linux kernel is already to go with a security fix for those still relying on the very first Ryzen or EPYC processors...
For those using upstream Wine for running your Windows games/apps on Linux rather than the likes of the Proton 11.0 beta, out today is Wine 11.7 as the newest bi-weekly development release...
Cal.com blames AI-powered vulnerability hunting for its move from open source to locked-down code β and tosses a crippled βcommunityβ edition to keep its cred. The post AI Pushes Cal.com to Shutter Open and Go Nonfree appeared first on FOSS Force.
Shor's algorithm is the main practical example of an algorithm that runs more quickly on a quantum computer than a classical computer β at least in theory. Shor's algorithm allows large numbers to be factored into their component prime factors quickly. In reality, existing quantum computers do not have nearly enough memory to factor interesting numbers using Shor's algorithm, despite decades of research. A new paper provides a major step in that direction, however. While still impractical on today's quantum computers, the recent discovery cuts the amount of memory needed to attack 256-bit elliptic-curve cryptography by a factor of 20. More interesting, however, is that the researchers chose to publish a zero-knowledge proof demonstrating that they know a quantum circuit that shows these improvements, rather than publishing the actual knowledge of how to do it.
One of the more significant changes in the 7.0 kernel release is to use the lazy-preemption mode by default in the CPU scheduler. The scheduler developers have wanted to reduce the number of preemption modes for years, and lazy preemption looks like a step toward that goal. But then there came this report from Salvatore Dipietro that lazy preemption caused a 50% performance regression on a PostgreSQL benchmark. Investigation showed that the situation is not actually so grave, but the episode highlights just how sensitive some workloads can be to configuration changes; there may be surprises in store for other users as well.