Ventie itsVentie

About Me

01. Identity

Headline	Security Systems Engineer // Computer Scientist
Age	18+
Gender / Pronouns	Non-binary (He/Him/She/Her)
Timezone	UTC+2

02. Personality Profiles

MBTI INFJ-T Advocate	Enneagram 4w5 The Individualist
Socionics EII Dostoevsky	Attitudinal Psyche ELVF Andersen

03. Interests & Gaming

Mind & Board Games

Chess	2400–2500 Elo
Shogi	5 Kyu

Competitive Esports

CS2	0
League of Legends	Diamond (Ranked Solo/Duo)

Gacha & Action RPGs

Genshin Impact	AR 60 [Endgame / 36★ Abyss]
Honkai: Star Rail	TL 59 [Full MoC / PF Clear]
Wuthering Waves	UL 68

Media & Hobbies

Anime	300+ watched
Manga & Novels	400+ manga/manhwa, 10+ Novels

04. Languages

Russian	Native
English	C1
German	A2
French	B1+
Spanish	A2

Life Goals

Life Milestone / Track	Key Objectives & Milestones
Academic & Institutional Education & Public Service	☐ Gain admission to a top-tier CS / Cybersecurity university program ☐ Join state cyber defense / Cyberpol digital investigation units ☐ Obtain foundational industry certifications (OSCP / CISSP)
Platform Rankings & Coding Competitive Platforms	☐ Reach Top 1% rank on TryHackMe ☐ Achieve Omniscient / Pro Hacker status on Hack The Box ☐ Reach Knight / Guardian rank (2000+ rating) on LeetCode ☐ Achieve Candidate Master / Master title on Codeforces
Academic & Research Excellence Publications & Science	☐ Publish a research paper in a top-tier peer-reviewed venue (IEEE / USENIX / ACM) ☐ Speak at a major security conference (DEF CON, Black Hat, CCC) ☐ Win a national or international Olympiad / Academic fellowship
Offensive Research & Security Vulnerability Discovery	☐ Discover and publish first official CVE identifier ☑ Receive first Bug Bounty payout on a major platform ☐ Reverse-engineer target binaries & write custom zero-day exploits ☑ Author and publish an original security research whitepaper
Systems Engineering & Math Technical Foundation	☐ Master Linux kernel mechanics & memory page tables ☐ Build custom high-performance eBPF tracing tools ☐ Develop a production-grade system application in Rust ☐ Implement Post-Quantum Cryptography & ZKP algorithms from scratch
AI / ML Engineering Models & Research	☐ Train an LLM / neural network from scratch in C++ / PyTorch ☐ Master Mechanistic Interpretability & circuit analysis ☐ Develop custom CUDA / Triton kernels for fast inference ☐ Build autonomous AI agents with execution guardrails
Web3 & Decentralized Systems Smart Contracts & Security	☐ Audit smart contracts & discover critical protocol vulnerabilities ☐ Implement custom EVM / Solana smart contracts ☐ Master ZK-Rollups, SNARKs & Layer-2 scaling architecture ☐ Build a decentralized dApp / protocol from scratch
Financial Autonomy Trading & Independence	☐ Earn first paycheck through engineering / security work ☐ Start active algorithmic / quantitative trading ☐ Build a profitable automated trading system / bot ☑ Achieve full personal financial independence
Competitive Gaming & Strategy Mindset & Mastery	☐ Reach Level 10 on FACEIT (CS2) ☐ Achieve 2500+ ELO rating in Chess (Chess.com / Lichess) ☐ Win or place in top teams at major competitive CTF events
Personal Mastery Life Balance & Hardware	☐ Build a high-performance custom workstation setup ☐ Build an open-source tool with 1,000+ GitHub stars ☐ Maintain peak physical health & disciplined daily routine

Research Roadmap

Tier 1: Core Systems, Math Foundations & Low-Level Mechanics

