In ones'-complement addition the carry-out of the highest bit is not discarded — it is wrapped back and added into the lowest bit. This end-around carry is what corrects the arithmetic (it accounts for the two-zeros gap), and it makes the carry loop: the top feeds the bottom, a ring rather than a line. It is the exact hardware picture of the thread's carry that folds back to its own seed — and it is why the TCP/IP checksum is order-independent and catches errors: the fold-around makes the sum a ones'-complement invariant. A carry that comes back around.
The demo adds in 4 bits so a carry escapes the top, then wraps it back into the bottom: 6+12→3 (with the fold): live demo
“A carry off the top is lost.” — in ones' complement it wraps back into the bottom, correcting the sum and making the carry a loop. The top feeds the seed. cited
The carry that runs off the top comes back in at the bottom — a loop, not a line; the fold made a ring. end-around carry
On the canonical compiler, a 4-bit add producing 18 wraps: low nibble 2 plus the escaped carry 1 = 3: