mirror of
https://github.com/PR0M3TH3AN/bitvid.git
synced 2026-11-06 12:52:26 +00:00
fix(login-perf): kill relay REQ storms and feedback loops
Real-environment console logs revealed nip-07 login pegging the CPU and starving encrypted-list decryption via relay REQ storms (~1000 REQ/s): - moderationService.rebuildTrustedContacts emitted "contacts" unconditionally, forming an emit->fetch->emit loop (~1600 kind-3 REQ/s). Now emits only on actual change. Regression test added. - Per-video live report (kind 1984) and view-count (kind 30079) subscriptions fan out O(videos x relays) and re-fire on every flaky-relay reconnect. Circuit-broken behind flags until batched (see refactor plan). - onVideosShouldRefresh now coalesces forced reloads (2s leading-edge throttle) so list-change signals can't drive a reload loop. - nip-07 queue reserves one foreground slot; DM decryption demoted to LOW so background DM backfill can't starve feed-driving lists. Test added. Co-Authored-By: Claude Opus 4.8 <[email protected]>
This commit is contained in:
1 parent
4bd9503caf
commit
a3b205bfa1
7 files changed
+293
-5
No files matched your search
@@ -0,0 +1,54 @@
|
||||
// Regression test for the nip-07-login CPU-peg / relay REQ storm.
|
||||
//
|
||||
// Scenario (SCN-contacts-emit-on-change):
|
||||
// Given the UI re-fetches trusted contacts whenever the moderation service
|
||||
// emits "contacts" (profileModalController.populateFriendsList ->
|
||||
// ensureViewerContactsLoaded -> fetchTrustedContacts -> rebuildTrustedContacts),
|
||||
// When rebuildTrustedContacts is invoked with an UNCHANGED contact set,
|
||||
// Then "contacts" is NOT emitted — otherwise the emit -> fetch -> emit chain
|
||||
// spins the CPU and floods relays with kind-3 REQs (observed ~1600/s).
|
||||
// And when the set genuinely changes, exactly one "contacts" event fires.
|
||||
|
||||
import test from "node:test";
|
||||
import assert from "node:assert/strict";
|
||||
import {
|
||||
withMockedNostrTools,
|
||||
createModerationServiceHarness,
|
||||
} from "../helpers/moderation-test-helpers.mjs";
|
||||
|
||||
const A = "a".repeat(64);
|
||||
const B = "b".repeat(64);
|
||||
|
||||
test("rebuildTrustedContacts emits 'contacts' only when the set changes", (t) => {
|
||||
withMockedNostrTools(t);
|
||||
const { service, capture } = createModerationServiceHarness(t);
|
||||
const emits = capture("contacts");
|
||||
|
||||
// Establish a baseline population (a real change from the initial state).
|
||||
service.rebuildTrustedContacts(new Set([A, B]));
|
||||
const afterFirst = emits.length;
|
||||
assert.ok(afterFirst >= 1, "first real population should emit at least once");
|
||||
|
||||
// Re-applying the SAME set repeatedly must NOT emit. This is the exact loop
|
||||
// that pegged the CPU: identical empty/unchanged rebuilds re-emitting forever.
|
||||
service.rebuildTrustedContacts(new Set([A, B]));
|
||||
service.rebuildTrustedContacts(new Set([A, B]));
|
||||
service.rebuildTrustedContacts(new Set([A, B]));
|
||||
assert.equal(
|
||||
emits.length,
|
||||
afterFirst,
|
||||
"unchanged contact sets must not emit (loop guard)",
|
||||
);
|
||||
|
||||
// A genuine change emits exactly once more.
|
||||
service.rebuildTrustedContacts(new Set([A]));
|
||||
assert.equal(emits.length, afterFirst + 1, "a changed set emits once");
|
||||
|
||||
// ...and re-applying that changed set is again silent.
|
||||
service.rebuildTrustedContacts(new Set([A]));
|
||||
assert.equal(
|
||||
emits.length,
|
||||
afterFirst + 1,
|
||||
"repeating the changed set must not emit",
|
||||
);
|
||||
});
|
||||
@@ -0,0 +1,115 @@
|
||||
// Scenario tests for the NIP-07 queue's reserved foreground slot.
|
||||
//
|
||||
// The extension is a single serialized resource with only 2 concurrency slots.
|
||||
// Background-class work (LOW priority: DM backfill) must never occupy every
|
||||
// slot, or it starves the feed-driving lists (hashtags, subscriptions, watch
|
||||
// history) and moderation/block lists. The queue reserves one slot for
|
||||
// foreground (priority > LOW) by capping background work at maxConcurrent - 1.
|
||||
//
|
||||
// These tests drive the real shared queue through runNip07WithRetry so they
|
||||
// assert the externally observable scheduling behavior, not internals.
|
||||
|
||||
import { test, describe, beforeEach, afterEach } from "node:test";
|
||||
import assert from "node:assert";
|
||||
import {
|
||||
runNip07WithRetry,
|
||||
NIP07_PRIORITY,
|
||||
} from "../js/nostr/nip07Permissions.js";
|
||||
|
||||
global.window = { nostr: {} };
|
||||
|
||||
describe("NIP-07 fair scheduling (reserved foreground slot)", () => {
|
||||
const originalWindow = global.window;
|
||||
beforeEach(() => {
|
||||
global.window = { nostr: {} };
|
||||
});
|
||||
afterEach(() => {
|
||||
global.window = originalWindow;
|
||||
});
|
||||
|
||||
// SCN-nip07-background-capped:
|
||||
// Given a flood of LOW-priority (background) tasks,
|
||||
// When they are all enqueued at once,
|
||||
// Then no more than (maxConcurrent - 1) === 1 of them ever run concurrently,
|
||||
// leaving a slot free for foreground work.
|
||||
test("background (LOW) work never uses more than the unreserved slots", async () => {
|
||||
let active = 0;
|
||||
let maxActive = 0;
|
||||
const task = (delay) => async () => {
|
||||
active += 1;
|
||||
maxActive = Math.max(maxActive, active);
|
||||
await new Promise((r) => setTimeout(r, delay));
|
||||
active -= 1;
|
||||
};
|
||||
|
||||
const all = [];
|
||||
for (let i = 0; i < 5; i += 1) {
|
||||
all.push(
|
||||
runNip07WithRetry(task(60), { priority: NIP07_PRIORITY.LOW }),
|
||||
);
|
||||
}
|
||||
await Promise.all(all);
|
||||
|
||||
assert.equal(
|
||||
maxActive,
|
||||
1,
|
||||
"at most 1 background task should run at once (1 slot reserved for foreground)",
|
||||
);
|
||||
});
|
||||
|
||||
// SCN-nip07-foreground-not-starved:
|
||||
// Given background (LOW) work is saturating its allowed slot,
|
||||
// When a foreground (NORMAL) task arrives,
|
||||
// Then it starts promptly using the reserved slot — it does NOT wait for a
|
||||
// background task to finish.
|
||||
test("a foreground task is not starved by a background flood", async () => {
|
||||
const start = Date.now();
|
||||
const log = [];
|
||||
const bg = (delay) => async () => {
|
||||
await new Promise((r) => setTimeout(r, delay));
|
||||
};
|
||||
const fg = () => async () => {
|
||||
log.push({ id: "fg", time: Date.now() - start });
|
||||
};
|
||||
|
||||
// Flood the queue with long background tasks first.
|
||||
const bgPromises = [];
|
||||
for (let i = 0; i < 4; i += 1) {
|
||||
bgPromises.push(runNip07WithRetry(bg(200), { priority: NIP07_PRIORITY.LOW }));
|
||||
}
|
||||
// Now a foreground task arrives while background is running.
|
||||
const fgPromise = runNip07WithRetry(fg(), { priority: NIP07_PRIORITY.NORMAL });
|
||||
|
||||
await fgPromise;
|
||||
const fgStart = log.find((e) => e.id === "fg");
|
||||
assert.ok(fgStart, "foreground task should have run");
|
||||
assert.ok(
|
||||
fgStart.time < 150,
|
||||
`foreground should start in the reserved slot (<150ms), got ${fgStart.time}ms`,
|
||||
);
|
||||
|
||||
await Promise.all(bgPromises);
|
||||
});
|
||||
|
||||
// SCN-nip07-foreground-uses-all-slots:
|
||||
// Given only foreground (NORMAL) work,
|
||||
// When two tasks are enqueued,
|
||||
// Then both run concurrently — the reservation does not throttle foreground.
|
||||
test("foreground work can still use every slot", async () => {
|
||||
let active = 0;
|
||||
let maxActive = 0;
|
||||
const task = (delay) => async () => {
|
||||
active += 1;
|
||||
maxActive = Math.max(maxActive, active);
|
||||
await new Promise((r) => setTimeout(r, delay));
|
||||
active -= 1;
|
||||
};
|
||||
|
||||
await Promise.all([
|
||||
runNip07WithRetry(task(80), { priority: NIP07_PRIORITY.NORMAL }),
|
||||
runNip07WithRetry(task(80), { priority: NIP07_PRIORITY.NORMAL }),
|
||||
]);
|
||||
|
||||
assert.equal(maxActive, 2, "two foreground tasks should run concurrently");
|
||||
});
|
||||
});
|
||||
Reference in new issue
Block a user