Review addressing claims

Objectives

Six claims accompany a route and address change. The owner insists that fewer route entries always mean safer segmentation, and that the same usable-host formula applies everywhere.

Judge each claim independently using exactly the stated topology and address demand. Reject false claims with the most specific supplied reason; accept correct claims even when another line in the same change is wrong.

Verdicts are accept or reject. Every rejection needs one reason code from: reserved-endpoint | insufficient-capacity | unaligned-network | overbroad-summary.

NS-1 | Ordinary subnet: 192.0.2.64/26 provides 62 usable addresses.
NS-2 | Ordinary subnet: 192.0.2.127 is assignable inside 192.0.2.64/26.
NS-3 | A demand of 50 usable addresses including infrastructure fits in an ordinary /27.
NS-4 | 198.51.100.160/26 is a canonical network boundary.
NS-5 | 10.24.8.0/22 covers exactly 10.24.9.0/24 and 10.24.10.0/24, with no extra addresses.
NS-6 | On a supported RFC 3021 point-to-point link, 203.0.113.10/31 supplies two usable endpoint addresses.

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

   Read the topology qualifier and the exact claim on each line. Do not treat a reduction in routing entries as proof of a security improvement.

2. Step 2

   Judge every line, including the boring ones

   Make one decision for each fixture line, keeping identifiers intact and checking for omitted or duplicate rows.

   Every line in the fixture carries a verdict

3. Step 3

   Separate what is wrong from what is merely ugly

   Recalculate boundaries and capacities from the prefixes. For summaries compare the complete covered interval, and for specialised links check whether ordinary endpoint reservations apply.

   Accept and reject land on the right lines

4. Step 4

   Say why, in the vocabulary the programme uses

   Choose the failure category that explains the actual mathematical error. Do not use a capacity reason when a sufficiently large block merely starts at an invalid boundary.

   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.