Mystery clues & narrative evidence

Misfiled name clue workbench

Audit a fictional name index using an explicit alphabet and two-part filing keys. Compare competing rules, expose ties and separate a reader worksheet from the private solution.

Read the naming guide ↓
01

Set the story constraints

2–40 records. id/name/primary/secondary. Declare the filing parts yourself; the tool does not parse names or guess readings. IDs start with an ASCII letter.

Every record ID once. This is the prop the reader sees; auditing does not rewrite it.

Distinct Unicode code points, first to last. Prefixes precede longer keys. This is an authored convention, not a locale sorting standard.

Each literal code point is removed after case folding, from keys only. Nothing is silently trimmed or normalized.

Authored text, copied as entered into both-language packets. It is not auto-translated or checked for truth. Blank withholds reader packets. Private keys and audit are never added to them.

Save & restore a creative project

Stored on this browser. A private project export contains all inputs, including hidden identities. Review it before sharing.

02

Consider the result 2

Static example; JavaScript enables interaction.

Default-input example. Initial lettering metrics are approximate.

Exact filing-key derivation
Record / partEntered textAfter case ruleKey / zero-based ranksRemoved characters
Aven Reed [aven] primaryREEDREEDREED 17, 4, 4, 3none
Aven Reed [aven] secondaryAVENAVENAVEN 0, 21, 4, 13none
Bela Marsh [bela] primaryMARSHMARSHMARSH 12, 0, 17, 18, 7none
Bela Marsh [bela] secondaryBELABELABELA 1, 4, 11, 0none
Cira Ash [cira] primaryASHASHASH 0, 18, 7none
Cira Ash [cira] secondaryCIRACIRACIRA 2, 8, 17, 0none
Daro Vale [daro] primaryVALEVALEVALE 21, 0, 11, 4none
Daro Vale [daro] secondaryDARODARODARO 3, 0, 17, 14none

Display names are unchanged. There is no Unicode normalization, locale collation, reading inference or name-part parsing.

Permitted positions and unresolved ties
RuleNamePrinted positionPermitted rangeEqual-key recordsInvolved inversions
Current primary → secondaryAven Reed [aven]13–3none2
Current primary → secondaryBela Marsh [bela]22–2none2
Current primary → secondaryCira Ash [cira]31–1none2
Current primary → secondaryDaro Vale [daro]44–4none0
Alternative secondary → primaryAven Reed [aven]11–1none0
Alternative secondary → primaryBela Marsh [bela]22–2none0
Alternative secondary → primaryCira Ash [cira]33–3none0
Alternative secondary → primaryDaro Vale [daro]44–4none0

A range is the whole equal-key block. Remaining inside a permitted range does not clear every pairwise conflict; inspect all inversion witnesses. No unique culprit is inferred.

All inverted pairs under each rule
RulePrinted earlierPrinted laterDecisive partKey comparison
CurrentAven Reed [aven] @1Bela Marsh [bela] @2primaryREED > MARSH
CurrentAven Reed [aven] @1Cira Ash [cira] @3primaryREED > ASH
CurrentBela Marsh [bela] @2Cira Ash [cira] @3primaryMARSH > ASH

An empty table means no inverted pair in the entered sequence under the evaluated rules. Ties may still prevent a unique order. Counts describe this prop only, not reader comprehension or criminal responsibility.

primary → secondary

3 inverted pairs; 0 equal-key groups. The printed order conflicts with the declared rule. Equal keys do not establish a hidden internal order.

A violated pair is not a unique culprit

3 inverted pairs exist under primary → secondary. Moving either endpoint can repair a pair, but one repair may affect others. Read the complete witness table before assigning a narrative cause. Alphabet order and key parts are authored inputs, not facts inferred from the visible name.

Establish the convention in the scene

0 equal-key groups remain. A compatible alternative may explain the same prop; it does not prove what a character knew. The reader worksheet contains only printed labels and your exact note, while this card, favorites and result exports remain private audit material.

secondary → primary

0 inverted pairs; 0 equal-key groups. This printed order is compatible with the declared rule. Equal keys do not establish a hidden internal order.

A violated pair is not a unique culprit

0 inverted pairs exist under secondary → primary. Moving either endpoint can repair a pair, but one repair may affect others. Read the complete witness table before assigning a narrative cause. Alphabet order and key parts are authored inputs, not facts inferred from the visible name.

Establish the convention in the scene

0 equal-key groups remain. A compatible alternative may explain the same prop; it does not prove what a character knew. The reader worksheet contains only printed labels and your exact note, while this card, favorites and result exports remain private audit material.

Original AI-assisted guide. Updated 1 November 2026. Methods: explicit local rules and documented source records. Autonomous checks are recorded; no human expert approval is implied.

What a misplaced name can actually establish

A name in the wrong place can be a useful mystery clue because the reader can inspect it directly. But “wrong” requires a rule. A cast list arranged for performance order is not an alphabetical index. A drawer labelled with a stage name need not follow the character’s legal family name. Before making an accusation depend on a misplaced card, decide what the document promises and what comparison would contradict that promise.

This workbench audits an authored sequence of names against a declared two-part filing convention. It constructs exact keys, shows their derivation, enumerates every inverted pair and compares the opposite key priority as a separate hypothesis. You supply the printed sequence; the tool never quietly repairs the prop. Its output concerns the sequence, not the honesty of its maker. There is no guilt score or automatic identification of the person who moved something.

Use it while designing a readable prop or revising the deduction that follows one. It is not a search of real registries, a locale-aware sorting service or an automatic parser of personal names. The display name and two filing parts are separate author inputs. This separation matters when a chosen name, inherited name, household label or performance identity belongs in the filing key. None of those roles can safely be discovered from a space in a string.

Original fictional scene: the costume rack before the curtain

The travelling puppet troupe had four costume hooks. Someone had moved their brass nameplates into the order Aven Reed, Bela Marsh, Cira Ash, Daro Vale. Beside the rack hung an instruction from the previous keeper: family part first, given part second. Cira found her blue sleeve on the third hook and announced that someone had rearranged the rack to delay her entrance. Aven, whose name now occupied the first position, became the obvious target of her anger.

Bela asked her to leave the plates where they were. Under the keeper’s instruction, Ash should precede Marsh, Marsh should precede Reed, and Vale should come last. Three pairs contradicted that instruction. Yet the plates also followed another complete pattern: Aven, Bela, Cira, Daro. The new assistant had been rehearsing the given names aloud while attaching the costumes. That explanation was possible; the order alone did not establish that the assistant had made it, or that no one had interfered afterwards.

The performers had to settle a more immediate question than who deserved blame. Could they identify the sleeve without moving every plate again just before the curtain rose? They called each performer by their chosen stage name and checked the costume itself. After the performance, they could ask which instruction the assistant had received. The misplaced names supplied a question about a convention, not a shortcut around testimony.

These people, names, troupe and incident are invented creative examples. The scene works because a name has two jobs: it identifies a performer and supplies parts for a physical arrangement. Cira initially treats a failure of the second job as proof of a hostile relationship. Bela separates those claims. A correction to the rack does not automatically repair the hurt accusation; the dialogue must deal with that consequence.

If Aven were renamed Zerin while retaining Reed, the family-first position would stay the same but the given-first explanation would change. Simply substituting a more dramatic name would not preserve this clue. Revise the visible plate and the authored secondary key together, then rerun both rules. If you instead changed Reed to Alder, the family-first order would change too. A useful rename review identifies which part carries the deduction rather than protecting the original accusation at any cost.

Reconstruct the prop before judging it

The initial records pair each stable ID with a display name and two explicit filing parts. For the example, primary is the family part and secondary is the given part. REED/AVEN, MARSH/BELA, ASH/CIRA and VALE/DARO are authored keys, not dictionary evidence. The uppercase spellings make the example easy to inspect; the tool can also apply its stated ASCII case rule.

The printedOrder field lists aven, bela, cira and daro exactly once each. It records what the reader actually sees. Under primary-first comparison, the permitted blocks are cira, bela, aven, daro. The witnesses are aven before bela, aven before cira, and bela before cira. Each witness reports both printed positions, the decisive part and its key comparison. Nonadjacent pairs matter: checking only the neighbouring cards would miss evidence about Reed and Ash.

Do not read three witnesses as three separate acts of tampering. One move can affect several pairs, and several different moves can repair a pair. The program does not reconstruct a unique physical history. It also does not prove that the number of witnesses measures how noticeable a mistake will be to readers. Use the list to check the logic of the deduction, then decide which observations the scene can naturally show.

An omitted name is a different prop. The input requires a complete permutation of the entered record IDs, rejecting duplicates, unknown IDs and missing records. If an empty hook is essential to the plot, model the relevant listed entries deliberately and explain that separate absence in the story. Do not delete a difficult row merely to obtain a clean audit while continuing to describe the original full rack.

A comparison rule is a production decision

The alphabet field defines an exact ascending sequence of distinct Unicode code points. The engine compares the first different code point by its declared rank. When one key is a prefix of the other, the shorter key comes first. Only if the first filing part is equal does the second part decide. There is no invisible third key based on record ID or display name.

The optional case rule changes ASCII a–z to A–Z only. It does not perform general Unicode case folding. Ignored characters are removed after that step and only from the filing keys. The default explicitly ignores a space, an apostrophe and a hyphen. The trace shows what was entered, what case processing produced, which characters were removed and which ranks remain. Display labels are kept intact.

An undeclared character stops the audit. You can add it to the alphabet, explicitly ignore it when that is the intended convention, or provide a different authored filing form. Those choices have different meanings. The software does not guess a reading for a Japanese name, equate an accented letter with an unaccented one or normalize full-width forms. A custom kana sequence is your fictional ordering rule, not a claim to implement every convention used by Japanese institutions.