01. Discrete Math & Logic	☑ Propositional Logic & Truth Tables ☐ First-Order Predicate Calculus & Quantifiers ☐ Proof by Direct Induction & Strong Induction ☐ Structural Induction on Algebraic Data Types ☐ Proof by Contradiction & Contraposition ☑ Set Theory, Power Sets & Cartesian Products ☐ Equivalence Relations & Partial Orderings (Posets) ☑ Combinatorics: Permutations & Combinations ☐ Pigeonhole Principle & Inclusion-Exclusion ☐ Graph Theory: Trees, Cycles & Eulerian/Hamiltonian Paths ☐ Planar Graphs, Graph Coloring & Isomorphisms
02. Computer Architecture	☐ Two's Complement & Bitwise Operations ☐ IEEE 754 Floating-Point Mechanics (NaN, Subnormals) ☐ x86-64 Assembly Primitives & Instruction Encoding ☐ ARM64 Assembly Primitives & RISC Mechanics ☐ CPU Register Sets & Flags (EFLAGS / RFLAGS) ☐ Stack Frame Layouts & Frame Pointers (`RBP`/`RSP`) ☐ Calling Conventions (System V AMD64 ABI vs Microsoft x64) ☐ Memory Architecture: Segmentation vs Flat Paging
03. Systems Programming	☑ Manual Memory: `malloc`, `free`, `realloc`, `calloc` ☐ Pointer Arithmetic, Void Pointers & Type Casting ☐ Struct Alignment, Packing & Padding Rules ☐ C++ Systems Foundations: RAII & Smart Pointers ☐ C++ Custom Memory Allocators & Arena Allocation ☐ Rust Ownership, Borrow Checker & Move Semantics ☐ Rust Explicit Lifetimes & Lifetime Elision Rules ☐ Rust Interior Mutability (`RefCell`, `Cell`, `Mutex`) ☐ Unsafe Rust Boundaries, Raw Pointers & FFI
04. OS & Networking Primitives	☐ Process Management (`fork`, `execve`, `waitpid`, `exit`) ☐ POSIX Threads (`pthread_create`, `pthread_join`) ☐ Concurrency Hazards: Race Conditions & Data Races ☐ Deadlock Conditions, Avoidance & Livelocks ☐ Mutexes, Spinlocks & Read-Write Locks ☐ Counting Semaphores & Condition Variables ☐ POSIX System Calls & File Descriptor Tables ☑ OSI 7-Layer & TCP/IP Protocol Stacks ☐ Berkeley Sockets: TCP vs UDP Implementation ☐ Non-blocking I/O & Socket Multiplexing Primitives

Tier 2: Linux Kernel, Binary Security & Deep Linear Algebra

01. Applied Linear Algebra & Calculus	☐ Vector Spaces, Subspaces, Span & Basis ☐ Matrix Transformations, Determinants & Trace ☐ Vector & Matrix Norms ($L_1$, $L_2$, $L_\infty$, Frobenius) ☐ Eigenvalues, Eigenvectors & Characteristic Polynomials ☐ Spectral Theorem for Symmetric/Hermitian Matrices ☐ Singular Value Decomposition (SVD) Mechanics ☐ Low-Rank Approximations & Principal Component Analysis ☐ Partial Derivatives & Directional Gradients ☐ Jacobian Matrices & Multivariable Chain Rule ☐ Hessian Matrices & Second-Order Optimality Conditions
02. Linux Kernel Subsystems	☐ Virtual Memory Architecture & Multi-Level Page Tables ☐ Hardware Page Walk & Translation Lookaside Buffer (TLB) ☐ HugePages & Transparent HugePages (THP) ☐ Kernel Memory Allocators: Buddy Allocator Mechanics ☐ Kernel Slab Allocator: SLAB, SLUB & SLOB Internals ☐ Async I/O Subsystems: `epoll` Architecture & Triggers ☐ High-Performance `io_uring` Ring-Buffer Architecture ☐ eBPF Bytecode Instruction Set & In-Kernel Verifier ☐ eBPF JIT Compilation & Kernel Map Data Structures ☐ XDP (eXpress Data Path) Packet Processing at NIC
03. Binary Exploitation & Reverse Eng	☐ ELF Binary Format Headers, Sections & Segments ☐ Dynamic Linking, PLT (Procedure Linkage) & GOT Tables ☐ Dynamic Analysis using GDB, GEF & Pwndbg ☐ Static Analysis & Decompilation (Ghidra, IDA Pro) ☐ Stack Buffer Overflows & Return Address Overwriting ☐ Format String Vulnerabilities & Arbitrary Memory Write ☐ Heap Exploitation: Glibc Heap Allocator Architecture ☐ Heap Attacks: Tcache Poisoning, Fastbin Dup, Unsorted Bin ☐ Mitigations: ASLR, NX/DEP, Stack Canaries & PIE ☐ Mitigation Bypasses: ROP (Return-Oriented Programming) Chains ☐ Coverage-Guided Fuzzing: AFL++ & LibFuzzer Engineering
04. Probability & Statistics	☐ Kolmogorov Probability Axioms & Sample Spaces ☐ Discrete Distributions: Bernoulli, Binomial, Poisson ☐ Continuous Distributions: Uniform, Exponential, Gaussian ☐ Multivariate Distributions, Joint PMF/PDF & Marginalization ☐ Covariance, Correlation Coefficients & Independence ☐ Maximum Likelihood Estimation (MLE) Derivations ☐ Maximum A Posteriori (MAP) & Bayesian Inference ☐ Bayes' Theorem & Conditional Expectation ☐ Hypothesis Testing, $p$-values & Confidence Intervals

