@@ -145,7 +145,7 @@ const findIntersections = (setsByKey, options) => {
  * @property {Map<bigint, Set<T>[]>} intersectionsByOriginalKey additional subsets by original set key
  * @property {number} checks the number of possible containing sets checked
  * @property {number} comparisons the maximum number of membership checks performed
- * @property {number} expansions the weighted number of downstream visits
+ * @property {number} expansions the weighted number of downstream item visits
  * @property {boolean} limited whether propagation reached a limit
  */
 
@@ -230,9 +230,12 @@ const associateIntersections = (
 			checks++;
 			comparisons += intersection.size;
 			if (isSubset(original, intersection)) {
+				// Each module occurrence can visit every selected chunk, including
+				// calls through a configured chunks filter.
 				const weightedExpansions =
 					candidateExpansions +
-					/** @type {number} */ (originalWeightsByKey.get(key));
+					/** @type {number} */ (originalWeightsByKey.get(key)) *
+						intersection.size;
 				if (expansions + weightedExpansions > maximumExpansions) {
 					limited = true;
 					break search;
 
@@ -155,15 +155,15 @@ describe("SetHelpers", () => {
 				{
 					maximumChecks: 10,
 					maximumComparisons: 10,
-					maximumExpansions: 10
+					maximumExpansions: 20
 				}
 			);
 			expect(result.intersectionsByOriginalKey.get(matchingKey)).toEqual([
 				new Set([1, 2])
 			]);
 			expect(result.checks).toBe(1);
 			expect(result.comparisons).toBe(2);
-			expect(result.expansions).toBe(7);
+			expect(result.expansions).toBe(14);
 			expect(result.limited).toBe(false);
 		});
 
@@ -181,7 +181,7 @@ describe("SetHelpers", () => {
 				{
 					maximumChecks: 10,
 					maximumComparisons: 10,
-					maximumExpansions: 1
+					maximumExpansions: 2
 				}
 			);
 			expect(result.intersectionsByOriginalKey.size).toBe(0);