## https://sploitus.com/exploit?id=491A148B-7854-52A1-BB13-ECF3C1F0A958
# [**Links**](#links)
# [**Challenges**](#challenges)
| Category | Name | Objective | Difficulty [⭐⭐⭐⭐⭐] |
| - | - | - | - |
| Pwn | [RINg the Bell]() | ret2win | ⭐ |
| Pwn | [The Hinge Whisper]() | Stack-based buffer overflow with shellcode injection. The binary leaks the stack address of a 64-byte buffer and then reads exactly 80 bytes (`0x50`) into it with `read()`. The player must hand-write or adapt x86-64 shellcode, pad to the saved return pointer, and overwrite it with the leaked buffer address. | ⭐ |
| Pwn | [The Corroded Crown]() | Use-After-Free primitive to leak `libc` via the unsorted bin, poison the `tcache` to allocate at `__free_hook`, and redirect `free()` to `system()`. | ⭐⭐ |
| Pwn | [The Emptiness Machine]() | File Stream Oriented Programming (FSOP) vulnerability. The binary accepts two short user inputs via `scanf`, but mistakenly passes `stdout` and `stderr` (libc `FILE*` pointers) as destination buffers. This allows an attacker to overwrite the internal `_IO_FILE` structures of both standard streams. By corrupting `_IO_2_1_stdout_` we force a libc address leak, and by crafting a fake `_IO_2_1_stderr_` structure with a wide-character vtable hijack, we redirect control flow to `system` on program exit. | ⭐⭐⭐ |
| Pwn | [Words From the Past]() | Two-stage 5-byte jmp rel32 shellcode to bypass randomized RWX mmap and reach a libc one_gadget. | ⭐⭐⭐⭐ |
| Pwn | [Heavy Is The Krown]() | Exploit a deterministic use-after-free in a hardened Linux kernel module to achieve arbitrary kernel read/write, bypass KASLR via IDT scan, and overwrite modprobe_path to escalate privileges and read the flag. | ⭐⭐⭐⭐⭐ |
| Reversing | [Cinderbound]() | Recognize a MicroPython v6 .mpy bytecode file (not a CPython .pyc), disassemble it with mpy-tool.py to recover the judge() function's per-character XOR-accumulator check against 16 hardcoded target bytes, then invert the transform (XOR is its own inverse) to recover the flag. | ⭐ |
| Reversing | [Ringtrue]() | Reverse a small x86-64 firmware ELF whose authentication check is a 3-layer int8-quantized neural network (MLP) with a nonlinear activation. Extract the quantized weights, biases and target output from the binary and invert the network layer by layer to recover the eight-sample input, which both authenticates the relic and derives the key that decrypts the flag. | ⭐ |
| Reversing | [First Mark]() | Reverse a stripped bare-metal RV32IM ELF that uses four undocumented custom-0/custom-1 RISC-V instructions (an 8-bit rotation, a GF(2^8) field multiply under the AES polynomial, an XOR-with-carry, and a check-and-trap), decode them from the R-type encoding, and invert the pipeline against the seal table embedded in .rodata to recover the flag. | ⭐⭐ |
| Reversing | [The Cinder Engine]() | Reverse a custom-ISA CPU emulator to recover its scrambled opcode map, encoding, and memory model, then lift the embedded firmware ROM to find a bespoke 8-round SPN block cipher with data-driven table lookups. Recover the S-box, round keys, and secret linear layer, then run the cipher backwards to forge the one 32-byte input the engine accepts. | ⭐⭐⭐ |
| Reversing | [CorpSyncAudit]() | Reverse a Windows PE that hides its imports behind PEB-walking export-hash resolution; a crafted .log file with payload encoded across datetime-stamp fields drives a hidden parsing path that reconstructs shellcode byte-by-byte, injects it into explorer.exe via CreateRemoteThread, and adds a privileged backdoor user whose password is the flag. | ⭐⭐⭐⭐ |
| Reversing | [Secondhand]() | Reverse a 49-byte block of hand-laid machine code that decodes two different ways depending on entry offset -- the front reading is a decoy hashing loop, while jumping 6 bytes in reveals the real check, itself unpacked and JIT'd into an executable page at runtime. Recover the check's target constant, invert it to the accepted 8-byte input, and derive the SplitMix64 keystream (seeded by that input) that XOR-decrypts the embedded flag ciphertext. | ⭐⭐⭐⭐⭐ |
| Web | [Gatery]() | Exploit an ElysiaJS signed-cookie validation bypass in the castle gate web application to enter the protected area and retrieve the flag. | ⭐ |
| Web | [massagold]() | Exploit a stored XSS under a restrictive CSP to retrieve the flag. | ⭐ |
| Web | [Provisioned]() | Exploit a deserialization vulnerability and create gadget chains based on joomla's vendor classess to achieve RCE. | ⭐⭐ |
| Web | [Archonyx]() | Steal a warden's relay key through a CSS side-channel oracle, chain package-level vulnerabilities in decompress, unzipper, and less to leak the JWT secret, plant a payload, forge a ledgermaster token, and reach remote code execution to read the flag. | ⭐⭐⭐ |
| Web | [Signetry]() | Exploit the authentication, appeal-review, model-state, and deserialization paths to achieve remote code execution and recover the flag. | ⭐⭐⭐⭐ |
| Web | [CrownSpire Bellworks]() | Chain SAML truncation, web cache deception, SSRF, HTTP request smuggling, reverse-proxy config abuse, and PostgreSQL memory corruption to reach database-superuser RCE and read the flag. | ⭐⭐⭐⭐⭐ |
| Crypto | [False Witness]() | Predictable hash function that results in breaking the decisional problem by enumerating all group elements. | ⭐ |
| Crypto | [Fractured Seal]() | Recover RSA private key given leaked information from PEM file using Coppersmith's small roots | ⭐⭐ |
| Crypto | [The Ashen Field]() | Exploit a standard implementation of the Hidden Field Equations protocol via Groebner Basis | ⭐⭐ |
| Crypto | [Ashbyte Arcade]() | Break 2-round AES | ⭐⭐⭐ |
| Crypto | [Ancient Artifacts]() | Find preimage in adler32 checksum, then find a way to create arbitrary many collisions, and use affine properties of crc32 to create preimage | ⭐⭐⭐⭐ |
| Crypto | [Hidden Secret]() | The user needs to solve a problem similar to Hidden Subset Sum Problem, except given fewer samples, and with the unknowns being part of a geometric sequence. | ⭐⭐⭐⭐⭐ |
| Forensics | [Force Push]() | Recover a production key from dangling Git objects left behind after a bad commit was removed by force-push and reflog expiry. | ⭐ |
| Forensics | [The Compressed Truth]() | Analyze 7-Zip registry artifacts to trace an operative extracting secrets from memory using Keefarce and staging the stolen records into an archive for exfiltration. | ⭐ |
| Forensics | [Deception Strategy]() | Analyze Process Monitor logs, network traffic, and filesystem artifacts to trace a malicious DLL sideloaded by Discord and recover exfiltrated clipboard data. | ⭐⭐ |
| Forensics | [The Ash-Binder Signature]() | Analyze artifacts from a compromised Linux environment and reconstruct the attack timeline to recover the flag. | ⭐⭐⭐ |
| Forensics | [Remnant]() | Decrypt TLS 1.2 and TLS 1.3 traffic, replay RDP sessions, analyze C2 communications, and use the Google Drive API to retrieve exfiltrated files. | ⭐⭐⭐⭐ |
| Forensics | [Harvesting Severed Threads]() | Extract the Master Volume Key of a LUKS2 partition, parse the Linux Keyring to retrieve secrets, and recover Wireguard keys to decrypt exfiltration traffic. | ⭐⭐⭐⭐⭐ |
| Mobile | [Overstrike]() | Reverse the Godot Mono game assembly bundled in the APK. Recognise that the world seal the vow-stones read is recomputed from the carried mark every frame, so patching the seal is futile. Identify the mixer as the splitmix64 finalizer, invert it to forge the carried mark that produces the true seal, and use that same mark to unseal the Registry and recover the flag. | ⭐⭐ |
| Mobile | [Proofmark]() | Reverse a stripped Android GDExtension library to recover a keyed hash implemented as bytecode for a custom virtual machine, then use it to compute the integrity token for a game state that honest play can never reach and decrypt the embedded record. | ⭐⭐⭐ |
| Mobile | [Salt Crown]() | Place five shard-seats at the choke points on the exact beat that admits each one. The beats are not stored in the game. Recover them by reversing the native library and growing the strike-plate's wear from the rubbing that ships with the APK. | ⭐⭐⭐⭐ |
| Hardware | [Thermal Receipt]() | Connect to PRET PJL mode, enumerate device files, recover the latest journal receipt, follow the NVRAM reference, and read NVRAM to recover the flag. | ⭐⭐ |
| Hardware | [satlock drift]() | Enumerate the web UI and RF service, observe the rolling counter, jam the physical fob unlock, replay the preserved unused frame, and recover the flag. | ⭐⭐⭐ |
| Hardware | [Wireless Connections]() | Reverse engineer an ESP32-S3 firmware dump, identify the custom Arduino logic in Ghidra, recover the encrypted byte array, use the board MAC OUI to reduce the key search space, and decrypt the relay key. | ⭐⭐⭐⭐ |
| GamePwn | [The Salt Crown]() | Peel back the layered encryption hiding the game's Godot resource pack to recover its logic, then reverse the custom-packed native GDExtension for the ordered, hidden event opcodes of its severance state machine and drive the live game by intercepting and substituting those opcodes on the boss's attack handler. | ⭐⭐⭐⭐ |
| ICS | [Line Tap]() | Discover the telnet interface, exploit CVE-2026-24061, and achieve RCE on GNU inetutils telnetd to recover the checkpoint token. | ⭐⭐ |
| ICS | [Crownspire Transfer]() | Enumerate the HMI and field service, inspect public process state, analyze the maintenance PCAP, recover a replayable handoff primitive, operate the mapped controls, and recover the checkpoint token from the resulting alarm. | ⭐⭐⭐ |
| ICS | [Ash-Vault Interlock]() | Enumerate HMI and Modbus/TCP, bypass engineering headers, recover ladder logic, map PLC signals, drain and stabilize the process, reset the latch, hold the seal command, and recover the flag from the AVX900 alarm. | ⭐⭐⭐⭐ |
| Coding | [Granary Seal]() | Given the custody roll of trusted hands for each of the three roles and a batch of ration orders, determine how many orders have every hand already known to its roll. | ⭐ |
| Coding | [Three Tankards and a Lie]() | Given N starting positions each holding a distinct item and a sequence of M position swaps, answer Q queries asking the final position of the item that started at a given position. | ⭐ |
| Coding | [Toll Schedule]() | Given each convoy's arrival time and each checkpoint clearance's opening time, assign every convoy to a distinct clearance that opens no earlier than its arrival, minimizing the total time the column spends waiting — the clean baseline Elric needs to expose how much slower the real schedule is running. | ⭐⭐ |
| Coding | [Ash Record]() | Given a set of recovered residues with timestamps and material types, and a suspected extraction sequence, find the longest prefix of the sequence that can be matched by the residues in order, respecting a minimum time gap between consecutive matches. | ⭐⭐⭐ |
| Coding | [Rumour Spine]() | Given a network of quiet hands and a priming signal's coordinator and target district, determine the minimum number of intermediary hands that must be exposed to block every path the signal could travel. | ⭐⭐⭐⭐ |
| Coding | [Vow Engine]() | Given a witness-chain of nodes connected by weighted seal-marks, answer Q live challenges asking whether a specific cadence value is achievable along some oath-path between two given witnesses. | ⭐⭐⭐⭐⭐ |
| Quantum | [The Forged Signet]() | Use Simon's algorithm against the oracle's hidden XOR period, collect Hadamard-basis samples, solve the GF(2) nullspace for the First Mark, and submit it to forge the seal. | ⭐⭐ |
| Quantum | [The Coin That Won't Land]() | Exploit a perfectly hiding quantum commitment by using Bell pairs to wait for each challenge basis, open all 32 rounds successfully, and recover the flag. | ⭐⭐⭐ |
| Quantum | [The Counting House]() | Forge an Aaronson-Christiano subspace-money entry note, recover reused BB84 bid encodings to learn the clearing price, defeat the final quantum bit-commitment seal with Bell pairs, and settle with a forged note. | ⭐⭐⭐⭐ |