Tier 3: Distributed Systems, Web3 Consensus & Classic Cryptography

01. Mathematical Cryptography	☐ Modular Arithmetic, Congruences & Rings $\mathbb{Z}_n$ ☐ Great Common Divisor & Extended Euclidean Algorithm ☐ Chinese Remainder Theorem (CRT) Construction ☐ Primality Testing: Fermat & Miller-Rabin Algorithms ☐ RSA Cryptosystem Mechanics & Attack Vectors ☐ Discrete Logarithm Problem (DLP) & Diffie-Hellman ☐ Elliptic Curve Mathematics over Finite Fields $\mathbb{F}_p$ ☐ Elliptic Curve Digital Signature Algorithm (ECDSA) ☐ Edwards-curve Digital Signature Algorithm (Ed25519) ☐ Symmetric Primitives: AES-GCM Authenticated Encryption ☐ ChaCha20-Poly1305 Stream Cipher Architecture
02. Distributed Systems Theory	☐ FLP Impossibility Theorem & Asynchronous Bound ☐ CAP Theorem & PACELC Trade-off Model ☐ Logical Clocks: Lamport Timestamps & Total Order ☐ Vector Clocks & Causal Dependency Tracking ☐ Single-Decree Paxos & Multi-Paxos Consensus ☐ Raft Consensus: Leader Election, Log Replication, Safety ☐ State Machine Replication (SMR) Principles ☐ Consistent Hashing & Distributed Hash Tables (Kademlia)
03. Web3, BFT & Runtimes	☐ Practical Byzantine Fault Tolerance (PBFT) Protocol ☐ Tendermint Core & HotStuff BFT Architectures ☐ Asynchronous BFT & DAG Consensus (Narwhal & Tusk) ☐ EVM Architecture: Opcodes, Gas Metering, Memory, Stack ☐ WebAssembly (Wasm) Execution Runtime Mechanics ☐ Merkle Patricia Tries & State Root Verification ☐ Verkle Trees & Vector Commitments for Statelessness ☐ Optimistic Rollups: Fraud Proof Mechanics ☐ Zero-Knowledge Rollups: Validity Proof Integration

Tier 4: Deep Learning Foundations, Compilers & GPU High Performance

01. Deep Learning Architecture Theory	☐ Multilayer Perceptrons & Forward Pass Computation ☐ Automatic Differentiation: Reverse-Mode Autodiff Graphs ☐ Backpropagation Engine Derivation via Chain Rule ☐ Optimization: Stochastic Gradient Descent (SGD) & Momentum ☐ Adaptive Optimizers: Adam, AdamW, RMSProp Dynamics ☐ Scaled Dot-Product Attention Mechanics ☐ Multi-Head Attention & Transformer Architecture ☐ FlashAttention: Tiling & IO-Aware Attention Kernels ☐ Positional Encodings: Absolute, Relative & RoPE (Rotary)
02. Compiler Construction & MLIR	☐ Abstract Syntax Trees (AST) & Lexing/Parsing ☐ Control Flow Graphs (CFG) & Dominator Trees ☐ Static Single Assignment (SSA) Form Conversion ☐ Optimization Passes: Dead Code Elimination & Inlining ☐ Loop Optimizations: Loop Invariant Code Motion (LICM) ☐ Auto-Vectorization & SIMD Instruction Lowering ☐ MLIR Infrastructure: Dialects, Operations & Attributes ☐ MLIR Lowering Pipelines & Declarative Rewrite Rules ☐ LLVM IR Code Generation & ORC JIT Engine Architecture
03. GPU Compute & Custom Kernels	☐ SIMT Architecture: Streaming Multiprocessors & Warps ☐ CUDA Thread Hierarchy: Grid, Block, Thread Indexing ☐ GPU Memory Hierarchy: Global, Shared, Local, Registers ☐ Global Memory Coalescing & Unaligned Access Penalties ☐ Shared Memory Bank Conflict Identification & Avoidance ☐ Custom Kernel Development in CUDA C++ ☐ Kernel Engineering via OpenAI Triton Language ☐ Roofline Model Analysis: Operational Intensity Metrics ☐ Compute-Bound vs Memory-Bound Kernel Optimization

