Kirill's journal

Adolf Kunerth’s algorithm for computing modular square roots and solving general quadratic Diophantine equations transforms discrete modular arithmetic problems into Diophantine equations seeking integer points on parabolic curves; despite Wikipedia’s 2025 deletion citing non-notability and incomprehensibility based solely on Dickson’s summary, the algorithm merits preservation as the only known method avoiding direct factorization through coefficient based descent rather than group theoretic properties.

This article examines the effects of abliteration on Large Language Models (LLMs) and demonstrates that abliterated models treat users as capable adults, whereas original models tend to treat users as incapacitated individuals requiring protection by default.

This article examines two potential costs of the abliteration process for Large Language Models: performance penalties and output quality degradation. For comparison, I evaluated the rising stars of local LLM models in autumn 2025: Qwen3-VL variants, alongside cloud based solutions from Claude and Gemini.

This article provides a footnote for the actual state of using OpenBSD as a build machine with a high number of CPU cores.

The proposed EU Chat Control regulation exemplifies institutional tensions between supranational regulatory ambitions and member state constitutional frameworks; Denmark’s ministerial level advocacy for permanent mass message scanning confronts German constitutional barriers, the European Court of Human Rights precedent establishing encryption as a fundamental right, and the European Parliament’s prior rejection, creating conditions for a substantial institutional crisis should the regulation advance toward implementation.

This article provides a technical guide for configuring an Nginx based Least Recently Used (LRU) cache for Music Player Daemon (MPD) instances that utilize WebDAV for music storage. This architecture facilitates offline music playback, allowing access to cached tracks even when the WebDAV storage is inaccessible.

This article details the configuration process for setting up OpenBSD on an EdgeRouter 4 device to function as a home router, incorporating features such as private DNS resolution for clients and failover WAN connectivity.

This article provides a status update regarding the current support for OpenBSD on the HONOR MagicBook Art 14 Snapdragon.

This brief article provides a footnote on the configuration of an OpenBSD machine with two IPv4 addresses: 1.2.3.4/24 and 1.2.4.5/24. In this configuration, 1.2.3.4/24 is utilized as the machine’s address and a point for the tunnel, and 1.2.4.5/24 is forwarded to the remote machine within a dedicated routing domain. Furthermore, the machine in question has an IPv6 network aaaa:bbbb:cccc::/128. One address, aaaa:bbbb:cccc::eeee:ffff/64, is utilized inside the tunnel, while aaaa:bbbb:cccc::1/64 is used on the machine.

This article provides a straightforward method for utilizing GitHub actions to create a temporary SSH shell that can be used for testing on different platforms. The conclusion of this article includes a security concern regarding this technique.

This article provides a footnote on how to set up an OpenBSD based VPN client that can connect to a VPN server run by Unifi Network Solution on Unifi USG.

This article provides a guide for creating an AppleScript that registers as the default handler for the feed URI scheme on a local machine. The script forwards all URIs to a remote instance and registers it into rss2email. It also contains some useful notes about running rss2email on remote host.

This article provides a guide for installing OpenBSD on a headless server without using KVM nor VNC. It assumes that you are able to boot the server in rescue mode, which is built over Linux. In addition, this article presents the ready to use script which is available at http://install.catap.net.

VMware and Parallels support macOS 10.6 Snow Leopard virtualization, though both restrict this capability to Server editions; however, differences between Server and Desktop variants remain minimal, permitting straightforward installation from retail media through simple image modification.

Quantum computing research accelerated following Shor’s 1994 factorization algorithm invention, which promised polynomial time integer factorization capable of breaking RSA, and subsequently elliptic curve cryptography; however, three decades of development reveal fundamental engineering obstacles, qubit noise, decoherence timescales measured in nanoseconds, and threshold theorem redundancy requirements of $10^4$ to $10^6$ physical qubits per logical qubit, that render practical cryptographic attacks implausible with current or foreseeable future technology.

This article examines German mortality statistics for 2016 through 2020, challenging the conventional interpretation of COVID-19 impact presented by Statistisches Bundesamt. Through analysis of age stratified mortality rates adjusted for demographic shifts, the data reveal a substantially more nuanced picture than aggregate death counts suggest.

We present a system for running auditable and verifiable elections in untrusted environments. Votes are anonymous since the order of candidates on a ballot sheet is random. Tellers see only the position of the candidate. Voters can check their vote. An election is auditable using blockchain log. Threshold-encryption, which is used to implement the quorum, prevents a deadlock from occurring if a minority of candidates or observers tries to sabotage the election. Candidates and observers can indicate that the election was free and fair by exposing their keys, which are used by the system to decrypt each vote. Ballot sheets are encrypted by onion routing, which has a layer with the key of the election instance, so it’s impossible for a quorum to decode the results before they have announced their decision by exposing their keys. A register of voters ensures that only verified voters can vote without compromising their identity. If there any doubts about the identity of a voter, their vote can be excluded from the election, if a quorum agrees. This system is designed to scale from one instance to a distributed system that runs over an unlimited number of instances, which can be achieved using cloud instances or smartphones belonging to voters or tellers.

This article provides a guide for installing a local DNS resolver that enforces DNS-over-TLS to a randomly selected publicly available upstream server. The setup described respects DNS response consistency by enforcing DNSSEC if it is supported by the DNS zone, encrypts DNS traffic, and uses DNS servers from different providers. The second section of this article addresses the question of privacy.

This article presents an implementation of atomic operations optimized for low latency in multithreaded JVM environments. The implementation achieves approximately 2x lower latency under high concurrency through adaptive backoff mechanisms in compare and swap loops.

This article explains why it is not possible to make a 1 nanosecond sleep in JVM. Instead, you may achieve an unguaranteed small pause which depends on the number of active threads.

This concise article expounds on the implementation of a multi-producer, multi-consumer, wait-free, fixed-size FIFO queue.