Audit rotating remainders in an equal whole-unit allotment

An equal allotment agreement becomes less obvious when units cannot be split. A remainder can go to the same group repeatedly while every round still totals correctly. Check both the individual round and the complete rotation before describing the arrangement as balanced under its stated rule.

Establish the agreement and identical units

Fictional practice example: three groups, G1, G2, and G3, agree to an equal allotment of ten identical preparation cards per round. Each card counts as one indivisible unit in this exercise. The group roster and total remain fixed across three rounds.

This is an invented agreement, not a claim that equal quantities satisfy every group's needs. The cards do not measure effort, merit, or speaking entitlement. Different values, unequal requirements, or a changed roster need a separately agreed rule rather than an assumption that this arithmetic defines fairness.

Separate the base share from the remainder

Ten divided among three gives a whole-unit base of three per group, with one card left. Giving the base shares uses nine cards. The remaining card must be assigned explicitly if all ten are to be distributed.

Write the quotient, remainder, and group identities in an allotment ledger. Giving each group three and silently dropping the final card changes the total. Giving everyone four requires twelve cards, which exceeds it. Neither is a faithful allocation of the stated ten units.

Follow a declared rotation

Start the extra-card pointer at G1. Round one gives G1 four cards, G2 three, and G3 three. Advance the pointer to G2. Round two gives three, four, and three respectively. Advance to G3; round three gives three, three, and four. The next pointer returns to G1.

Every round sums to ten. Across the three rounds, each group receives ten: one allotment of four and two allotments of three. Preserve the pointer alongside the allocations. A remembered intention to rotate is weaker evidence than a register showing which identity received the extra and where the next round begins.

Check incomplete cycles and repeated extras

After round one, cumulative quantities are four, three, and three. They are not equal yet. The agreement balances this complete three-round cycle; it does not make every intermediate total identical. Explain that boundary instead of reporting equality before it occurs.

As a deliberately flawed comparison, give G1 the extra in all three rounds. Every round still sums to ten, but cumulative totals become twelve, nine, and nine. A round-total check misses this repeated advantage. The identity-specific cumulative ledger detects it without treating a correctly recorded individual round as an arithmetic error.

Reopen the rule when conditions change

If a group joins, leaves, or does not want an allotment, ask the responsible participants how the agreement should change. Do not simply continue the old pointer and promise equal totals for a different roster. A changed total or unequal card value also changes what the previous check establishes.

Keep the fixed inputs, base share, remainder, pointer history, and cumulative totals together. Ask another reader to reconstruct the third round and explain why repeating G1's extra violates the declared rotation despite conserved totals. The finish is a complete, inspectable cycle under one agreed model. It creates no Kiguri allocation control, compulsory participation, or universal judgment about equitable resources.