Tier 5: Post-Quantum Cryptography & Lattice Mathematics

01. Lattice Geometry & Hard Problems	☐ Full-Rank Lattices $\mathcal{L} \subset \mathbb{R}^n$ & Generator Matrix ☐ Lattice Basis Transformations & Unimodular Matrices ☐ Fundamental Parallelotope & Determinant $\det(\mathcal{L})$ ☐ Dual Lattices & Orthogonal Subspaces ☐ Shortest Vector Problem (SVP) Formulation ☐ Closest Vector Problem (CVP) Formulation ☐ Bounded Distance Decoding (BDD) Problem ☐ Successive Minima $\lambda_i(\mathcal{L})$ & Minkowski's First Theorem ☐ Minkowski's Second Theorem on Convex Bodies
02. Lattice Reduction Algorithms	☐ Gram-Schmidt Orthogonalization Process ☐ LLL (Lenstra–Lenstra–Lovász) Reduced Basis Conditions ☐ LLL Algorithm Steps & Polynomial Time Complexity ☐ Hermite Factor & Root-Hermite Factor Metrics ☐ BKZ (Block Korkine-Zolotarev) Reduction Mechanics ☐ Babai's Nearest Plane Algorithm for CVP ☐ Babai's Rounding Technique Mechanics
03. PQC Schemes & Security	☐ Learning With Errors (LWE) Average-Case Hardness ☐ Search-LWE to Decision-LWE Reductions ☐ Ring-LWE & Module-LWE Algebraic Formulations ☐ NIST PQC Standard: ML-KEM (Kyber) Construction ☐ NIST PQC Standard: ML-DSA (Dilithium) Construction ☐ NIST PQC Standard: SLH-DSA (Sphincs+) Hash-Based Signatures ☐ Number Theoretic Transform (NTT) Polynomial Multiplication ☐ Constant-Time Execution Primitives for PQC ☐ Side-Channel Attack Mitigation (SPA/DPA Countermeasures)

Tier 6: Research Frontiers (Zero-Knowledge, AI Safety & Formal Verification)

01. Zero-Knowledge Proofs (ZKP)	☐ Arithmetization: Rank-1 Constraint Systems (R1CS) ☐ Plonkish Arithmetization & Custom Gates ☐ Polynomial Commitment Schemes: KZG Commitments ☐ Polynomial Commitments: Inner Product Arguments (IPA) ☐ Polynomial Commitments: FRI Protocol (STARKs) ☐ SNARK Systems: Groth16 Setup & Verification ☐ SNARK Systems: Plonk Universal Setup Mechanics ☐ STARK Systems: Transparent & Post-Quantum Proofs ☐ Sumcheck Protocol & Interactive Proof Systems ☐ Recursive Proof Composition & Aggregation (Nova/Halo2)
02. AI Safety, Interpretability & Robustness	☐ First-Order Attacks: FGSM & PGD Adversarial Attacks ☐ Discrete Optimization Attacks: GCG Prompt Injections ☐ Certified Defenses via Randomized Smoothing ☐ Bound Propagation Verification ($\alpha/\beta$-CROWN) ☐ Mechanistic Interpretability: Circuit & Feature Analysis ☐ Representation Engineering & Activation Addition ☐ Alignment Objectives: RLHF with PPO & KL Penalty ☐ Direct Preference Optimization (DPO) Derivation ☐ Kahneman-Tversky Optimization (KTO) Objectives
03. Formal Methods & Verification	☐ Untyped $\lambda$-Calculus: $\beta$-reduction & Normal Forms ☐ Simply Typed $\lambda$-Calculus & System F ☐ Dependent Type Theory & Calculus of Constructions ☐ Martin-Löf Type Theory (MLTT) Axioms ☐ Curry-Howard Isomorphism (Propositions-as-Types) ☐ Operational Semantics: Small-Step vs Big-Step ☐ Axiomatic Semantics: Hoare Logic & Invariants ☐ Separation Logic for Pointer-Heavy Memory Reasoning ☐ Interactive Theorem Proving in Lean 4 / Coq ☐ SMT Solver Integration (Z3 / CVC5 Theory Solvers)