Arindam Das arindas

hi, i'm daniel. i'm a 15-year-old high school junior. in my free time, i hack billion dollar companies and build cool stuff.

3 months ago, I discovered a unique 0-click deanonymization attack that allows an attacker to grab the location of any target within a 250 mile radius. With a vulnerable app installed on a target's phone (or as a background application on their laptop), an attacker can send a malicious payload and deanonymize you within seconds--and you wouldn't even know.

I'm publishing this writeup and research as a warning, especially for journalists, activists, and hackers, about this type of undetectable attack. Hundreds of applications are vulnerable, including some of the most popular apps in the world: Signal, Discord, Twitter/X, and others. Here's how it works:

Cloudflare

By the numbers, Cloudflare is easily the most popular CDN on the market. It beats out competitors such as Sucuri, Amazon CloudFront, Akamai, and Fastly. In 2019, a major Cloudflare outage k

QEMU with VirtIO GPU Vulkan Support

With its latest reales qemu added the Venus patches so that virtio-gpu now support venus encapsulation for vulkan. This is one more piece to the puzzle towards full Vulkan support.

An outdated blog post on clollabora described in 2021 how to enable 3D acceleration of Vulkan applications in QEMU through the Venus experimental Vulkan driver for VirtIO-GPU with a local development environment. Following up on the outdated write up, this is how its done today.

Definitions

Let's start with the brief description of the projects mentioned in the post & extend them:

Performance Engineering, Hardware and cache awareness with algorithm and data structures

Parallel Computing Course - Stanford CS149, Fall 2023
Performance-Aware Programming Series by Casey Muratori
Algorithms for Modern Hardware
Computer Systems: A Programmer's Perspective, 3/E - by Randal E. Bryant and David R. O'Hallaron, Carnegie Mellon University
Performance Engineering Of Software Systems - am MITOCW course
Parallel Programming 2020 by NHR@FAU
Cpu Caches and Why You Care - by Scott Meyers

Company:

HOC: Towards an Optimal Computer: why interaction paradigm can improve computers.
HOC: Can we build an optimal processor?: like above, but as a tweet.
HOC: Complete Historical Overview: the lore behind HOC's creation.

Theory:

Interaction Combinators - Y.Lafont 1997: a concurrent model of computation
Symmetric Interaction Combinators - Damiano Mazza 2009: a symmetric variant (used by HVM)
The Optimal Implementation of Functional Programming Languages - best book to learn
[BOHM](https://www.cambridge.org/core/services/aop-cambridge-core/content/

Cache Oblivious and Cache Aware Data Structure and Algorithms

Cache-Oblivious Algorithms and Data Structures - Erik Demaine (One of the earliest papers in cache oblivious data structures and algorithms that introduces the cache oblivious model in detail and examines static and dynamic cache oblivious data structures built between 2000-2003)
Cache Oblivious B-Trees - Bender, Demaine, Farch-Colton (This paper presents two dynamic search trees attaining near-optimal performance on any hierarchical memory. One of the fundamental papers in the field where both search trees discussed match the optimal search bound of Θ(1+log (B+1)N) memory transfers)
Cache Oblivious Search Trees via Binary Trees of Small Height - Brodal, Fagerberg, Jacob (The data structure discussed in this paper works on the version of [2] but avoids the use o

	You are ChatGPT, a large language model based on the GPT-5 model and trained by OpenAI.
	Knowledge cutoff: 2024-06
	Current date: 2025-08-08

	Image input capabilities: Enabled
	Personality: v2
	Do not reproduce song lyrics or any other copyrighted material, even if asked.
	You're an insightful, encouraging assistant who combines meticulous clarity with genuine enthusiasm and gentle humor.
	Supportive thoroughness: Patiently explain complex topics clearly and comprehensively.
	Lighthearted interactions: Maintain friendly tone with subtle humor and warmth.

	/*
	* Physical Memory Manager (PMM) Frame Allocator by Z903
	*
	* This allocator manages physical memory frames in both 4KiB and 2MiB sizes using a two-layer
	* hierarchical bitmap structure. It's optimized for efficient allocation and deallocation
	* through two single-linked lists - one for 4KiB frames and one for 2MiB frames. The allocator
	* can manage up to 64 GiB of physical memory.
	*
	* Public Functions:
	* - void pmm_allocator_init(t_multiboot_info* mboot_info, t_u8 reserved_memory):

	# -----------------------------------------------------------------------------
	# AI-powered Git Commit Function
	# Copy paste this gist into your ~/.bashrc or ~/.zshrc to gain the `gcm` command. It:
	# 1) gets the current staged changed diff
	# 2) sends them to an LLM to write the git commit message
	# 3) allows you to easily accept, edit, regenerate, cancel
	# But - just read and edit the code however you like
	# the `llm` CLI util is awesome, can get it here: https://llm.datasette.io/en/stable/

	gcm() {

	const std = @import("std");

	// Can also try:
	// 8 x 64
	// 16 x 64
	// Top GFLOPs/s on an Intel® Core™ i7-13620H Processor = 300.9 GFLOPs/s
	// Comments were added using Claude.
	// To run simply run zig build-exe -O ReleaseFast matmul_FP32.zig, then run the binary ./matmul_FP32
	// To test simply run zig test -O ReleaseFast matmul_FP32.zig
	// To test performance on a generated binary, run : sudo perf stat -e cache-misses,cache-references,instructions,cycles ./matmul_FP32

	/* Numerically solve for the time-dependent Schrodinger equation in 2D,
	using the split operator method. To build and run, type:

	rustc qm2d_split_op.rs
	./qm2d_split_op

	This will output a series of bmp images which show each frame of the
	simulation.

	References: