Review six routing assurance claims

Objectives

The network team submits six independent statements for a change approval. Its lead says any healthy route or translation table proves the whole boundary secure.

Accept technically sound statements and reject each defective statement using its single root-cause code. Judge the claims as written, not the team's confidence.

Verdicts are accept or reject. Every rejection needs one reason code from: prefix-selection | routing-model | lifetime-purpose | translation-control.

Codes: prefix-selection = wrong forwarding precedence;
 routing-model = wrong route-learning mechanics;
 lifetime-purpose = wrong purpose for packet lifetime;
 translation-control = translation mistaken for policy enforcement.
NR-1 For 10.24.6.70, an installed reachable /26 matching that address beats a matching /24 even if the /24 metric is lower.
NR-2 0.0.0.0/0 always wins over a matching installed /24 because it covers more addresses.
NR-3 A manually configured static route automatically learns a replacement next hop from neighboring routers when its link fails.
NR-4 Increasing TTL repairs inconsistent forwarding tables and ends a routing loop.
NR-5 Multiple TCP clients can share an outside IP through translated ports; attribution needs timed inside/outside tuple records and protocol.
NR-6 A port forward needs no firewall policy review because translating its destination automatically enforces least privilege.

Step-by-step hints

The guided walkthrough, in full. It is free: no XP cost, and it does not touch the paid hint ladder or the reveal gate.

1. Step 1

   Read the request before the artefact

   Treat the packet path and security boundary as separate assurance questions. Check the mechanism behind each promised outcome.

2. Step 2

   Judge every line, including the boring ones

   Give every statement one verdict and keep its identifier intact. Do not omit statements that seem routine.

   Every line in the fixture carries a verdict

3. Step 3

   Separate what is wrong from what is merely ugly

   Check whether each claim describes something the named mechanism actually does. Distinguish a changed header from a changed route, and a reachable endpoint from a permitted one.

   Accept and reject land on the right lines

4. Step 4

   Say why, in the vocabulary the programme uses

   For a rejection, choose the code describing the root technical misconception. Leave the reason empty when accepting a statement.

   Each rejection cites a valid reason code

Rules summary

• XP on pass

  40 bonus XP the first time every check goes green.

• Paid hints

  2 available. Each costs 25% of the lab XP (about 10 XP).

• Reveal solution

  Scores 0 XP and unlocks only after 3 check runs.

• Attempt cap

  60 check runs per learner. The runner warns you in the last 10.

• Drafts

  Your editor content is saved in this browser, so a reload will not lose work.

• Walkthrough

  Always free and never penalised: use it before spending a hint.