<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>The Forge — bythewei.dev</title>
    <link>https://bythewei.dev/skills</link>
    <description>Skills distilled from Wei's 4,939-book library — Claude capabilities forged from text.</description>
    <language>en-us</language>
    <atom:link href="https://bythewei.dev/skills/rss.xml" rel="self" type="application/rss+xml" />
    <item>
      <title><![CDATA[The Algorithm Design Manual — The Algorithm Design Manual, 2nd Edition]]></title>
      <link>https://bythewei.dev/skills/algorithm-design-manual</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/algorithm-design-manual</guid>
      <description><![CDATA[The practical algorithm designer's reference — technique + problem catalog. Skiena's 'war stories' show how problems arise in practice. The Hitchhiker's Guide catalogs 75 classic problems with implementations. Capabilities: Model real-world problems as known algorithmic problems (graph, DP, matching, etc.); Select correct data structure from requirements (hash table vs BST vs heap vs union-find); Choose sorting algorithm based on data characteristics and stability requirements; Apply BFS vs DFS based on problem (shortest path, cycle detection, topological sort); Select shortest path algorithm: BFS / Dijkstra / Bellman-Ford / Floyd-Warshall; Recognize and formulate dynamic programming subproblems with recurrence relations; Design backtracking search with pruning strategies for constraint satisfaction; Apply simulated annealing and greedy heuristics for NP-hard instances; Identify NP-complete problems and choose: exact / approximation / heuristic approach; Reduce novel problems to known NP-hard problems to prove hardness.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[The Art of Multiprocessor Programming — The Art of Multiprocessor Programming]]></title>
      <link>https://bythewei.dev/skills/art-of-multiprocessor-programming</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/art-of-multiprocessor-programming</guid>
      <description><![CDATA[The definitive textbook on concurrent programming theory — linearizability, mutual exclusion algorithms, lock-free data structures, hardware primitives, and transactional memory. Combines rigorous theory with practical Java implementations. Capabilities: Classify algorithm correctness using linearizability vs sequential consistency; Identify progress guarantees: wait-free, lock-free, obstruction-free, deadlock-free, starvation-free; Implement Peterson, Filter, and Bakery locks from first principles; Build lock-free stack (Treiber) with ABA-safe AtomicStampedReference; Understand Michael-Scott queue helping mechanism; Apply CAS/TAS/FAA hardware primitives correctly; Use consensus numbers to determine what CAS can implement (answer: anything); Design TATAS, CLH, MCS queue locks with appropriate cache behavior; Apply hazard pointers, RCU, and epoch-based reclamation for lock-free memory safety; Evaluate when STM is appropriate (low contention, short transactions, read-heavy).]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Black Hat Python, 2nd Edition — Black Hat Python, 2nd Edition: Python Programming for Hackers and Pentesters]]></title>
      <link>https://bythewei.dev/skills/black-hat-python</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/black-hat-python</guid>
      <description><![CDATA[Python 3 offensive security tooling from scratch — raw sockets to Scapy to Windows internals. Covers networking, packet sniffing, web hacking, Burp extensions, GitHub C2, Windows trojaning (keylogger/shellcode/sandbox detection), data exfiltration, privilege escalation, and Volatility memory forensics. Capabilities: Build TCP/UDP clients, servers, and proxies with Python sockets; SSH into targets and create SSH tunnels with Paramiko; Write raw packet sniffers and decode IP/ICMP headers with struct/ctypes; Perform ARP cache poisoning and email credential sniffing with Scapy; Brute-force directories, WordPress plugins, and form authentication with requests; Extend Burp Proxy with Jython plugins for custom fuzzing and recon; Implement GitHub-based C2 using Python's import mechanism; Build Windows keyloggers, screen capturers, and shellcode runners with ctypes; Exfiltrate data via email, SFTP, and HTTP with encrypted payloads; Monitor Windows processes for privilege escalation opportunities with WMI; Perform offensive memory forensics with Volatility3 plugins.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[The Boost Graph Library — The Boost Graph Library: User Guide and Reference Manual]]></title>
      <link>https://bythewei.dev/skills/boost-graph-library</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/boost-graph-library</guid>
      <description><![CDATA[Generic C++ graph library: adjacency_list/adjacency_matrix graph classes, BFS/DFS/topological sort/Dijkstra/Bellman-Ford/Kruskal algorithms, property maps, visitor customization hooks, and the concepts-and-models generic programming design pattern that makes all BGL types interoperable. Capabilities: Choose adjacency_list vs adjacency_matrix based on graph density and access patterns; Build directed/undirected graphs with vertex and edge properties using BGL adjacency_list; Run BFS, DFS, topological sort, Dijkstra, Bellman-Ford, and Kruskal with BGL algorithms; Customize BGL algorithms with visitor event-point callbacks (discover_vertex, tree_edge, finish_vertex); Use property maps to attach and read vertex/edge attributes in generic algorithms; Reason about concepts vs inheritance: when to use templates over virtual functions for zero-overhead abstraction.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Business Analysis (BABOK v3) — A Guide to the Business Analysis Body of Knowledge (BABOK Guide) v3]]></title>
      <link>https://bythewei.dev/skills/business-analysis</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/business-analysis</guid>
      <description><![CDATA[Complete BA knowledge framework from the IIBA BABOK v3. Six knowledge areas, 50 techniques, and five practice perspectives for applying business analysis in any context. Capabilities: Apply the BABOK v3 framework: six knowledge areas, 30 tasks, 50 techniques; Classify and manage requirements: business, stakeholder, solution, and transition types; Facilitate elicitation: interviews, workshops, prototyping, observation, surveys; Build stakeholder matrices: power/influence grids, RACI, onion diagrams; Model processes with BPMN, use cases, user stories, and state diagrams; Evaluate solutions against business objectives and define acceptance criteria; Apply all 5 BABOK perspectives: Agile, BI/Analytics, IT, Business Architecture, Process Management; Perform strategy analysis: current state, future state, risk, and change strategy.]]></description>
      <category>business</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Core Techniques and Algorithms in Game Programming — Core Techniques and Algorithms in Game Programming]]></title>
      <link>https://bythewei.dev/skills/core-game-programming</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/core-game-programming</guid>
      <description><![CDATA[Comprehensive game programming reference: fixed-timestep game loop, component-entity architecture, game AI (FSM/A*/steering/influence maps), 3D pipeline (BSP/LOD/terrain), skeletal animation with IK, camera systems (FPS/third-person/cinematic), particle systems, and multiplayer networking with interpolation. Capabilities: Implement fixed-timestep game loop with accumulator pattern; Build FSM-based enemy AI with seek/flee/arrive/pursuit steering behaviors; Implement A* pathfinding and influence maps for tactical AI; Apply BSP trees and LOD techniques for 3D rendering optimization; Set up skeletal animation with bone matrices and CCD inverse kinematics; Design third-person camera with spring arm and collision-based shortening; Architect client-server multiplayer with interpolation buffer and prediction.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[C++ Concurrency in Action — C++ Concurrency in Action: Practical Multithreading]]></title>
      <link>https://bythewei.dev/skills/cpp-concurrency-in-action</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/cpp-concurrency-in-action</guid>
      <description><![CDATA[Complete guide to C++11 multithreading — from basic thread management and mutex patterns through lock-free data structures and the memory model. Williams is the primary author of the Boost Thread Library and C++11 concurrency proposals. Capabilities: Manage std::thread lifecycle with RAII guards — join, detach, transfer ownership; Apply mutex hierarchy and std::lock() to prevent deadlock; Build thread-safe queues and stacks with condition variables and futures; Select correct memory_order for atomic operations (relaxed/acquire/release/seq_cst); Design lock-free data structures with hazard pointers and reference counting; Partition work using data parallelism, recursive decomposition, and task pipelines; Apply Amdahl's Law to predict concurrency speedup limits; Build thread pools with work stealing for reduced contention; Identify and eliminate false sharing, cache ping-pong, and oversubscription; Write exception-safe parallel algorithms and test for data races.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[C++ in a Nutshell — C++ in a Nutshell]]></title>
      <link>https://bythewei.dev/skills/cpp-in-a-nutshell</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/cpp-in-a-nutshell</guid>
      <description><![CDATA[Complete C++ reference: template mechanics (function/class templates, total/partial specialization, type deduction), type traits with tag dispatch, overload resolution rules, STL container selection guide, iterator categories and safety rules, erase-remove idiom, and custom container design with allocator support. Capabilities: Write function and class templates with type, value, and template template parameters; Specialize templates (total and partial) for specific types to customize behavior; Implement type traits using tag dispatch for compile-time type discrimination; Select the right STL container (vector/list/deque vs set/map) based on access patterns and complexity; Apply the erase-remove idiom correctly since STL algorithms cannot erase from containers; Use iterator categories (input/output/forward/bidirectional/random-access) to match algorithm requirements; Build custom containers and iterators by inheriting from std::iterator and implementing required member types.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[C++ Network Programming — C++ Network Programming, Volume 1: Mastering Complexity with ACE and Patterns]]></title>
      <link>https://bythewei.dev/skills/cpp-network-programming</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/cpp-network-programming</guid>
      <description><![CDATA[Concurrent OO network programming in C++: server architecture patterns (iterative, thread-per-request, thread-per-connection, thread-pool, reactive select-based), process vs thread tradeoffs, synchronization primitives (mutex, RW-lock, condvar, semaphore), socket IPC, non-blocking I/O, and the ACE toolkit wrapper facade philosophy. Capabilities: Choose server architecture (iterative/concurrent/reactive) based on service duration and load; Implement thread-per-request, thread-per-connection, and thread-pool server patterns; Build reactive select()-based event-loop server for high connection counts; Apply mutex, reader-writer lock, condition variable, and semaphore correctly; Write TCP client and server socket code with non-blocking I/O; Apply Half-Sync/Half-Async pattern to combine reactive receiving with synchronous processing.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[The C++ Programming Language — The C++ Programming Language, 4th Edition]]></title>
      <link>https://bythewei.dev/skills/cpp-programming-language</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/cpp-programming-language</guid>
      <description><![CDATA[Definitive C++11 reference by Stroustrup: type system, uniform initialization, RAII/ownership, class design (Rule of Five), operator overloading, virtual dispatch, templates, generic programming, variadic templates, metaprogramming, STL containers/algorithms/iterators, lambdas, concurrency (threads/futures/atomics), and C++20 ranges. Capabilities: Apply RAII pattern to manage resources safely with constructors and destructors; Design class hierarchies with virtual dispatch, override, and virtual destructors; Write function and class templates with type deduction and specialization; Select appropriate STL containers based on access/insert/search complexity; Compose STL algorithms with lambdas using erase-remove and transform patterns; Use std::async, std::future, std::atomic, and mutex for safe concurrent code; Apply template metaprogramming with type_traits and constexpr for compile-time logic.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Programming Principles and Practice Using C++ — Programming Principles and Practice Using C++]]></title>
      <link>https://bythewei.dev/skills/cpp-programming-principles</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/cpp-programming-principles</guid>
      <description><![CDATA[Stroustrup's C++ pedagogy textbook: class design from struct to class with invariants and pre/postconditions, deep copy semantics (copy constructor + assignment), vector internals (sz/elem/space capacity model, amortized push_back), RAII with exception safety guarantees (basic/strong/no-throw), grammar-to-recursive-descent-parser translation, and embedded systems C++ constraints (no new/delete/exceptions in hard real-time, pool allocators, bitfields). Capabilities: Design classes with explicit invariants and enforce them in constructors by throwing exceptions on invalid state; Write pre/postconditions as comments and runtime checks to catch usage errors at the boundary; Implement deep copy via copy constructor (const ref arg) and copy assignment (allocate new → copy → delete old → swap); Implement vector internal representation with sz/elem/space and amortized O(1) push_back via doubling; Apply RAII: tie resource lifetime to object lifetime so destructor frees resources even when exceptions are thrown; Reason about exception safety guarantees: basic (no leaks), strong (all-or-nothing), no-throw (built-ins); Turn a BNF grammar into a recursive descent parser where each rule is a function and putback() handles lookahead; Write hard real-time C++ without new/delete/exceptions using pool allocators and fixed-size stack arrays.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[The C++ Standard Library — The C++ Standard Library: A Tutorial and Reference, 2nd Edition]]></title>
      <link>https://bythewei.dev/skills/cpp-standard-library</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/cpp-standard-library</guid>
      <description><![CDATA[Complete C++11 Standard Library reference — containers with complexity analysis, 50+ algorithms, iterator categories, move semantics, lambdas, smart pointers, and strings. The definitive STL guide. Capabilities: Select correct container from requirements (vector/deque/list/set/unordered_map); Apply STL algorithms: sort, find_if, transform, remove/erase, accumulate, set_union; Use iterator categories and understand invalidation rules; Apply move semantics and perfect forwarding correctly; Write lambda expressions with correct capture modes; Choose between unique_ptr and shared_ptr ownership models; Use binary_search, lower_bound, upper_bound on sorted ranges; Apply numeric algorithms: accumulate, partial_sum, inner_product; Handle standard exception hierarchy and noexcept specification.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Cracking the Coding Interview — Cracking the Coding Interview, 6th Edition]]></title>
      <link>https://bythewei.dev/skills/cracking-the-coding-interview</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/cracking-the-coding-interview</guid>
      <description><![CDATA[Comprehensive technical interview prep: Big O analysis, data structures (hash tables, trees, graphs, heaps, tries), algorithm patterns (sorting, searching, DP, recursion, bit manipulation), system design, and behavioral storytelling — with company-specific interview guidance. Capabilities: Apply systematic problem-solving framework: listen → example → brute force → optimize → code → test; Analyze time and space complexity with Big O rules (add vs. multiply, amortized, memoization); Identify optimal data structure for interview problems (hash table, heap, trie, graph); Apply algorithm patterns: BFS/DFS, two pointers, sliding window, divide and conquer, DP; Prepare behavioral answers using STAR stories and the Interview Prep Grid; Recognize and apply dynamic programming patterns: top-down vs. bottom-up.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Cult of the Dead Cow — Cult of the Dead Cow: How the Original Hacking Supergroup Might Just Save the World]]></title>
      <link>https://bythewei.dev/skills/cult-of-the-dead-cow</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/cult-of-the-dead-cow</guid>
      <description><![CDATA[History of cDc (Cult of the Dead Cow), the pioneering hacking supergroup that coined hacktivism, built Back Orifice to force Windows security reckoning, testified to Congress under hacker handles, and whose alumni (Mudge/Dildog/Weld Pond) built the modern professional infosec industry. Capabilities: Apply coordinated disclosure framework: notify vendor → wait → publish if ignored; Distinguish hacktivism (human rights defense) from black-hat hacking and DDoS attacks; Explain Back Orifice architecture as case study in exposing platform-level security failures; Trace the L0pht → @stake → modern AppSec industry lineage; Frame security research with narrative strategy to drive policy change; Evaluate when full disclosure vs coordinated disclosure is ethically justified.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[DAX Mastery — The Definitive Guide to DAX, 2nd Edition]]></title>
      <link>https://bythewei.dev/skills/dax-definitive-guide</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/dax-definitive-guide</guid>
      <description><![CDATA[Expert DAX from Ferrari & Russo — the definitive reference. Master evaluation contexts, CALCULATE mechanics, iterators, time intelligence, and advanced data modeling patterns. Capabilities: Write expert-level DAX measures using CALCULATE, FILTER, and context manipulation; Distinguish row context from filter context and understand context transition; Build time intelligence patterns: YTD, MTD, same period prior year, rolling averages; Use iterators (SUMX, AVERAGEX, MAXX) correctly in row context; Design optimal star schema data models for Power BI and SSAS Tabular; Debug DAX using EVALUATE statements, ISFILTERED, ISCROSSFILTERED, and DAX Studio; Optimize DAX performance: avoid context transition overhead, use variables, prefer column operations; Master advanced patterns: many-to-many, parent-child, dynamic segmentation, ABC analysis.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Domain-Driven Design — Domain-Driven Design: Tackling Complexity in the Heart of Software]]></title>
      <link>https://bythewei.dev/skills/domain-driven-design</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/domain-driven-design</guid>
      <description><![CDATA[Tactical and strategic patterns for software where domain complexity is the central challenge. Evans' canonical text distilled into actionable design guidance. Capabilities: Apply Entity, Value Object, Aggregate, Repository, and Factory tactical patterns; Design Bounded Contexts and Context Maps for large-scale systems; Develop Ubiquitous Language collaboratively with domain experts; Choose integration patterns: Shared Kernel, Anticorruption Layer, Open Host Service, Conformist; Identify and protect the Core Domain from generic subdomains; Recognize anti-patterns: Anemic Domain Model, Smart UI, Overambitious Unification; Apply Supple Design patterns: Intention-Revealing Interfaces, Side-Effect-Free Functions; Structure large systems using Responsibility Layers and Knowledge Level.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Effective Modern C++ — Effective Modern C++]]></title>
      <link>https://bythewei.dev/skills/effective-modern-cpp</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/effective-modern-cpp</guid>
      <description><![CDATA[42 guidelines for effective C++11/14: type deduction (templates/auto/decltype), modern initialization, nullptr/constexpr/override/noexcept, smart pointers, rvalue references, move semantics, perfect forwarding, lambdas, and concurrency with futures and thread_local. Capabilities: Apply all 42 guidelines for C++11/14 correctness and performance; Explain type deduction rules for templates, auto, and decltype; Choose between unique_ptr, shared_ptr, and weak_ptr for ownership semantics; Apply move semantics and perfect forwarding correctly — avoid the common traps; Write efficient lambdas with correct capture modes and avoid dangling references; Use std::async and std::future vs. std::thread with correct thread management.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Effective STL — Effective STL: 50 Specific Ways to Improve Your Use of the Standard Template Library]]></title>
      <link>https://bythewei.dev/skills/effective-stl</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/effective-stl</guid>
      <description><![CDATA[50 specific guidelines for correct, efficient STL usage. Meyers covers the non-obvious pitfalls: container selection traps, iterator invalidation, erase-remove idiom, equality vs equivalence in associative containers, sort algorithm selection, and functor design rules. Capabilities: Identify the 10 most common STL container misuse patterns and fix them; Choose correctly between sorted vector and map/set for lookup vs insert workloads; Apply erase-remove idiom correctly for sequence and associative containers; Select the right search algorithm: find vs binary_search vs lower_bound vs equal_range; Design thread-safe STL usage with correct locking granularity; Avoid the most vexing parse and vector<bool> traps; Use reserve and swap-trick to control vector memory; Write adaptable functors and avoid stateful predicate bugs; Prefer member functions (map::find) over generic algorithms on associative containers.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Elementary Functions: Algorithms and Implementation — Elementary Functions: Algorithms and Implementation, 2nd Ed.]]></title>
      <link>https://bythewei.dev/skills/elementary-functions</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/elementary-functions</guid>
      <description><![CDATA[Rigorous treatment of transcendental function implementation: IEEE 754 fundamentals (ULPs, rounding modes, FMA, subnormals), polynomial approximation via Chebyshev/Remez minimax, Horner/Estrin evaluation, range reduction (Cody-Waite, Payne-Hanek for large arguments), CORDIC for sin/cos/atan, and correct-rounding via Ziv's multilevel strategy. Capabilities: Evaluate polynomials efficiently using Horner's method (sequential) or Estrin's method (pipelined); Design minimax polynomial approximations using Chebyshev polynomials and the Remez algorithm; Implement range reduction for exp/log/sin/cos using Cody-Waite or Payne-Hanek techniques; Reason about floating-point error in ULPs and design algorithms targeting ≤1 ulp accuracy; Apply CORDIC algorithm to compute sin/cos/atan via iterative shift-and-add rotations; Use FMA (fused multiply-add) to avoid intermediate rounding in double-double arithmetic.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[The Ethics of Hacking — The Ethics of Hacking: An Ethical Framework for Political Hackers]]></title>
      <link>https://bythewei.dev/skills/ethics-of-hacking</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/ethics-of-hacking</guid>
      <description><![CDATA[Academic ethical framework for political hacking using just-war theory analogues. Argues hacking is justified when protecting vital interests (physical integrity, autonomy, liberty, privacy) and the state fails its protective duty. Six criteria: just cause, right intention, legitimate authority, last resort, proportionality, discrimination. Capabilities: Apply the 6-criteria Bellaby framework to evaluate whether a political hack is ethically justified; Distinguish hacktivism (non-harmful activism) from political hacking (harmful force) from cyber-terrorism; Assess when state failure removes its legitimate authority and creates space for non-state protective action; Apply proportionality test: harm caused by hack must not exceed threat being defended against; Evaluate collective Anonymous-style operations using shared-awareness and operational-coherence tests; Select appropriate hacking method by matching harm level to ethical threshold required.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Foundations of Python Network Programming — Foundations of Python Network Programming]]></title>
      <link>https://bythewei.dev/skills/foundations-python-network</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/foundations-python-network</guid>
      <description><![CDATA[Python network programming fundamentals: TCP/UDP socket clients/servers, DNS resolution, HTTP/web client and HTML parsing, SMTP/POP/IMAP email, FTP, database clients (DB-API 2.0), SSL/TLS, and concurrency (forking/threading/select/asyncio). Capabilities: Build TCP/UDP clients and servers from raw sockets with proper framing; Implement select()-based multiplexed servers handling many connections without threads; Query DNS for A/MX/TXT/PTR records using dnspython; Send and receive email via SMTP, POP3, and IMAP with attachments; Use SSL/TLS context to wrap sockets for encrypted communication; Apply threading, forking, and asyncio concurrency patterns to network servers.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Evading EDR — Evading EDR: The Definitive Guide to Defeating Endpoint Detection Systems]]></title>
      <link>https://bythewei.dev/skills/evading-edr</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/evading-edr</guid>
      <description><![CDATA[Windows EDR internals from kernel callbacks to AMSI — how sensors work, what they see, and the architectural principles behind robust detection engineering. Required reading for both detection engineers and red teamers. Capabilities: Describe EDR architecture: agent, sensors, telemetry, and detection engine; Explain function-hooking DLLs: how ntdll patching provides API visibility; Explain kernel callback sensors: PsSetCreateProcessNotifyRoutine, ObRegisterCallbacks; Describe ETW providers relevant to security: Threat-Intelligence, Kernel-Process, Kernel-File; Explain AMSI integration points: PowerShell, .NET, VBA, JScript; Classify detections: brittle (hash/string) vs. robust (behavioral/TTP-level); Design correlated detection logic using event sequences, not single events; Identify sensor coverage gaps and layered sensor strategy; Apply detection hierarchy: goal > TTP > tool > hash/signature; Enumerate EDR sensor coverage for authorized red team assessments.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Gray Hat Hacking — Gray Hat Hacking: The Ethical Hacker's Handbook, 6th Edition]]></title>
      <link>https://bythewei.dev/skills/gray-hat-hacking</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/gray-hat-hacking</guid>
      <description><![CDATA[Comprehensive ethical hacking handbook covering exploit development (Linux/Windows/kernel), C2 deployment and EDR evasion, PowerShell living-off-the-land, Active Directory attacks (Kerberoasting, BloodHound, persistence), IoT/embedded hardware attacks, SDR, cloud hacking (AWS/Azure/containers/Kubernetes), and threat hunting with MITRE ATT&CK. Capabilities: Map engagement types: vuln scan vs pentest vs threat simulation vs red team; Build Linux exploits: buffer overflows, ROP chains, ASLR/NX/canary bypasses with Pwntools; Conduct Windows exploitation: SEH overflows, ROP chains, token stealing for kernel privesc; Deploy C2 frameworks: Covenant, Empire, Sliver — with payload obfuscation and EDR evasion; Perform AD post-exploitation: Kerberoasting, BloodHound path finding, AdminSDHolder persistence; Attack cloud environments: AWS metadata SSRF, IAM privilege escalation, container/Kubernetes escapes; Analyze IoT/embedded: UART/JTAG interface identification, SPI flash dump, firmware analysis with binwalk; Conduct threat hunting: hypothesis-driven hunts, MITRE ATT&CK mapping, Windows Event ID monitoring.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Gray Hat Python — Gray Hat Python: Python Programming for Hackers and Reverse Engineers]]></title>
      <link>https://bythewei.dev/skills/gray-hat-python</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/gray-hat-python</guid>
      <description><![CDATA[Python for Windows security tooling — debugger internals, all three breakpoint types, function hooking, DLL/code injection, fuzzing with Sulley, and IDAPython automation. Uses ctypes to interface directly with the Windows API. Capabilities: Use ctypes to call Windows API functions from Python for security tooling; Implement Windows debugger loop with WaitForDebugEvent and debug event handlers; Implement three breakpoint types: software (INT3), hardware (DR registers), memory (page guard); Hook functions using JMP patching with trampoline for original function call; Inject DLLs into remote processes via VirtualAllocEx + WriteProcessMemory + CreateRemoteThread; Build mutation fuzzers for network protocols with crash detection; Use Sulley framework for structured protocol fuzzing with blocks and primitives; Script IDA Pro with IDAPython for automated analysis, function naming, and xref traversal; Use PyEmu for safe x86 emulation and malware analysis without code execution.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[The Hacker Playbook 3 — The Hacker Playbook 3: Practical Guide to Penetration Testing (Red Team Edition)]]></title>
      <link>https://bythewei.dev/skills/hacker-playbook-3</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/hacker-playbook-3</guid>
      <description><![CDATA[Red team operations playbook — from recon through web exploitation, AD attack paths, lateral movement, and social engineering. Includes lab exercises and real-world attack chains against simulated environments. Capabilities: Conduct red team recon: subdomain enum, GitHub scanning, cloud asset discovery, cert transparency; Execute server-side web attacks: SSRF, XXE, SSTI, deserialization, NoSQLi; Use Responder + MultiRelay for LLMNR poisoning and NTLM relay attacks; Dump credentials from LSASS, SAM hive, and browsers after initial access; Run Bloodhound for AD attack path analysis to Domain Admin; Execute lateral movement: Pass-the-Hash, WMI, DCOM, Pass-the-Ticket; Perform Kerberoasting to crack service account TGS tickets offline; Build phishing infrastructure with doppelganger domains and 2FA bypass proxies; Apply post-exploitation checklist: persist → escalate → dump creds → map → C2 → objective.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Hacking & Security — Hacking & Security: The Comprehensive Guide to Penetration Testing and Cybersecurity]]></title>
      <link>https://bythewei.dev/skills/hacking-and-security</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/hacking-and-security</guid>
      <description><![CDATA[Comprehensive pentesting reference covering Kali Linux toolchain (nmap/hydra/Wireshark/Burp/Metasploit/Empire/Sliver), offline attacks (physical access, BitLocker/LUKS, password reset), web testing (Juice Shop, OWASP methodology), network attacks (ARP poisoning, Responder, pass-the-hash), and defensive hardening (10 steps, CVSS prioritization). Capabilities: Run systematic recon: nmap, dnsrecon, whois, sslyze; Execute credential attacks: Hydra (online), Hashcat/John (offline), wordlist generation with CeWL; Operate Metasploit: search/use/set/run exploits, Meterpreter post-exploitation commands; Use Empire and Sliver C2 frameworks for agent deployment and post-exploitation; Perform physical offline attacks: boot Kali, mount NTFS, extract/reset Windows credentials; Run ARP spoofing + Responder for NetNTLM capture, crack with Hashcat; Use Burp Suite: Proxy, Intruder, Scanner, Repeater for web app testing; Apply CVSS scoring to prioritize vulnerability patching.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Hacking APIs — Hacking APIs: Breaking Web Application Programming Interfaces]]></title>
      <link>https://bythewei.dev/skills/hacking-apis</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/hacking-apis</guid>
      <description><![CDATA[Complete API security testing methodology — from discovery through authentication attacks, BOLA/BFLA, mass assignment, injection, GraphQL-specific attacks, and rate limit bypass. Includes a comprehensive testing checklist. Capabilities: Discover APIs via Swagger, JS files, mobile apps, Wayback Machine, and Shodan; Attack JWT tokens: algorithm confusion (none/HS256), weak secret brute force, claim manipulation; Test for BOLA/IDOR by accessing other users' objects with different account credentials; Test for BFLA by accessing admin endpoints with regular user tokens; Exploit mass assignment by adding privileged fields to create/update requests; Fuzz API parameters for SQLi, NoSQLi, SSRF, command injection, and path traversal; Enumerate GraphQL schema via introspection and field suggestion attacks; Execute GraphQL batch queries to bypass rate limiting; Apply complete API pentest checklist: recon → auth → authorization → injection → logic.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Hacking: The Art of Exploitation — Hacking: The Art of Exploitation, 2nd Edition]]></title>
      <link>https://bythewei.dev/skills/hacking-art-of-exploitation</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/hacking-art-of-exploitation</guid>
      <description><![CDATA[Low-level exploitation from first principles — C programming, x86 memory layout, buffer overflows, format strings, shellcode writing, network hacking, and countermeasure bypasses. Erickson explains the 'why' behind techniques rather than just the 'how'. Capabilities: Analyze stack frame layout to identify buffer overflow offset to return address; Classify vulnerability type: stack overflow, heap overflow, BSS overflow, format string; Explain format string %n write primitive and arbitrary memory write technique; Describe shellcode requirements: position-independent, null-free, size-constrained; Explain return-to-libc as NX/DEP bypass without shellcode; Map OSI layers to relevant attack surface (hijacking, spoofing, ARP poisoning); Explain TCP/IP hijacking via sequence number prediction; Analyze WEP FMS attack — RC4 KSA weakness and IV-based key recovery; Describe ASLR bypass conditions: 32-bit brute force, heap spray, info leak chaining; Apply password probability matrices vs brute force vs rainbow table tradeoffs.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Hacking Kubernetes — Hacking Kubernetes: Threat-Driven Analysis and Defense]]></title>
      <link>https://bythewei.dev/skills/hacking-kubernetes</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/hacking-kubernetes</guid>
      <description><![CDATA[Threat-driven Kubernetes security guide: pod hardening (securityContext/capabilities/seccomp), RBAC audit and privilege escalation paths, network policies (default deny), supply chain (Trivy/cosign/SBOM), container runtime isolation (gVisor/Kata), secrets management (Vault/External Secrets), OPA/Gatekeeper policy, and Falco intrusion detection. Capabilities: Build Kubernetes threat models: identify attack surfaces, threat actors, attack trees; Harden pod security: securityContext, capabilities drop, read-only filesystem, seccomp; Identify and exploit dangerous RBAC misconfigurations — and fix them; Write network policies using default-deny approach; Secure supply chain: image scanning, signing with cosign, SBOM generation; Deploy and configure Falco for runtime intrusion detection; Apply Pod Security Admission labels (restricted/baseline/privileged) per namespace.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Handbook of Applied Cryptography — Handbook of Applied Cryptography]]></title>
      <link>https://bythewei.dev/skills/handbook-applied-cryptography</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/handbook-applied-cryptography</guid>
      <description><![CDATA[The rigorous academic reference for applied cryptography — block/stream ciphers, cipher modes (ECB/CBC/CTR/GCM), hash functions (birthday bound, collision resistance), RSA (OAEP/PSS), DH/ECDH, ECC, digital signatures (DSA/ECDSA/EdDSA), authentication protocols, key establishment, and cryptographic attack taxonomy. Capabilities: Select correct cipher mode: AES-GCM for AEAD, CBC+HMAC for legacy, never ECB; Explain RSA key generation, OAEP padding, and why textbook RSA is broken; Explain Diffie-Hellman and ECDH key agreement from first principles; Compare ECC curves: P-256 vs Curve25519 security and implementation trade-offs; Choose correct signature scheme: Ed25519 > ECDSA (RFC 6979) > DSA; Apply HMAC correctly and explain why MAC-then-encrypt is broken; Explain hash function security properties and birthday bound; Choose password hashing: Argon2id > scrypt > bcrypt, never MD5/SHA-1; Describe hybrid encryption pattern (ECDH + HKDF + AES-GCM); Classify attacks: ciphertext-only, known-plaintext, chosen-ciphertext, IND-CCA2.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[The Hardware Hacking Handbook — The Hardware Hacking Handbook: Breaking Embedded Security with Hardware Attacks]]></title>
      <link>https://bythewei.dev/skills/hardware-hacking-handbook</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/hardware-hacking-handbook</guid>
      <description><![CDATA[Comprehensive hardware security attack guide — finding debug interfaces (JTAG/UART), firmware extraction (SPI/JTAG), fault injection techniques (voltage/clock/EM/optical), power analysis attacks (SPA/DPA/CPA with Python), real-world examples (PS3, Trezor One, Philips Hue), and countermeasure design. Capabilities: Build hardware attack trees: enumerate assets, threats, paths, and scoring; Identify and exploit UART/SPI/I2C/JTAG/SWD debug interfaces on PCBs; Extract firmware via SPI flash dump (flashrom) and JTAG memory read (OpenOCD); Perform voltage and clock fault injection to bypass security checks; Understand and execute Simple Power Analysis (SPA) to recover RSA bits; Execute Differential Power Analysis (DPA) and Correlation Power Analysis (CPA) on AES; Apply countermeasures: voltage monitoring, redundant computation, masking, constant-time; Set up hardware lab: oscilloscope, ChipWhisperer, JTAG debugger.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Investment Analysis — Investments, 10th Edition]]></title>
      <link>https://bythewei.dev/skills/investment-analysis</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/investment-analysis</guid>
      <description><![CDATA[Comprehensive investment analysis framework from the canonical graduate-level textbook. Covers portfolio theory, asset pricing, equity and fixed income valuation, derivatives, and performance measurement. Capabilities: Apply Modern Portfolio Theory: calculate expected returns, variance, covariance, and optimal portfolios; Value equities using DDM, FCFF/FCFE, P/E, EV/EBITDA, and residual income models; Price fixed income securities: duration, convexity, yield spreads, term structure; Price derivatives using Black-Scholes and binomial option pricing models; Apply CAPM, APT, and Fama-French multi-factor models; Evaluate portfolio performance: Sharpe, Treynor, Jensen's alpha, M², information ratio; Distinguish efficient market hypothesis forms and their investment implications; Construct and rebalance portfolios using mean-variance optimization.]]></description>
      <category>business</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Linux Device Drivers — Linux Device Drivers, 3rd Edition]]></title>
      <link>https://bythewei.dev/skills/linux-device-drivers</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/linux-device-drivers</guid>
      <description><![CDATA[The definitive Linux driver development guide — char drivers (file_operations, ioctl, blocking I/O, poll), kernel synchronization (mutex/spinlock/completions), interrupt handling (top/bottom half), DMA (streaming/coherent), block drivers, network drivers (sk_buff), and the Linux device model (kobject/sysfs). Capabilities: Write a complete loadable kernel module with init/exit, parameters, and Makefile; Implement a character driver: registration, file_operations, read/write with copy_to_user; Use correct synchronization: mutex for sleeping, spinlock for IRQ context, completions for signaling; Implement ioctl commands with _IO/_IOR/_IOW macros; Implement blocking I/O with wait queues and wake_up; Implement poll/select support in a driver; Register and handle interrupts with request_irq, top/bottom half split; Perform DMA: streaming (dma_map_single) and coherent (dma_alloc_coherent); Write a network driver: net_device, ndo_start_xmit, sk_buff allocation, netif_rx; Register PCI/USB devices with bus-specific probe/remove model.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Understanding Linux Network Internals — Understanding Linux Network Internals]]></title>
      <link>https://bythewei.dev/skills/linux-network-internals</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/linux-network-internals</guid>
      <description><![CDATA[Deep dive into Linux kernel networking internals: sk_buff socket buffer lifecycle (allocation, pointer manipulation, stack traversal), net_device NIC driver registration, softirq receive/transmit path (NAPI), IPv4 forwarding and fragmentation, ARP/neighboring subsystem state machine, and routing table FIB lookup with route cache. Capabilities: Allocate and manipulate sk_buff socket buffers using skb_reserve/skb_put/skb_push/skb_pull for zero-copy packet construction; Register NIC drivers via alloc_etherdev/register_netdev and implement the net_device function pointer interface; Implement NAPI poll-based packet receive to reduce interrupt overhead on high-throughput NICs; Trace the IPv4 receive path from NIC ISR through ip_rcv → ip_route_input → ip_forward/ip_local_deliver; Understand ARP NUD state machine (INCOMPLETE/REACHABLE/STALE/DELAY/PROBE/FAILED) and neighbor resolution; Navigate the routing subsystem: FIB lookup, route cache (dst_entry), and procfs tuning knobs.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[The Definitive Guide to Linux Network Programming — The Definitive Guide to Linux Network Programming]]></title>
      <link>https://bythewei.dev/skills/linux-network-programming</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/linux-network-programming</guid>
      <description><![CDATA[Linux socket programming from first principles: Berkeley socket API lifecycle, three server architectures (iterative/select/fork), TCP vs UDP and stateful vs stateless protocol design, OpenSSL TLS integration (SSL_CTX/SSL layer setup), and secure C coding (buffer overflow prevention, unsafe function replacements, error-handling wrappers). Capabilities: Build TCP servers and clients using Berkeley socket API (socket/bind/listen/accept/connect/read/write); Implement select()-based multiplexing to handle N clients in a single process without threads; Build fork-per-client servers with proper SIGCHLD handling to avoid zombie processes; Integrate OpenSSL TLS into existing socket code using SSL_CTX/SSL/SSL_set_fd pattern; Design text-based application protocols (IRC-style command/reply format with stateful sessions); Prevent buffer overflows by replacing unsafe C functions (gets/strcpy/sprintf) with bounded alternatives; Debug network programs with tcpdump, netstat, nc, and telnet for manual protocol testing.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Mastering Bitcoin — Mastering Bitcoin: Unlocking Digital Cryptocurrencies]]></title>
      <link>https://bythewei.dev/skills/mastering-bitcoin</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/mastering-bitcoin</guid>
      <description><![CDATA[Bitcoin protocol internals from first principles — keys, addresses, UTXO model, Script language, P2P network, Merkle trees, mining, and consensus. Antonopoulos frames Bitcoin as a decentralized trust network, not just digital money. Capabilities: Trace the key generation chain: private key → public key (ECDSA) → address (Base58Check); Explain UTXO model vs account model and why Bitcoin has no 'balances'; Read and write Bitcoin Script for P2PKH, P2SH, and multisig transactions; Explain how HD wallets (BIP32) derive infinite keys from one seed; Describe Merkle tree structure and how SPV clients use proofs; Explain Proof of Work: hash target, difficulty adjustment, mining incentives; Describe 51% attack capabilities and limitations; Apply custody security hierarchy: hot wallet / hardware wallet / cold storage / multisig; Explain how Bloom filters enable privacy-preserving SPV; Analyze blockchain fork resolution and orphan block mechanics.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Mastering Kali Linux for Advanced Penetration Testing — Mastering Kali Linux for Advanced Penetration Testing, 4th Edition]]></title>
      <link>https://bythewei.dev/skills/mastering-kali-linux</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/mastering-kali-linux</guid>
      <description><![CDATA[Advanced Kali Linux pentesting guide: OSINT/stealth recon, wireless attacks (WPA2/WPS/Evil Twin), web exploitation (Burp/sqlmap/BeEF), cloud exploitation (AWS IAM/S3), AV evasion (Veil/fileless/UAC bypass), Metasploit, lateral movement (CrackMapExec/ProxyChains), privilege escalation, and Kerberos golden ticket attack. Capabilities: Execute stealth scanning: decoys, packet fragmentation, source port manipulation, proxychains; Perform OSINT recon: Maltego, SpiderFoot, theHarvester, Google dorks, CeWL wordlists; Conduct wireless attacks: WPA2 handshake capture/crack, WPS Pixie-Dust, Evil Twin with Wifiphisher; Exploit web apps: Burp Suite workflow, sqlmap with WAF bypass, commix, BeEF browser hook; Evade AV: Veil framework, fileless PowerShell download cradle, encoded commands, UAC bypass; Perform lateral movement: CrackMapExec, ProxyChains + SOCKS pivot, PsExec, WMIC; Execute Kerberos golden ticket attack after compromising krbtgt hash.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Mastering Malware Analysis — Mastering Malware Analysis, 2nd Edition]]></title>
      <link>https://bythewei.dev/skills/mastering-malware-analysis</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/mastering-malware-analysis</guid>
      <description><![CDATA[Complete malware analysis methodology — from triage through static/dynamic/reverse engineering analysis. Covers anti-analysis bypass, APT techniques, MITRE ATT&CK mapping, IoT malware, and report writing. Capabilities: Apply triage workflow: hash → VirusTotal → strings → imports → entropy; Analyze PE file format: headers, sections, imports, entropy for packed/encrypted indicators; Map suspicious API imports to malware capabilities (injection, persistence, crypto, keylogger); Conduct behavioral analysis: monitor process tree, files, registry, network in sandbox; Identify anti-analysis techniques: debugger checks, VM detection, packing/obfuscation; Reverse engineer XOR decryption loops and API hash resolution patterns; Map malware behaviors to MITRE ATT&CK tactics and techniques; Identify fileless malware indicators: LOLBins, PowerShell reflection, process hollowing; Write YARA detection rules from static and behavioral indicators; Structure analysis reports for threat intelligence vs. incident response audiences.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Mathematics for Computer Science — Mathematics for Computer Science]]></title>
      <link>https://bythewei.dev/skills/mathematics-for-computer-science</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/mathematics-for-computer-science</guid>
      <description><![CDATA[MIT's discrete mathematics course textbook — proof techniques (induction, contradiction), number theory (modular arithmetic, Fermat/Euler), graph theory (trees, coloring, planar, Hall's theorem), recurrences (Master Theorem, linear recurrences), counting (combinations, inclusion-exclusion, pigeonhole), probability (Bayes, independence, birthday paradox), random variables (binomial, geometric), expected value (linearity), and tail bounds (Markov, Chernoff). Capabilities: Apply induction (simple and strong) to prove algorithm correctness; Use Fermat's Little Theorem and Euler's Theorem to compute modular inverses; Analyze graphs: connectivity, trees, bipartiteness, planarity, Hall's theorem; Solve divide-and-conquer recurrences with Master Theorem; Count arrangements using sum/product rules, combinations, inclusion-exclusion, pigeonhole; Apply Bayes' theorem correctly to conditional probability problems; Use linearity of expectation (works even for dependent variables); Apply tail bounds: Markov (crude), Chebyshev (uses variance), Chernoff (exponential, best); Explain birthday paradox and its implications for hash collisions and cryptography.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Pearls of Functional Algorithm Design — Pearls of Functional Algorithm Design]]></title>
      <link>https://bythewei.dev/skills/pearls-functional-algorithm-design</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/pearls-functional-algorithm-design</guid>
      <description><![CDATA[30 algorithm 'pearls' derived from specifications using equational reasoning in Haskell. Bird demonstrates that efficiency emerges from algebraic manipulation of a correct-but-naive specification — no separate proofs needed. Capabilities: Derive efficient algorithms from clear specifications using equational reasoning; Apply fold/map fusion laws to eliminate intermediate data structures; Apply scan lemma to convert O(n²) fold-of-map to O(n) scan; Derive greedy algorithm validity conditions algebraically; Understand KMP and Boyer-Moore as derived (not invented) algorithms; Design loopless algorithms with O(1) next-step updates via state invariants; Apply Burrows-Wheeler Transform for data compression preprocessing; Derive O(n log n) suffix arrays from O(n² log n) naive sort via doubling.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Red Team Field Manual (RTFM) — Red Team Field Manual (RTFM)]]></title>
      <link>https://bythewei.dev/skills/red-team-field-manual</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/red-team-field-manual</guid>
      <description><![CDATA[Compact operator field reference — Linux/Windows command syntax for post-exploitation, networking (tunneling, proxies, pivots), file operations, web attacks, databases, scripting one-liners, and wireless — organized for fast lookup during active engagements. Capabilities: Execute Linux/Windows post-exploitation commands from memory with exact syntax; Pivot through networks: SSH tunneling, SOCKS proxies, port forwarding; Perform file operations with timestamp manipulation and secure deletion; Enumerate users, processes, network connections, and services on compromise hosts; Use trusted OS tools (LOLBins) to minimize attacker footprint; Operate covert channels over DNS, ICMP, and HTTP/S.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Social Engineering: The Science of Human Hacking — Social Engineering: The Science of Human Hacking]]></title>
      <link>https://bythewei.dev/skills/social-engineering-science</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/social-engineering-science</guid>
      <description><![CDATA[The complete human hacking framework — from OSINT and target profiling through influence, elicitation, and nonverbals, to the M.A.P.P. defense program. Hadnagy draws on Cialdini, Ekman, and Dreeke to build a science-grounded SE methodology. Capabilities: Apply the SE Pyramid: OSINT → profiling → pretext → rapport → elicitation → execution; Conduct OSINT gathering using LinkedIn, job postings, DNS, and Google dorks; Profile targets using DISC model (D/I/S/C) and adapt communication style accordingly; Design effective pretexts with authority, OSINT grounding, and graceful exit; Apply eight influence principles: reciprocity, obligation, scarcity, authority, social proof, etc.; Use elicitation techniques: deliberate false statement, bracketing, mutual sharing, framing; Read nonverbal baseline vs. discomfort signals (comfort/discomfort, self-soothing, barriers); Distinguish influence (ethical) from manipulation (exploitative); Implement M.A.P.P. defense: identify patterns → policies → SE pentests → awareness training; Classify SE attack vectors: phishing, vishing, SMiShing, physical impersonation.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[TCP/IP Illustrated, Volume 1 — TCP/IP Illustrated, Volume 1: The Protocols, 2nd Edition]]></title>
      <link>https://bythewei.dev/skills/tcpip-illustrated</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/tcpip-illustrated</guid>
      <description><![CDATA[The definitive protocol reference — every TCP/IP protocol explained with packet captures and field-by-field analysis. Covers IPv4/IPv6, ARP, ICMP, UDP, TCP (connection, reliability, congestion control), DNS, NAT, and protocol-layer attacks. Capabilities: Explain the full TCP/IP stack from link layer through application; Decode IP, TCP, UDP, ICMP, ARP header fields and their purpose; Trace TCP connection lifecycle: 3-way handshake, state machine, TIME_WAIT; Explain TCP congestion control: slow start, AIMD, fast retransmit, CUBIC; Calculate RTO using Jacobson/Karels algorithm with Karn's algorithm; Explain NAT traversal: STUN/TURN/ICE mechanisms; Identify protocol-layer attacks: ARP spoofing, SYN flood, DNS poisoning, IP fragmentation; Understand IPv4/IPv6 addressing: CIDR, subnetting, special ranges; Explain DNS resolution chain: recursive resolver, root, TLD, authoritative.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Twisted Network Programming Essentials — Twisted Network Programming Essentials, 2nd Edition]]></title>
      <link>https://bythewei.dev/skills/twisted-network-programming</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/twisted-network-programming</guid>
      <description><![CDATA[Twisted event-driven networking for Python: reactor pattern, Protocol/Factory/Transport layering, Deferred callback chains, LineReceiver state machines, Twisted Web server and client, SSH via Conch, and testing with Trial's StringTransport mock. Capabilities: Build TCP servers and clients using Twisted's Protocol/Factory/Reactor pattern; Implement line-based state machine protocols with LineReceiver for multi-stage sessions; Chain async operations with Deferred callback/errback without blocking the reactor; Offload blocking calls to threads with deferToThread while keeping the reactor responsive; Serve HTTP endpoints with Twisted Web resource.Resource render_GET/render_POST methods; Test protocols in isolation using proto_helpers.StringTransport without network I/O; Deploy Twisted apps as daemons with twistd and .tac configuration files.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[Understanding the Linux Kernel — Understanding the Linux Kernel, 3rd Edition]]></title>
      <link>https://bythewei.dev/skills/understanding-linux-kernel</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/understanding-linux-kernel</guid>
      <description><![CDATA[Comprehensive deep-dive into Linux 2.6 kernel internals — memory addressing (paging/segmentation), process management (task_struct, context switch, CoW), scheduling, synchronization primitives, memory management (buddy/slab), VFS, device drivers, page cache, IPC, and ELF execution. Capabilities: Explain x86 memory addressing: segmentation → paging → physical address translation; Trace process creation from fork() through copy-on-write to exec(); Explain kernel synchronization: spinlocks, semaphores, RCU, atomic ops — and when each applies; Describe Linux scheduling: priority levels, O(1) scheduler, SMP load balancing; Explain buddy system and slab allocator for kernel memory management; Trace page fault handling from exception to page allocation or file read; Explain system call entry path (int 0x80/syscall) and argument passing; Describe VFS object hierarchy: superblock, inode, dentry, file and their operation tables; Explain page cache writeback, dirty page management, and sync vs fsync; Describe ELF binary format and exec() flow including dynamic linking.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
    <item>
      <title><![CDATA[ZAP Cookbook — Zed Attack Proxy Cookbook]]></title>
      <link>https://bythewei.dev/skills/zap-cookbook</link>
      <guid isPermaLink="true">https://bythewei.dev/skills/zap-cookbook</guid>
      <description><![CDATA[Practical OWASP ZAP recipes for web app pentesting: Docker/GUI setup, Python API automation, spidering (traditional + AJAX), authentication bypass, IDOR, cookie security, CSRF, session hijacking, XSS/SQLi/SSTI/SSRF/command injection fuzzing, business logic manipulation, report generation, and CI/CD integration. Capabilities: Set up ZAP via Docker or GUI and configure browser proxy for HTTPS interception; Automate ZAP scans via Python API: spider, active scan, alert retrieval; Test authentication bypass using SQLi payloads, JWT manipulation, and credential fuzzing; Identify IDOR vulnerabilities by replaying requests with modified ID parameters; Fuzz input fields for XSS, SQLi, SSTI, and command injection using payload wordlists; Test SSRF with AWS metadata endpoint and bypass encoding techniques; Integrate ZAP baseline and full scans into CI/CD pipelines via Docker and GitHub Actions.]]></description>
      <category>technical</category>
      <pubDate>Fri, 27 Mar 2026 00:00:00 GMT</pubDate>
    </item>
  </channel>
</rss>