pi-antigravity-rotator 1.3.3 → 1.3.4

package/README.md

@@ -134,7 +134,7 @@ Each model maintains its own active account. When the proxy needs to rotate a mo
 | 2 | `7d` | Long reset window is already active for this model | Already ticking, so it is still worth using |
 | 3 (last) | `fresh` | No active reset window is known for this model yet | Save untouched quota for later if other timed pools exist |
 
-Within the same priority tier, the account with the most remaining quota for that model wins.
+Within the same priority tier, the account with the most remaining quota for that model wins. If multiple accounts tie on priority and quota, rotation advances circularly from the current account so equal candidates share traffic instead of always favoring the first configured match.
 
 Timer meanings:
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "pi-antigravity-rotator",
-  "version": "1.3.3",
+  "version": "1.3.4",
   "description": "Multi-account rotation proxy for Google Antigravity with per-model routing, real-time quota tracking, and infringement detection",
   "license": "MIT",
   "type": "module",

package/src/rotator.ts

@@ -340,6 +340,7 @@ export class AccountRotator {
 		let best: AccountRuntime | null = null;
 		let bestPriority = Infinity;
 		let bestQuota = -2;
+		let bestDistance = Infinity;
 
 		for (let i = 0; i < this.accounts.length; i++) {
 			if (i === excludeIdx) continue;
@@ -351,10 +352,17 @@ export class AccountRotator {
 			if (!this.isFreshWindowAllowed(account, modelKey)) continue;
 
 			const priority = this.getModelTimerPriority(account, modelKey);
-			if (priority < bestPriority || (priority === bestPriority && quota > bestQuota)) {
+			const distance =
+				excludeIdx >= 0 ? (i - excludeIdx + this.accounts.length) % this.accounts.length : i + 1;
+			if (
+				priority < bestPriority ||
+				(priority === bestPriority && quota > bestQuota) ||
+				(priority === bestPriority && quota === bestQuota && distance < bestDistance)
+			) {
 				best = account;
 				bestPriority = priority;
 				bestQuota = quota;
+				bestDistance = distance;
 			}
 		}