May 12 · 3 min read · I don't usually write about my web findings, but I felt this one needed to be documented as a reminder for my future self too. My initial mistake was tunnel-visioning on a direct bypass of the main sa
Join discussion
Jan 3 · 3 min read · Goal: Predict the hidden “lotto numbers” (qubit 0) based on visible “testing numbers” (qubit 1) and bypass server restrictions. I was messing with mirroring and advanced math but but lmao it was just Anti-correlation and Bitslmao Recon Phase I start...
Join discussion
Nov 15, 2025 · 2 min read · we gotta know the file first. file distance_matrix.npy distance_matrix.npy: NumPy array, version 1.0, header length 118 Step 1 — Identify Instead of blindly plotting heatmaps, I interrogated the matrix: import numpy as np D = np.load("distance_matr...
Join discussion
Nov 6, 2025 · 5 min read · All the push/pops, borrows, and folds mean jack until they do something on-chain. So here’s a concrete case: w’re designing a small token distributor, like a mini airdrop system. w’ve got a bunch of users and an amount to push to each.No fancy struct...
Join discussion
Nov 4, 2025 · 5 min read · Below is a fine refined blog for which i used AI to make it as more clean & efficient as possible. In Move, a vector is like your all-purpose data stash — dynamic, flexible, and as close to an array as the language allows.But unlike loose languages, ...
Join discussion
Jun 30, 2025 · 2 min read · Desc: Daddy told me about cool MD5 hash collision today. I wanna do something like that too! Source Code: #include <stdio.h> #include <string.h> unsigned long hashcode = 0x21DD09EC; unsigned long check_password(const char* p){ int* ip = (int*)p; ...
Join discussion