For a real historical document, research its actual practice separately. If the evidence does not establish a practice, preserve that uncertainty in the scene. A rule that is convenient for solving a puzzle is not thereby a cultural fact. This tool deliberately avoids importing an apparently authoritative sorting convention that your reader may never have encountered.

When two records cannot be ordered

Equal primary and secondary keys form a block. The workbench reports the whole permitted position range and identifies the other records in that block. It preserves their printed order for displaying a possible arrangement, but does not certify that internal order. Stable IDs keep records distinct even when both their keys and display labels happen to match.

Suppose Bela’s two keys are changed to REED and AVEN while her displayed label remains Bela Marsh. The author has now declared the same filing key for Bela and Aven. Neither order inside their block is an inversion. That may be a deliberate feature of a fictional cataloguing system, or an authoring error. The tool exposes the equivalence; it cannot settle which explanation you intended.

Do not solve a plot by claiming that an unprovided tiebreak must exist. If another field really decides the order, this two-part model is insufficient for that inference. Redesign the clue around supported evidence or use an explicitly researched method outside this worksheet. An unresolved block is often better than a brittle deduction that relies on a hidden rule.

Test the explanation that would defeat your clue

Turning on the alternative computes secondary-first and then primary, with the same records, alphabet, ignored characters and printed order. In the initial example that alternative fits all four entries. Selecting secondary as the current priority changes the current verdict; comparison does not merely add a different title to the same calculation.

Only this particular competing priority is tested. A compatible alternative does not demonstrate that the maker knew it. An incompatible alternative does not eliminate sorting by rehearsal order, costume colour, date of arrival or another rule outside the model. Keep the scope of your detective’s sentence as narrow as the evidence: this order contradicts the posted instruction, but it could reflect a different filing priority.

The reader note is your exact authored text. The engine neither checks it against the controls nor translates it. If you change the alphabet but leave a note saying A–Z, the technical audit and the reader’s instructions will diverge. Review the note after every material revision. A deduction is only as available as the rule and relevant observations actually supplied in the work.

Separate a rehearsal handout from the solution

The dedicated reader worksheets contain a scope warning, your note and the numbered display labels in their printed order. They omit record IDs, filing keys, inversion witnesses and the alternative calculation. English and Japanese packet buttons localize the wrapper, not the note or names you entered. Prepare the text for the intended audience yourself. A blank note withholds both reader packets rather than substituting an invented instruction.

The private audit includes the input model, derived keys and both evaluated scenarios. Main result copying, favorites, comparisons, project exports and ordinary result exports remain author material. They are not automatically safe for a reader who should discover the solution. Even a reader worksheet may spoil a scene through its names or explicit instruction; inspect the actual downloaded file before sending it.

For a small rehearsal, give a participant the prop and the instruction you plan to place in the story. Ask what sequence they expect and what alternatives they consider. Record actual observations elsewhere; this worksheet does not run a comprehension study or turn the compatible-rule count into one. Revise the narrative when readers lack the necessary information instead of adding a stronger claim to the result card.

Bring revisions back into the scene

Keep the printed sequence and the reason for its creation with the production notes. If a name changes, decide whether only the displayed form changes or its filing key must also change. The tool permits those inputs to differ because some projects genuinely file a chosen label under a different authored key. That flexibility makes an explicit review necessary; a visual rename never silently changes the hidden key.

Save parameters to retain an editable project, and use a private export for a portable copy. Within the supported limits, the audit enumerates all pairs rather than sampling them. The worksheet accepts 2–40 records and rejects malformed or oversized input without truncating names. If a constraint fails, preserve the prop and correct its declared model before interpreting another result.

Finally, write the consequence of the discovery. Who has authority to define the filing convention? Who knows that it changed? Does an accusation survive when a second explanation becomes available? Those questions turn ordering into characterization. A correctly sorted list is useful production work; an original scene also needs people whose choices explain why the list matters.

Does one misplaced card identify the culprit?

No. Each witness identifies a pair that conflicts with the entered convention. Either endpoint might have moved, and a different convention might explain the whole prop. Establish actions and knowledge with separate story evidence.

Can the tool infer the family part of a name?

No. Enter primary and secondary explicitly, including supported filing text for names with readings you have researched. Display labels are never parsed, transliterated or normalized into hidden keys.

Why are two records allowed at the same position range?

Their two keys are equal under the declared character rules. They occupy a block without a certified internal order. ID order is not a secret third rule, even when the displayed labels differ.

Is every exported file suitable for a blind reader?

No. Only the dedicated reader worksheets omit audit keys, record IDs and the alternative solution. Your note is copied as entered, not translated. Inspect even that packet for spoilers; ordinary result and project exports remain private.

Method references and scope

This page’s methods and fixtures are original creative-production models. The guide states their assumptions and limits; no external historical or cultural authority is implied.