The Status section called the workflow Study → Build → Check → Refine while the rest of the README and the app name the last step Ready; it now says Ready too.
The ext reader took every symlink shorter than 60 bytes as stored inline, so a short target kept in a data block was read from the block-pointer bytes and came out wrong. It now tells inline targets from block-backed ones by the inode's allocated blocks, allowing for extended attributes, ext4 allocation units and large block counts; inline-data symlinks are reported as not read, and a target whose data can't be read stays unknown, with its declared length kept.
Signed branch and switch displacements were cast back to unsigned offsets even when the destination lay before the method or past its last byte, so invalid targets reached control-flow analysis. Short branches, long branches and every switch destination are now checked against the body; an invalid one stops decoding before that instruction with a reported issue, keeping the instructions decoded before it.
The question prompt described a file changed a day ago as "1 days ago". It now says "yesterday" for ages from 24 up to 48 hours, as the app's own age labels do, and a test checks both edges.
Normal, delay-load and bound import readers now stop at the end of the file bytes their directory maps to, require complete descriptor and forwarder records, and mark the table truncated with a warning when they don't get them. A normal import table that runs past its declared Size, or has Size 0, is still read to its terminator, as Windows does, with a warning. Names and forwarders outside the bound import directory are reported instead of read from beyond it. The resource reader shares the same mapping-length helper, unchanged.
parse_address handed the digits after 0x (or before a trailing h) to from_str_radix, which accepts a leading sign, so 0x+10 and +10h read as 0x10. Hex addresses must now be non-empty hex digits, and anything else gets the usual "not an address" error. The address test covers 0x+10, +10h and 0x-10.
The cpio reader parsed header numbers with from_str_radix, which accepts a leading '+', so a malformed field such as "+000000A" read as a valid number. Hex and octal fields now must be all digits of their base, or they read as unreadable fields like any other malformed one. A test covers both kinds.
A number option parsed with f64, which accepts NaN, inf and infinity; JSON can't hold those, so the value silently became null. The CLI now refuses non-finite numbers with its usual "expects a number" error, and a test covers NaN, inf, -inf and infinity.
`core_evidence_exports_compare` indexes each operation/subject by a single record. Normal exports can contain several observations of that subject, including different text pages or successive versions of the same address annotation. Later index insertions silently overwrite earlier observations, so additions and removals disappear, changing record order changes the comparison, and one intact page can hide a tampered page from the changed count.
The AArch64 address tracker kept an old value after an addition with an unknown register, read unknown memory indices as zero, could keep a stale base after a load with writeback or a stale link register after a call, and did W-register additions in 64 bits, so stale values could name a later indirect call as an import its instructions didn't establish. Address facts are now kept only when the operands prove them: unknown addends and indices clear the result, W additions wrap at 32 bits, every register an instruction writes is forgotten before new facts are recorded, and calls clear the link register too.
The application graph recognizes a worker entry point but then follows its spawn edge while assigning the parent's role. Worker modules, their ordinary dependencies and their endpoint evidence consequently appear as `main`, `page` or `package`. The later worker-role pass cannot correct a role that was already assigned. Use the existing worker/service-worker/utility-process edge classification to stop parent-role traversal at execution-context boundaries. Worker roots still receive their own role and propagate it through ordinary imports. Spawn edges remain in the graph, and a module also directly imported by the parent retains the existing role precedence.
A package with 52 reachable modules loses the final module's role when each hop repeats the same `require()` 2,000 times. The graph resolves those imports, but role propagation charges its 100,000-step limit for duplicate queue entries, eventually leaving reachable modules as `unknown`. Mark modules in the existing role map before enqueueing them. Repeated imports, cycles and shared dependencies then use one queue entry per newly discovered module. The limit remains 100,000 newly discovered modules per assignment, and the existing main/preload/renderer/page/worker precedence stays intact. Inline scripts continue to inherit their page's role.
The token scanner ended `//` comments only at LF. A bare CR, U+2028 or U+2029 therefore hid following executable code inside the comment. That dropped imports, IPC and fetch facts in lexer fallback and prevented the parser admission check from seeing excessive nesting after the comment. Recognize every JavaScript line terminator when scanning line comments, skip Unicode terminators before charging the token budget, and stop identifiers at those boundaries. Strings, templates and block comments keep their existing handling.
A module keyed by `0x10` and a loader call written as `16` produced different identities. Numeric separators and exponent notation caused the same problem, including dangling `requires` targets in the application graph. Different spellings of one numeric dependency could also occupy separate list entries. Use the existing syntax library's JavaScript number conversion for numeric module keys, loader arguments, browserify mappings and chunk IDs. Explicitly enable its already-present `to_js_string` feature. String identifiers retain their literal spelling, including strings such as `"0x10"` that identify a different property from numeric `0x10`.
A text-read page that reached the last line of a file but cut a line at the 256 KiB limit reported cut_lines correctly, yet its coverage said complete because it was worked out from the line count alone. Coverage is now partial whenever a line on the page was cut.
Function studies identify their source bytes, but `app_call_path_find` currently joins their addresses without checking that source identity. Two different binaries can therefore contribute different edges at the same addresses and produce a call path that exists in neither binary. The regression uses two real ELF targets: one has main → helper, the other has helper → dispatch, and neither contains the complete main → dispatch path. Both inline records and saved evidence references reproduce the false path.
With FEAT_PAuth_LR and PSTATE.PACM set, RETAA and RETAB use x16 as an extra modifier. The decoder knows neither the CPU's features nor PSTATE, so authenticated returns now also record a possible read of x16, beside their link register and stack pointer, and value flow keeps that input.
The input loaders trust an earlier file-size report before reading to EOF. A regular virtual file can report zero bytes and still return data beyond the configured limit, and files can grow between the size check and read. Some loaders accept devices or pipes, allowing a text or evidence-bundle request to wait indefinitely for a writer. Prefix reads also use metadata size to decide whether to assign a whole-file hash, so a truncated prefix of a zero-size-reporting file is misidentified as the whole input.
A native function can branch to a body block placed before its entry address. The control-flow graph already included that block, but reference and string scans only looked from the entry onward, and parameter inference took the lowest-address block as the entry, so a register set by the real entry could become a false parameter while the real input disappeared. Reference scans now cover the address range of all of the function's body blocks, and parameters are read from the block at the function's actual entry.
A modern .pyc header's flag word defines only its two low bits, and other bits were read without comment. Undefined bits are now reported as a header warning, while the invalidation mode, source fields and code are read from the defined bits as before, so a file from a future Python release that adds a flag stays readable. Legacy headers, which have a timestamp in that position, are unaffected.
The AArch64 decoder drops XZR and WZR from the register list, so for an ordinary arithmetic instruction whose result is discarded, the first remaining source register was marked as written. That false write broke reaching definitions and could erase a proven import-slot base before a later load and call. The discarded-destination rule, which covered only flag-setting instructions, now applies to ordinary arithmetic too, so those registers stay inputs.
entropy() returned -0.0 for constant or zero-filled input, because summing the single symbol's term gives a negative zero, which shows as "-0.00". Adding 0.0 before the conversion turns it into +0.0 and leaves every other value unchanged. A test covers constant and zero-filled data.
Ordinary AArch64 returns treated the selected target register as a destination and unconditionally read `x30`, even for `ret x19`. Authenticated branches and calls had correct control-flow categories but fell through the generic operand-write rule, which overwrote their target's reaching definition. Authenticated returns also omitted their stack-pointer input.
A webpack wrapper can have a loader parameter named `r` while a nested function uses its own unrelated parameter with the same spelling. The dependency visitor treated both calls as module loads, adding false `requires` edges to the application graph. Resolve loader calls against the wrapper parameter's semantic binding. This retains closures that capture the real loader, distinguishes function/arrow parameters, block and catch bindings, and avoids treating the placeholder for a destructured parameter as an actual loader name. First-seen ordering and dependency deduplication stay intact.
core byte search ran its hex, UTF-8 and UTF-16LE queries in turn against one shared 100,000-match allowance, so a stream of later hex matches could use it up before an earlier text match was considered, and sorting afterwards couldn't bring that match back. Each query now keeps up to the cap, the results are merged in file-offset order and cut to the cap, and the result says when the cap was reached.
Null, cyclic and reused b-tree children were skipped while row counts and row pages still read as complete, so a readable sibling could look like the whole table. Such skips, along with missing pages, wrong page kinds, skipped rows and walk limits, now mark a count as a lower bound and a row page as incomplete, while the readable rows are kept.
ZIP, tar and cpio readers can stop their member listings early, but firmware extraction ignored their truncation flags, so directory entries could use up the member limit and later files were left out while the result reported complete coverage. A cut-short member listing, in any region or nested archive, now marks the extraction truncated with a limitation saying what to raise or inspect.
A ZIP stored inside a firmware ZIP member could supply the first plausible end record, so the scanner cut the outer archive short at the inner one: extraction left out outer members and wrote the inner contents at the wrong path. Each end record and central directory is now matched to the archive whose extent it describes, so a nested ZIP stays a member of the outer one and its siblings are all extracted.
Firmware extraction decoded ZIP members into a queue before charging their output bytes, so each member got the same remaining budget and a small compressed archive could hold many times the output limit; a member that hit the decode limit also left the truncation flag unset. Paths and the remaining file and byte limits are now checked before a member is decoded, each member is decoded only up to what's left, and a member stopped by the limit marks the extraction truncated.
Filesystem recovery already owns each extracted file's bytes, but firmware extraction copied them into its output queue and kept the originals, so a large recovered file took two full copies in memory before it was written. The recovered buffers are now moved into the queue. Path checks, byte and file limits, nested scans and the report are unchanged.
A truncated asset catalog tree or node header could give no entries and no warning, and apple_assets_list then reported a complete empty listing; other interrupted tree walks kept what they read but called the result complete. Tree completeness is now tracked through the headers, child and leaf links, missing blocks and walk limits. Readable entries are kept, and an incomplete tree marks coverage partial, sets tree_incomplete and says so in the summary. Legal empty trees still read as complete.
apple_archive_decode built every object row before paging and copied a shared class name once per object while counting classes, so a 97 KB archive with 1,024 objects sharing one 64 KiB class name held 64 MiB of class text even when one row was asked for. Only the requested rows are built now, and class names are borrowed from their shared class object while the class counts are taken. Totals, order, offsets, limits and the output shape are unchanged.
The Python bytecode reader shortened long constants and names to its per-string limit and marked them with an ellipsis, but still reported the code inventory as complete, and the ellipsis it added wasn't counted against the overall text budget. A shortened constant, name, file name or qualified name now marks the inventory cut short, the budget counts the marker, and shortened text still ends on a whole character.
The value-flow graph decoded every instruction of every block and only then applied its node limit, so a huge function did all that work before most of it was thrown away. The node budget is now spent as nodes are made: parameters first, then instructions, and decoding stops once it runs out. Blocks that weren't decoded in full are tracked so their edges and definitions aren't treated as complete, and the graph is marked truncated.
The safetensors reader kept the last value for a repeated JSON key, so two tensors with the same name, or a repeated dtype, shape, offset or metadata field, produced a complete-looking report while earlier entries were silently lost. The header is now read through a duplicate-checking JSON reader, and a header with a repeated key in any object is refused as malformed, as the safetensors format requires distinct keys.
AArch64 exclusive stores treated their status result as an input and never defined it, exclusive pair loads defined only their first result, and acquire-exclusive single loads were unknown operations. The value-flow graph lost the status edge into a retry loop's condition and the second loaded value, and pseudo-C could show an exclusive store as an assignment from its status register, or drop an exclusive load from a known import slot. Exclusive stores now write their status (unless it's discarded to WZR) and read their values, exclusive and acquire-exclusive loads are loads, pair forms define both results, and pseudo-C keeps them as memory operations.
app_builds_line_up paired only 1,448 of about 36,000 functions across two Rust toolchains, because every v0 crate hash changed, so exact names rarely matched. A new name_without_hash stage, after exact names, pairs Rust names (legacy and v0) that are equal once demangled without the compiler's hashes, and keeps the instantiating crate so each crate's copy of a generic impl stays separate. Called names are compared the same way, so the structure fingerprint survives a toolchain change, and a pair whose names differ only by hash isn't counted as renamed. On the same two cargo builds this pairs 14,036 functions (13,356 by name), with masked-bytes pairs down from 888 to 233. The crate lookup reads only the end of a name, so a long crafted symbol can't make it slow.
* packaging: use [[ for bash tests (SonarCloud S7688)
Behaviour-preserving: `[[ ]]` in place of `[ ]` for bash tests (SonarCloud shell:S7688). Every script has a bash shebang; no test uses `-a`/`-o`, escaped parentheses or an unquoted pattern on the right of `=`. `bash -n` passes on each script; the rest is left to CI.
Clears all 81 open issues: `packaging/{linux,macos,freebsd,web}/*.sh`.
* packaging/web: parse the wasm size override as base 10 under [[
Inside [[ ]], -gt evaluates its operands arithmetically: a leading zero reads as octal and other text as an expression. Read the override as a base-10 number, as photocraft does.
A long follow-up pasted into the prompt box during a build made its waiting note taller than the window: the note was drawn outside the conversation's scroll area, so it pushed the prompt box off screen and left no room for the live activity. Waiting notes now sit inside the conversation's scroll area, above the live activity, with their Take back and Send now controls scrolling with them. Up arrow still brings back the last waiting note. A smoke test checks a 160-line note in a 600-point window.
An MZ header with zero pages, a last-page size above 512, a header shorter than its fixed fields or a header larger than the declared image was read into clamped sizes with nothing said. Each of these is now reported as a problem, so the DOS tool marks the file inconsistent and the binary listing warns, while the entry point, relocations and load module still read. Full pages written with a last-page size of 0 or 512 stay clean.
A source map segment could point past the end of the sources or names arrays, as ACAA does with one declared source, and the index was kept. Such mappings are now refused as bad mappings. An explicitly unknown source (null) is still accepted.
A ROMFS name exactly as long as the name limit stopped the directory walk, because the scan for its terminator didn't look one byte past the limit: with max_name = 12, readme12.txt was refused. The scan now includes the terminator's byte, and a name one byte longer is still refused.
A Swift symbol ending in WZ is a stored variable's one-time initialization function, and one ending in Wz its one-time initialization token. The demangler reported both as "unsupported witness kind", including merged forms such as WZTm. They now read as swift-demangle prints them: the kind and the variable's name, with the surrounding module, type or extension left out and a private variable keeping its discriminator.
The UnityFS directory reader checked that compressed blocks fit the file but returned member offsets and sizes without checking the uncompressed stream they point into, so a member could lie past all data, overflow, or claim bytes in an empty stream. Block sizes are now summed with checked arithmetic, and a member whose range doesn't fit the stream is marked as unreadable. It keeps its directory entry, but its contents aren't read. Listings say how many such members there are, mark coverage partial and count objects as "at least", and the other members stay readable. An overflowing total of block sizes still makes the table unreadable.
The cramfs reader read the uncompressed-block flag (bit 31) as part of a block's end offset, so valid files and symlinks with blocks stored uncompressed were reported as corrupt. The flag is now separated from the end pointer, in either byte order, before the span is checked, and an uncompressed block is taken as is when its length matches the full or final partial block. Compressed runs, zero-filled holes and the size budgets are unchanged, and direct-pointer blocks are reported as unsupported.
Tv with an optional index is an outlined variable, the compiler's copy of a value named after the symbol before it (Tv_ is #0, Tv0_ is #1). The demangler reported every one as "unsupported thunk or specialization". They now read as swift-demangle prints them, "outlined variable #N of" a function, type, protocol witness or other global. A bare name, a module, an outlined variable of an outlined variable, or an index of 2^31 or more is still refused.