Why does one range produce several CIDR blocks?

CIDR blocks must be aligned powers of two, so an arbitrary range is split into the fewest aligned blocks that fit exactly.

Is this the minimal set of blocks?

Yes, the greedy alignment algorithm produces the smallest number of exact CIDR blocks for the range.

Get the total address count and the list of CIDR blocks that exactly cover a start-to-end IP range.

Start IPEnd IP

Total addresses: 126

CIDR blocks (8)

Output

192.168.1.5/32
192.168.1.6/31
192.168.1.8/29
192.168.1.16/28
192.168.1.32/27
192.168.1.64/26
192.168.1.128/31
192.168.1.130/32

Enter a start and end IPv4 address to see how many addresses the range holds and the minimal set of CIDR blocks covering it.

Why does one range produce several CIDR blocks?: CIDR blocks must be aligned powers of two, so an arbitrary range is split into the fewest aligned blocks that fit exactly.
Is this the minimal set of blocks?: Yes, the greedy alignment algorithm produces the smallest number of exact CIDR blocks for the range.