@effect-agent/pr-review 0.1.0-beta.26 → 0.1.0-beta.28

package/dist/{github-NjgxGqwM.mjs → github-CCuLgyqb.mjs}

@@ -670,13 +670,13 @@ const adjudicationIdentity = (adjudication) => adjudication.path !== void 0 && a
 const MAX_STORED_UNREVIEWED_PATHS = 100;
 /** Failed-pass records stored beside the leftover paths; one per unit stage. */
 const MAX_STORED_UNREVIEWED_PASSES = 24;
-/** Stages a leftover path may need retried without a second general discovery. */
+/** Stages a leftover path may need retried on the next incremental run. */
 const UnreviewedStage = Schema.Literals([
 	"discovery",
 	"specialist",
 	"verification"
 ]);
-/** One failed fan-out pass whose paths should be retried, not rediscovered. */
+/** One failed fan-out pass whose stage remains attached to its exact paths. */
 var StoredUnreviewedPass = class extends Schema.Class("@effect-agent/pr-review/StoredUnreviewedPass")({
 	stage: UnreviewedStage,
 	paths: Schema.Array(ChangedPath).check(Schema.isMinLength(1)).check(Schema.isMaxLength(12))
@@ -856,11 +856,25 @@ var ReviewHeadComparison = class extends Schema.Class("@effect-agent/pr-review/R
 	/** GitHub caps compare-file payloads at 300; equality is conservatively truncated. */
 	truncated: Schema.Boolean
 }) {};
+/**
+* Current and previous paths for 300 PR files plus bounded stored continuity
+* paths. The live adapter refuses a larger snapshot-comparison request.
+*/
+const MAX_TREE_COMPARISON_PATHS = 750;
+/** A direct comparison of two complete commit tree snapshots. */
+var ReviewTreeComparison = class extends Schema.Class("@effect-agent/pr-review/ReviewTreeComparison")({
+	baseSha: GitCommitSha,
+	headSha: GitCommitSha,
+	changedPaths: Schema.Array(ChangedPath).check(Schema.isMaxLength(750)),
+	/** True when GitHub returned either recursive tree incompletely. */
+	truncated: Schema.Boolean
+}) {};
 const fullReviewSelection = (input) => ({
 	mode: "full",
 	reason: input.reason,
 	files: input.files,
 	affectedPaths: input.files.flatMap((file) => file.previousPath === void 0 ? [file.path] : [file.path, file.previousPath]),
+	retryPasses: [],
 	retryPaths: [],
 	retryStages: [],
 	totalFiles: input.totalFiles,
@@ -886,7 +900,7 @@ const validateReviewState = (state, current, profileFingerprint) => {
 const filePaths = (file) => file.previousPath === void 0 ? [file.path] : [file.path, file.previousPath];
 const incrementalFromDelta = (input) => {
 	const currentPaths = new Set(input.fullFiles.flatMap(filePaths));
-	const affectedPaths = /* @__PURE__ */ new Set([...input.deltaFiles.flatMap(filePaths), ...input.extraAffectedPaths ?? []]);
+	const affectedPaths = /* @__PURE__ */ new Set([...input.deltaPaths, ...input.extraAffectedPaths ?? []]);
 	const initialAffectedCount = affectedPaths.size;
 	let expanded = true;
 	while (expanded) {
@@ -901,29 +915,43 @@ const incrementalFromDelta = (input) => {
 		}
 	}
 	const selectedByPath = /* @__PURE__ */ new Map();
-	for (const file of input.deltaFiles) if (currentPaths.has(file.path) || file.previousPath !== void 0 && currentPaths.has(file.previousPath)) selectedByPath.set(file.path, file);
 	const carriedPaths = input.priorState.unreviewedPaths.filter((path) => currentPaths.has(path));
 	const retryOnly = /* @__PURE__ */ new Set();
-	const retryStages = /* @__PURE__ */ new Set();
 	for (const path of carriedPaths) {
 		if (affectedPaths.has(path)) continue;
 		retryOnly.add(path);
-		for (const pass of input.priorState.unreviewedPasses) if (pass.paths.includes(path)) retryStages.add(pass.stage);
 	}
-	if (retryStages.has("verification") && !retryStages.has("discovery") && !retryStages.has("specialist")) {
-		retryStages.add("discovery");
-		retryStages.add("specialist");
+	const retryPathsByStage = /* @__PURE__ */ new Map();
+	const representedRetryPaths = /* @__PURE__ */ new Set();
+	for (const pass of input.priorState.unreviewedPasses) for (const path of pass.paths) {
+		if (!retryOnly.has(path)) continue;
+		const paths = retryPathsByStage.get(pass.stage) ?? /* @__PURE__ */ new Set();
+		paths.add(path);
+		retryPathsByStage.set(pass.stage, paths);
+		representedRetryPaths.add(path);
 	}
-	if (retryOnly.size > 0 && retryStages.size === 0) {
-		for (const path of retryOnly) affectedPaths.add(path);
-		retryStages.add("discovery");
-		retryStages.add("specialist");
-		retryStages.add("verification");
+	for (const path of retryOnly) {
+		if (representedRetryPaths.has(path)) continue;
+		retryOnly.delete(path);
+		affectedPaths.add(path);
 	}
+	const retryPasses = [
+		"discovery",
+		"specialist",
+		"verification"
+	].flatMap((stage) => {
+		const paths = [...retryPathsByStage.get(stage) ?? []].filter((path) => retryOnly.has(path)).sort();
+		return Array.from({ length: Math.ceil(paths.length / 12) }, (_, index) => StoredUnreviewedPass.make({
+			stage,
+			paths: paths.slice(index * 12, (index + 1) * 12)
+		}));
+	});
+	const retryPaths = [...retryOnly].sort();
+	const retryStages = [...new Set(retryPasses.map((pass) => pass.stage))];
 	for (const file of input.fullFiles) if (affectedPaths.has(file.path) || file.previousPath !== void 0 && affectedPaths.has(file.previousPath) || retryOnly.has(file.path) || file.previousPath !== void 0 && retryOnly.has(file.previousPath)) selectedByPath.set(file.path, file);
 	const selectedFiles = [...selectedByPath.values()].sort((left, right) => left.path < right.path ? -1 : left.path > right.path ? 1 : 0);
-	const leftoverCount = [...retryOnly].filter((path) => !affectedPaths.has(path)).length;
-	const carriedReason = leftoverCount > 0 ? `; retrying ${leftoverCount} unchanged leftover path(s) without rediscovery` : carriedPaths.length > 0 ? `; retrying ${carriedPaths.length} carried unreviewed path(s)` : "";
+	const leftoverCount = retryPaths.length;
+	const carriedReason = leftoverCount > 0 ? `; retrying ${leftoverCount} unchanged leftover path(s) by recorded failed stage` : carriedPaths.length > 0 ? `; retrying ${carriedPaths.length} carried unreviewed path(s)` : "";
 	const concernPathCount = affectedPaths.size - initialAffectedCount;
 	const concernReason = concernPathCount === 0 ? "" : `; reopening ${concernPathCount} related concern path(s) for context`;
 	return {
@@ -931,8 +959,9 @@ const incrementalFromDelta = (input) => {
 		reason: `${input.reason}${carriedReason}${concernReason}`,
 		files: selectedFiles,
 		affectedPaths: [...affectedPaths].sort(),
-		retryPaths: [...retryOnly].filter((path) => !affectedPaths.has(path)).sort(),
-		retryStages: [...retryStages].sort(),
+		retryPasses,
+		retryPaths,
+		retryStages,
 		totalFiles: selectedFiles.length,
 		baselineSha: input.priorState.reviewedHeadSha,
 		priorState: input.priorState,
@@ -964,24 +993,27 @@ const selectReviewRange = (input) => {
 			baseReason = `; base advanced from ${input.priorState.baseSha.slice(0, 7)} and overlapping PR paths were included`;
 		}
 		return incrementalFromDelta({
-			current: input.current,
 			fullFiles: input.fullFiles,
 			profileFingerprint: input.profileFingerprint,
 			priorState: input.priorState,
-			deltaFiles: comparison.files,
+			deltaPaths: comparison.files.flatMap(filePaths),
 			extraAffectedPaths: extraAffected,
 			reason: `changes since reviewed head ${input.priorState.reviewedHeadSha.slice(0, 7)}${baseReason}`
 		});
 	}
 	const contentComparison = input.contentComparison;
-	if (contentComparison !== void 0 && !contentComparison.truncated) return incrementalFromDelta({
-		current: input.current,
-		fullFiles: input.fullFiles,
-		profileFingerprint: input.profileFingerprint,
-		priorState: input.priorState,
-		deltaFiles: contentComparison.files,
-		reason: `rewritten history; contents changed since reviewed head ${input.priorState.reviewedHeadSha.slice(0, 7)}`
-	});
+	if (contentComparison !== void 0) {
+		if (contentComparison.baseSha !== input.priorState.reviewedHeadSha || contentComparison.headSha !== input.current.headSha) return full("the rewritten-head tree snapshot comparison did not match the requested heads");
+		if (contentComparison.truncated) return full("the rewritten-head tree snapshot comparison was truncated");
+		return incrementalFromDelta({
+			fullFiles: input.fullFiles,
+			profileFingerprint: input.profileFingerprint,
+			priorState: input.priorState,
+			deltaPaths: contentComparison.changedPaths,
+			reason: `rewritten history; contents changed since reviewed head ${input.priorState.reviewedHeadSha.slice(0, 7)}`
+		});
+	}
+	if (input.contentComparisonFailure !== void 0) return full(`the rewritten-head tree snapshot comparison failed: ${input.contentComparisonFailure.slice(0, 2048)}`);
 	if (comparison === void 0) return full("the incremental head comparison was unavailable");
 	if (comparison.truncated) return full("the incremental comparison exceeded GitHub's file bound");
 	return full("the prior reviewed head is not an ancestor of the current head");
@@ -2520,9 +2552,26 @@ const remapPlanUnitIds = (plan, offset) => {
 	});
 };
 const scheduleFanOutWork = (input) => {
-	const retryPathSet = new Set(input.retry?.paths ?? []);
-	const retryStages = new Set(input.retry?.stages ?? []);
-	if (retryPathSet.size === 0) {
+	const requestedRetryPasses = input.retry?.passes ?? input.retry?.stages?.map((stage) => ({
+		stage,
+		paths: input.retry?.paths ?? []
+	})) ?? [];
+	const requestedStagesByPath = /* @__PURE__ */ new Map();
+	for (const pass of requestedRetryPasses) for (const path of pass.paths) {
+		const stages = requestedStagesByPath.get(path) ?? /* @__PURE__ */ new Set();
+		stages.add(pass.stage);
+		requestedStagesByPath.set(path, stages);
+	}
+	const canonicalPathByKnownPath = /* @__PURE__ */ new Map();
+	const retryStagesByPath = /* @__PURE__ */ new Map();
+	for (const file of input.files) {
+		canonicalPathByKnownPath.set(file.path, file.path);
+		if (file.previousPath !== void 0) canonicalPathByKnownPath.set(file.previousPath, file.path);
+		const requested = [requestedStagesByPath.get(file.path), ...file.previousPath === void 0 ? [] : [requestedStagesByPath.get(file.previousPath)]];
+		const stages = new Set(requested.flatMap((entry) => [...entry ?? []]));
+		if (stages.size > 0) retryStagesByPath.set(file.path, stages);
+	}
+	if (retryStagesByPath.size === 0) {
 		const plan = planReviewUnits(input.files, { totalChangedFiles: input.totalChangedFiles });
 		const passesByUnit = /* @__PURE__ */ new Map();
 		for (const pass of plan.discoveryPasses) {
@@ -2533,39 +2582,67 @@ const scheduleFanOutWork = (input) => {
 		return {
 			plan,
 			passesByUnit,
-			overflowRetryPaths: []
+			overflowRetryPasses: []
 		};
 	}
-	const freshFiles = input.files.filter((file) => !retryPathSet.has(file.path));
-	const retryFiles = input.files.filter((file) => retryPathSet.has(file.path));
-	const freshPlan = planReviewUnits(freshFiles, { totalChangedFiles: input.totalChangedFiles });
-	const retryPlan = remapPlanUnitIds(planReviewUnits(retryFiles, { totalChangedFiles: input.totalChangedFiles }), freshPlan.units.length);
-	const acceptedFresh = freshPlan.units.slice(0, 8);
-	const acceptedRetry = retryPlan.units.slice(0, Math.max(0, 8 - acceptedFresh.length));
-	const overflowRetryPaths = retryPlan.units.slice(acceptedRetry.length).flatMap((unit) => [...unit.paths]);
-	const retryPassFilter = (pass) => {
-		const stage = pass.perspective === "risk-specialist" ? "specialist" : "discovery";
-		return retryStages.has(stage);
+	const discoveryStagesFor = (stages) => {
+		if (stages.has("verification")) return ["discovery", "specialist"];
+		return [...stages.has("discovery") ? ["discovery"] : [], ...stages.has("specialist") ? ["specialist"] : []];
 	};
-	const acceptedRetryIds = new Set(acceptedRetry.map((unit) => unit.unitId));
-	let retryPasses = retryPlan.discoveryPasses.filter((pass) => acceptedRetryIds.has(pass.unitId) && retryPassFilter(pass));
-	if (retryStages.has("verification") && !retryStages.has("discovery") && !retryStages.has("specialist")) retryPasses = retryPlan.discoveryPasses.filter((pass) => acceptedRetryIds.has(pass.unitId));
-	const acceptedFreshIds = new Set(acceptedFresh.map((unit) => unit.unitId));
-	const discoveryPasses = [...freshPlan.discoveryPasses.filter((pass) => acceptedFreshIds.has(pass.unitId)), ...retryPasses];
+	const freshFiles = input.files.filter((file) => !retryStagesByPath.has(file.path));
+	const retryGroups = /* @__PURE__ */ new Map();
+	for (const file of input.files) {
+		const retryStages = retryStagesByPath.get(file.path);
+		if (retryStages === void 0) continue;
+		const stages = discoveryStagesFor(retryStages);
+		const key = stages.join("|");
+		const group = retryGroups.get(key) ?? {
+			stages,
+			files: []
+		};
+		group.files.push(file);
+		retryGroups.set(key, group);
+	}
+	const batches = [...freshFiles.length === 0 ? [] : [{
+		stages: ["discovery", "specialist"],
+		files: freshFiles
+	}], ...[...retryGroups.entries()].sort(([left], [right]) => left < right ? -1 : left > right ? 1 : 0).map(([, group]) => group)];
+	const subplans = [];
+	const acceptedUnits = [];
+	const rejectedUnits = [];
+	const discoveryPasses = [];
+	for (const batch of batches) {
+		const batchPlan = remapPlanUnitIds(planReviewUnits(batch.files, { totalChangedFiles: batch.files.length }), acceptedUnits.length);
+		subplans.push(batchPlan);
+		const accepted = batchPlan.units.slice(0, Math.max(0, 8 - acceptedUnits.length));
+		acceptedUnits.push(...accepted);
+		rejectedUnits.push(...batchPlan.units.slice(accepted.length));
+		const acceptedIds = new Set(accepted.map((unit) => unit.unitId));
+		discoveryPasses.push(...batchPlan.discoveryPasses.filter((pass) => {
+			const stage = pass.perspective === "risk-specialist" ? "specialist" : "discovery";
+			return acceptedIds.has(pass.unitId) && batch.stages.includes(stage);
+		}));
+	}
+	const acceptedPaths = new Set(acceptedUnits.flatMap((unit) => unit.paths));
+	const incompletePlannedPaths = /* @__PURE__ */ new Set([
+		...subplans.flatMap((plan) => plan.partialEvidencePaths),
+		...subplans.flatMap((plan) => plan.unassignedPaths),
+		...rejectedUnits.flatMap((unit) => unit.paths)
+	]);
+	const partialEvidencePaths = [...incompletePlannedPaths].filter((path) => acceptedPaths.has(path)).sort();
+	const unassignedPaths = [...incompletePlannedPaths].filter((path) => !acceptedPaths.has(path)).sort();
+	const rejectedEvidenceShards = rejectedUnits.flatMap((unit) => unit.evidenceShards);
+	const undiffablePaths = [...new Set(subplans.flatMap((plan) => plan.undiffablePaths))].sort();
 	const plan = ReviewUnitPlan.make({
 		totalFiles: input.files.length,
-		truncated: freshPlan.truncated || retryPlan.truncated,
-		units: [...acceptedFresh, ...acceptedRetry],
+		truncated: input.files.length < input.totalChangedFiles,
+		units: acceptedUnits,
 		discoveryPasses,
-		undiffablePaths: [.../* @__PURE__ */ new Set([...freshPlan.undiffablePaths, ...retryPlan.undiffablePaths])].sort(),
-		partialEvidencePaths: [.../* @__PURE__ */ new Set([...freshPlan.partialEvidencePaths, ...retryPlan.partialEvidencePaths])].sort(),
-		unassignedEvidenceShardCount: freshPlan.unassignedEvidenceShardCount + retryPlan.unassignedEvidenceShardCount,
-		unassignedEvidenceShardIds: [...freshPlan.unassignedEvidenceShardIds, ...retryPlan.unassignedEvidenceShardIds].slice(0, 96),
-		unassignedPaths: [.../* @__PURE__ */ new Set([
-			...freshPlan.unassignedPaths,
-			...retryPlan.unassignedPaths,
-			...overflowRetryPaths
-		])].sort()
+		undiffablePaths,
+		partialEvidencePaths,
+		unassignedEvidenceShardCount: subplans.reduce((total, item) => total + item.unassignedEvidenceShardCount, 0) + rejectedEvidenceShards.length,
+		unassignedEvidenceShardIds: [...subplans.flatMap((item) => item.unassignedEvidenceShardIds), ...rejectedEvidenceShards.map((shard) => shard.shardId)].slice(0, 96),
+		unassignedPaths
 	});
 	const passesByUnit = /* @__PURE__ */ new Map();
 	for (const pass of discoveryPasses) {
@@ -2573,10 +2650,33 @@ const scheduleFanOutWork = (input) => {
 		passes.push(pass);
 		passesByUnit.set(pass.unitId, passes);
 	}
+	const incompletePaths = /* @__PURE__ */ new Set([
+		...partialEvidencePaths,
+		...unassignedPaths,
+		...undiffablePaths
+	]);
+	const overflowRetryPathsByStage = /* @__PURE__ */ new Map();
+	for (const pass of requestedRetryPasses) for (const path of pass.paths) {
+		const canonicalPath = canonicalPathByKnownPath.get(path);
+		if (canonicalPath === void 0 || !incompletePaths.has(canonicalPath)) continue;
+		const paths = overflowRetryPathsByStage.get(pass.stage) ?? /* @__PURE__ */ new Set();
+		paths.add(canonicalPath);
+		overflowRetryPathsByStage.set(pass.stage, paths);
+	}
 	return {
 		plan,
 		passesByUnit,
-		overflowRetryPaths
+		overflowRetryPasses: [
+			"discovery",
+			"specialist",
+			"verification"
+		].flatMap((stage) => {
+			const paths = [...overflowRetryPathsByStage.get(stage) ?? []].sort();
+			return Array.from({ length: Math.ceil(paths.length / 12) }, (_, index) => ({
+				stage,
+				paths: paths.slice(index * 12, (index + 1) * 12)
+			}));
+		})
 	};
 };
 /**
@@ -2586,7 +2686,7 @@ const scheduleFanOutWork = (input) => {
 * only. The verdict is derived from confirmed severities, never model prose.
 */
 const runFanOutReview = (binding, input) => Effect.gen(function* () {
-	const { plan, passesByUnit, overflowRetryPaths } = scheduleFanOutWork(input);
+	const { plan, passesByUnit, overflowRetryPasses } = scheduleFanOutWork(input);
 	const outcomes = yield* Effect.forEach(plan.units, (unit) => reviewUnit(binding, unit, passesByUnit.get(unit.unitId) ?? [], input), { concurrency: 4 });
 	const failedPasses = outcomes.flatMap((outcome) => outcome.failedPasses);
 	const unsettledCandidates = outcomes.reduce((total, outcome) => total + outcome.unsettledCandidates, 0);
@@ -2634,14 +2734,7 @@ const runFanOutReview = (binding, input) => Effect.gen(function* () {
 			...plan.partialEvidencePaths,
 			...plan.undiffablePaths
 		])].sort(),
-		unreviewedPasses: [...outcomes.flatMap((outcome) => outcome.unreviewedPasses), ...overflowRetryPaths.length === 0 ? [] : (input.retry?.stages.length ? input.retry.stages : [
-			"discovery",
-			"specialist",
-			"verification"
-		]).map((stage) => ({
-			stage,
-			paths: overflowRetryPaths
-		}))],
+		unreviewedPasses: [...outcomes.flatMap((outcome) => outcome.unreviewedPasses), ...overflowRetryPasses],
 		turns: outcomes.reduce((total, outcome) => total + outcome.turns, 0)
 	};
 });
@@ -3183,6 +3276,41 @@ const GitHubCompareWire = Schema.Struct({
 	merge_base_commit: Schema.Struct({ sha: Schema.String }),
 	files: GitHubFilesPageWire
 });
+const GitHubGitCommitWire = Schema.Struct({
+	sha: GitCommitSha,
+	tree: Schema.Struct({ sha: GitCommitSha })
+});
+const GitHubTreeEntryFields = {
+	path: Schema.String.check(Schema.isMaxLength(4096)),
+	sha: GitCommitSha
+};
+const GitHubTreeEntryWire = Schema.Union([
+	Schema.Struct({
+		...GitHubTreeEntryFields,
+		mode: Schema.Literals([
+			"100644",
+			"100755",
+			"120000"
+		]),
+		type: Schema.Literal("blob")
+	}),
+	Schema.Struct({
+		...GitHubTreeEntryFields,
+		mode: Schema.Literal("040000"),
+		type: Schema.Literal("tree")
+	}),
+	Schema.Struct({
+		...GitHubTreeEntryFields,
+		mode: Schema.Literal("160000"),
+		type: Schema.Literal("commit")
+	})
+]);
+const GitHubTreeWire = Schema.Struct({
+	sha: GitCommitSha,
+	tree: Schema.Array(GitHubTreeEntryWire).check(Schema.isMaxLength(1e5)),
+	truncated: Schema.Boolean
+});
+const TreeComparisonPaths = Schema.Array(ChangedPath).check(Schema.isMaxLength(750));
 /** Reviews are paged chronologically; scanning stays bounded. */
 const MAX_PRIOR_REVIEW_PAGES = 5;
 /** GitHub-backed PriorReviews over the pull-request reviews endpoint. */
@@ -3193,6 +3321,11 @@ const gitHubPriorReviewsLayer = Layer.effect(PriorReviews)(Effect.gen(function*
 	const reviewAuthorLogin = target.reviewAuthorLogin ?? "github-actions[bot]";
 	const decodePage = Schema.decodeUnknownEffect(GitHubPriorReviewsPageWire);
 	const asLookupFailure = (error) => PriorReviewLookupFailure.make({ reason: `${error._tag}: ${error.message ?? "request failed"}`.slice(0, 2048) });
+	const asTreeLookupFailure = (operation) => (error) => PriorReviewLookupFailure.make({ reason: `${operation}: ${error._tag}: ${error.message ?? "request failed"}`.slice(0, 2048) });
+	const decodeLookupJson = (schema, operation) => {
+		const decode = Schema.decodeUnknownEffect(schema);
+		return (response) => response.json.pipe(Effect.mapError(asTreeLookupFailure(operation)), Effect.flatMap((body) => decode(body).pipe(Effect.mapError(asTreeLookupFailure(operation)))));
+	};
 	const readMarkers = (authenticator) => Effect.gen(function* () {
 		const perPage = 100;
 		let latest = Option.none();
@@ -3219,8 +3352,8 @@ const gitHubPriorReviewsLayer = Layer.effect(PriorReviews)(Effect.gen(function*
 			latestState
 		};
 	}).pipe(Effect.provideService(HttpClient.HttpClient, client));
-	const compareCommits = (baseSha, headSha, separator) => Effect.gen(function* () {
-		const wire = yield* (yield* HttpClient.execute(withCommonHeaders(HttpClientRequest.get(`${target.apiUrl}/repos/${target.repository}/compare/${encodeURIComponent(baseSha)}${separator}${encodeURIComponent(headSha)}`).pipe(HttpClientRequest.acceptJson), target.token)).pipe(Effect.flatMap(HttpClientResponse.filterStatusOk), Effect.mapError(asLookupFailure))).json.pipe(Effect.mapError(asLookupFailure), Effect.flatMap((body) => Schema.decodeUnknownEffect(GitHubCompareWire)(body).pipe(Effect.mapError(asLookupFailure))));
+	const compareCommits = (baseSha, headSha) => Effect.gen(function* () {
+		const wire = yield* (yield* HttpClient.execute(withCommonHeaders(HttpClientRequest.get(`${target.apiUrl}/repos/${target.repository}/compare/${encodeURIComponent(baseSha)}...${encodeURIComponent(headSha)}`).pipe(HttpClientRequest.acceptJson), target.token)).pipe(Effect.flatMap(HttpClientResponse.filterStatusOk), Effect.mapError(asLookupFailure))).json.pipe(Effect.mapError(asLookupFailure), Effect.flatMap((body) => Schema.decodeUnknownEffect(GitHubCompareWire)(body).pipe(Effect.mapError(asLookupFailure))));
 		const files = wire.files.map(toChangedFile);
 		return ReviewHeadComparison.make({
 			status: wire.status,
@@ -3231,21 +3364,61 @@ const gitHubPriorReviewsLayer = Layer.effect(PriorReviews)(Effect.gen(function*
 			truncated: files.length >= 300
 		});
 	}).pipe(Effect.provideService(HttpClient.HttpClient, client));
-	const compareTrees = (baseSha, headSha) => compareCommits(baseSha, headSha, "..").pipe(Effect.map((comparison) => ReviewHeadComparison.make({
-		status: comparison.status === "identical" ? "identical" : "ahead",
-		baseSha,
-		headSha,
-		mergeBaseSha: baseSha,
-		files: comparison.files,
-		truncated: comparison.truncated
-	})));
+	const readTreeSnapshot = Effect.fn("PriorReviews.readTreeSnapshot")(function* (commitSha) {
+		const commitResponse = yield* client.execute(withCommonHeaders(HttpClientRequest.get(`${target.apiUrl}/repos/${target.repository}/git/commits/${encodeURIComponent(commitSha)}`).pipe(HttpClientRequest.acceptJson), target.token)).pipe(Effect.flatMap(HttpClientResponse.filterStatusOk), Effect.mapError(asTreeLookupFailure("get Git commit")));
+		const commit = yield* decodeLookupJson(GitHubGitCommitWire, "decode Git commit")(commitResponse);
+		if (commit.sha !== commitSha) return yield* PriorReviewLookupFailure.make({ reason: `GitHub returned commit ${commit.sha} for requested snapshot ${commitSha}` });
+		const treeResponse = yield* client.execute(withCommonHeaders(HttpClientRequest.get(`${target.apiUrl}/repos/${target.repository}/git/trees/${encodeURIComponent(commit.tree.sha)}`).pipe(HttpClientRequest.acceptJson, HttpClientRequest.setUrlParams({ recursive: "1" })), target.token)).pipe(Effect.flatMap(HttpClientResponse.filterStatusOk), Effect.mapError(asTreeLookupFailure("get recursive Git tree")));
+		const tree = yield* decodeLookupJson(GitHubTreeWire, "decode recursive Git tree")(treeResponse);
+		if (tree.sha !== commit.tree.sha) return yield* PriorReviewLookupFailure.make({ reason: `GitHub returned tree ${tree.sha} for requested tree ${commit.tree.sha}` });
+		const entries = /* @__PURE__ */ new Map();
+		for (const entry of tree.tree) {
+			if (entries.has(entry.path)) return yield* PriorReviewLookupFailure.make({ reason: `GitHub returned duplicate path '${entry.path}' in tree ${tree.sha}` });
+			entries.set(entry.path, entry);
+		}
+		return {
+			entries,
+			truncated: tree.truncated
+		};
+	});
+	const compareTrees = Effect.fn("PriorReviews.compareTrees")(function* (baseSha, headSha, paths) {
+		const decodeSha = Schema.decodeUnknownEffect(GitCommitSha);
+		const [validatedBaseSha, validatedHeadSha, validatedPaths] = yield* Effect.all([
+			decodeSha(baseSha),
+			decodeSha(headSha),
+			Schema.decodeUnknownEffect(TreeComparisonPaths)(paths)
+		]).pipe(Effect.mapError(asTreeLookupFailure("validate tree comparison request")));
+		const uniquePaths = [...new Set(validatedPaths)].sort();
+		const { base, head } = yield* Effect.all({
+			base: readTreeSnapshot(validatedBaseSha),
+			head: readTreeSnapshot(validatedHeadSha)
+		}, { concurrency: 2 });
+		if (base.truncated || head.truncated) return ReviewTreeComparison.make({
+			baseSha: validatedBaseSha,
+			headSha: validatedHeadSha,
+			changedPaths: [],
+			truncated: true
+		});
+		const changedPaths = uniquePaths.filter((path) => {
+			const before = base.entries.get(path);
+			const after = head.entries.get(path);
+			if (before === void 0 || after === void 0) return before !== after;
+			return before.sha !== after.sha || before.mode !== after.mode || before.type !== after.type;
+		});
+		return ReviewTreeComparison.make({
+			baseSha: validatedBaseSha,
+			headSha: validatedHeadSha,
+			changedPaths,
+			truncated: false
+		});
+	});
 	return PriorReviews.of({
 		latestFingerprint: readMarkers(Option.none()).pipe(Effect.map((markers) => markers.latestFingerprint)),
 		latestState: Effect.gen(function* () {
 			const authenticator = yield* ReviewStateAuthenticator;
 			return yield* readMarkers(Option.some(authenticator)).pipe(Effect.map((markers) => markers.latestState));
 		}),
-		compareHeads: (baseSha, headSha) => compareCommits(baseSha, headSha, "..."),
+		compareHeads: compareCommits,
 		compareTrees
 	});
 }));
@@ -3259,6 +3432,6 @@ const fingerprintUnchanged = (current) => Effect.gen(function* () {
 	return Option.isSome(latest) && latest.value === current;
 });
 //#endregion
-export { ReviewDiscoveryPass as $, ReviewFinding as $n, MAX_STORED_ADJUDICATIONS as $t, MAX_CHILD_FINDINGS as A, validateReviewState as An, parsePatch as Ar, buildPriorReviewContext as At, assessmentSettlesSuggestionExactly as B, FindingSeverity as Bn, threadFindingTarget as Bt, FileReviewBrief as C, fullReviewSelection as Cn, ChangedFileStatus as Cr, anchorViolation as Ct, FileReviewer as D, toStoredConcern as Dn, commentableLines as Dr, MAX_THREAD_ADJUDICATION_COMMANDS as Dt, FileReviewToolkit as E, selectedPullRequestSourceLayer as En, annotatePatch as Er, AdjudicationComment as Et, ReviewCandidate as F, FileDiffQuery as Fn, noReviewAdjudicationHostLayer as Ft, makeFileReviewerInstructions as G, MAX_PATCH_CHARS as Gn, ReviewRetirementHost as Gt, defaultFileReviewerPolicy as H, ListChangedFilesQuery as Hn, RetirableReview as Ht, ReviewCandidateId as I, FileDiffView as In, parseIssueAdjudication as It, MAX_MERGED_FINDINGS as J, PullRequestReviewer as Jn, hasReviewMetadataMarker as Jt, reviewCandidateSubjectKey as K, MAX_WALKTHROUGH_ENTRIES as Kn, ReviewRetirementReport as Kt, ReviewPassMisbehaved as L, FileSlice as Ln, parseThreadAdjudication as Lt, MAX_REVIEW_CHILDREN as M, ChangedFileSummary as Mn, deriveAdjudications as Mt, MAX_UNIT_CANDIDATES as N, ChangedFilesView as Nn, mergeAdjudications as Nt, FindingCandidate as O, toStoredFinding as On, hasReviewableContent as Or, ReviewAdjudicationFailure as Ot, REVIEW_UNIT_CONCURRENCY as P, CodeReview as Pn, noReviewAdjudicationHost as Pt, MAX_UNIT_FILES as Q, ReviewConcern as Qn, MAX_REVIEW_STATE_MARKER_CHARS as Qt, ReviewWorkPerspective as R, FileSliceQuery as Rn, renderAdjudicationContextLine as Rt, DiscoveredConcern as S, fullReviewExecutionContextLayer as Sn, ChangedFile as Sr, splitCarriedScope as St, FileReviewReport as T, selectReviewRange as Tn, MAX_REVIEW_CONTENT_CHARS as Tr, AdjudicableThread as Tt, fileReviewerInstructions as U, MAX_CONCERNS as Un, RetirableReviewComment as Ut, confirmedFindingForPublication as V, ListChangedFiles as Vn, INLINE_FINDING_TITLE_PATTERN as Vt, makeFileReviewerDefinition as W, MAX_FINDINGS as Wn, ReviewRetirementFailure as Wt, MAX_REVIEW_UNITS as X, ReadFile as Xn, AdjudicationDisposition as Xt, MAX_REPORTED_UNASSIGNED_EVIDENCE_SHARDS as Y, REVIEW_TOOL_RESULT_MAX_BYTES as Yn, retireStaleReviews as Yt, MAX_UNIT_EVIDENCE_SHARDS as Z, ReadFileDiff as Zn, GitCommitSha as Zt, computeProfileFingerprint as _, buildProfileMission as _n, PullRequestMetadata as _r, ReviewInputCoverage as _t, PriorReviews as a, ReviewScopeMode as an, clampMaxFindings as ar, ReviewUnit as at, CandidateAssessment as b, fromStoredConcern as bn, ReviewInputViolation as br, fanOutInputCoverage as bt, fingerprintUnchanged as c, ReviewStateAuthenticator as cn, fileReviewEvidenceChunks as cr, UNIT_EVIDENCE_CHAR_BUDGET as ct, gitHubReviewAdjudicationHostLayer as d, StoredAdjudication as dn, readFileDiffHandler as dr, planReviewUnits as dt, MAX_STORED_UNREVIEWED_PASSES as en, ReviewMission as er, ReviewDiscoveryPerspective as et, gitHubReviewPublisherLayer as f, StoredReviewConcern as fn, readFileHandler as fr, rankAndDedupeConcerns as ft, computeChangesetFingerprint as g, adjudicationIdentity as gn, MAX_FILE_CHARS as gr, ReviewAssurance as gt, FINGERPRINT_MARKER_LENGTH as h, UnreviewedStage as hn, MAX_CHANGED_FILES as hr, FailedReviewPass as ht, PriorReviewLookupFailure as i, ReviewMode as in, WalkthroughEntry as ir, ReviewRiskCategory as it, MAX_FILE_REVIEW_TOOL_CALLS as j, webCryptoReviewStateAuthenticatorLayer as jn, renderReviewContent as jr, collectReviewAdjudications as jt, MAX_CHILD_CONCERNS as k, unavailableReviewStateAuthenticatorLayer as kn, isReviewableFile as kr, ReviewAdjudicationHost as kt, gitHubPriorReviewsLayer as l, ReviewStateMarker as ln, listChangedFilesHandler as lr, classifyReviewRisks as lt, parseGitHubSubmittedAt as m, StoredUnreviewedPass as mn, reviewInstructions as mr, reviewConcernKey as mt, GitHubApiFailure as n, ReviewExecutionContext as nn, ReviewToolkitLayer as nr, ReviewEvidenceShardId as nt, PublishedReview as o, ReviewState as on, defaultReviewPolicy as or, ReviewUnitId as ot, gitHubReviewRetirementHostLayer as p, StoredReviewFinding as pn, resolveGuidance as pr, rankAndDedupeFindings as pt, runFanOutReview as q, MAX_WALKTHROUGH_SUMMARY_CHARS as qn, decideReviewRetirement as qt, GitHubReviewTarget as r, ReviewHeadComparison as rn, ReviewVerdict as rr, ReviewPassId as rt, ReviewPublisher as s, ReviewStateAuthenticationFailure as sn, fileDiffView as sr, ReviewUnitPlan as st, DEFAULT_GITHUB_REVIEW_AUTHOR_LOGIN as t, MAX_STORED_UNREVIEWED_PATHS as tn, ReviewToolkit as tr, ReviewEvidenceShard as tt, gitHubPullRequestSourceLayer as u, ReviewStateMarkerTooLarge as un, makeReviewInstructions as ur, findingAnchorInUnitEvidence as ut, extractFingerprint as v, concernIdentity as vn, PullRequestSource as vr, assessFlatReview as vt, FileReviewEvidence as w, isLineageAncestor as wn, ChangedPath as wr, AUTHORIZED_ADJUDICATION_ASSOCIATIONS as wt, ConcernCandidate as x, fromStoredFinding as xn, normalizeRepoRelativePath as xr, flatAssurance as xt, renderFingerprintMarker as y, findingIdentity as yn, PullRequestSourceFailure as yr, boundedListReason as yt, ReviewWorkPhase as z, FindingCategory as zn, renderPriorFindingContextLine as zt };
+export { ReviewDiscoveryPass as $, ReadFileDiff as $n, MAX_STORED_ADJUDICATIONS as $t, MAX_CHILD_FINDINGS as A, toStoredFinding as An, hasReviewableContent as Ar, buildPriorReviewContext as At, assessmentSettlesSuggestionExactly as B, FileSliceQuery as Bn, threadFindingTarget as Bt, FileReviewBrief as C, fromStoredFinding as Cn, normalizeRepoRelativePath as Cr, anchorViolation as Ct, FileReviewer as D, selectReviewRange as Dn, MAX_REVIEW_CONTENT_CHARS as Dr, MAX_THREAD_ADJUDICATION_COMMANDS as Dt, FileReviewToolkit as E, isLineageAncestor as En, ChangedPath as Er, AdjudicationComment as Et, ReviewCandidate as F, ChangedFilesView as Fn, noReviewAdjudicationHostLayer as Ft, makeFileReviewerInstructions as G, MAX_CONCERNS as Gn, ReviewRetirementHost as Gt, defaultFileReviewerPolicy as H, FindingSeverity as Hn, RetirableReview as Ht, ReviewCandidateId as I, CodeReview as In, parseIssueAdjudication as It, MAX_MERGED_FINDINGS as J, MAX_WALKTHROUGH_ENTRIES as Jn, hasReviewMetadataMarker as Jt, reviewCandidateSubjectKey as K, MAX_FINDINGS as Kn, ReviewRetirementReport as Kt, ReviewPassMisbehaved as L, FileDiffQuery as Ln, parseThreadAdjudication as Lt, MAX_REVIEW_CHILDREN as M, validateReviewState as Mn, parsePatch as Mr, deriveAdjudications as Mt, MAX_UNIT_CANDIDATES as N, webCryptoReviewStateAuthenticatorLayer as Nn, renderReviewContent as Nr, mergeAdjudications as Nt, FindingCandidate as O, selectedPullRequestSourceLayer as On, annotatePatch as Or, ReviewAdjudicationFailure as Ot, REVIEW_UNIT_CONCURRENCY as P, ChangedFileSummary as Pn, noReviewAdjudicationHost as Pt, MAX_UNIT_FILES as Q, ReadFile as Qn, MAX_REVIEW_STATE_MARKER_CHARS as Qt, ReviewWorkPerspective as R, FileDiffView as Rn, renderAdjudicationContextLine as Rt, DiscoveredConcern as S, fromStoredConcern as Sn, ReviewInputViolation as Sr, splitCarriedScope as St, FileReviewReport as T, fullReviewSelection as Tn, ChangedFileStatus as Tr, AdjudicableThread as Tt, fileReviewerInstructions as U, ListChangedFiles as Un, RetirableReviewComment as Ut, confirmedFindingForPublication as V, FindingCategory as Vn, INLINE_FINDING_TITLE_PATTERN as Vt, makeFileReviewerDefinition as W, ListChangedFilesQuery as Wn, ReviewRetirementFailure as Wt, MAX_REVIEW_UNITS as X, PullRequestReviewer as Xn, AdjudicationDisposition as Xt, MAX_REPORTED_UNASSIGNED_EVIDENCE_SHARDS as Y, MAX_WALKTHROUGH_SUMMARY_CHARS as Yn, retireStaleReviews as Yt, MAX_UNIT_EVIDENCE_SHARDS as Z, REVIEW_TOOL_RESULT_MAX_BYTES as Zn, GitCommitSha as Zt, computeProfileFingerprint as _, UnreviewedStage as _n, MAX_CHANGED_FILES as _r, ReviewInputCoverage as _t, PriorReviews as a, ReviewMode as an, ReviewVerdict as ar, ReviewUnit as at, CandidateAssessment as b, concernIdentity as bn, PullRequestSource as br, fanOutInputCoverage as bt, fingerprintUnchanged as c, ReviewStateAuthenticationFailure as cn, defaultReviewPolicy as cr, UNIT_EVIDENCE_CHAR_BUDGET as ct, gitHubReviewAdjudicationHostLayer as d, ReviewStateMarkerTooLarge as dn, listChangedFilesHandler as dr, planReviewUnits as dt, MAX_STORED_UNREVIEWED_PASSES as en, ReviewConcern as er, ReviewDiscoveryPerspective as et, gitHubReviewPublisherLayer as f, ReviewTreeComparison as fn, makeReviewInstructions as fr, rankAndDedupeConcerns as ft, computeChangesetFingerprint as g, StoredUnreviewedPass as gn, reviewInstructions as gr, ReviewAssurance as gt, FINGERPRINT_MARKER_LENGTH as h, StoredReviewFinding as hn, resolveGuidance as hr, FailedReviewPass as ht, PriorReviewLookupFailure as i, ReviewHeadComparison as in, ReviewToolkitLayer as ir, ReviewRiskCategory as it, MAX_FILE_REVIEW_TOOL_CALLS as j, unavailableReviewStateAuthenticatorLayer as jn, isReviewableFile as jr, collectReviewAdjudications as jt, MAX_CHILD_CONCERNS as k, toStoredConcern as kn, commentableLines as kr, ReviewAdjudicationHost as kt, gitHubPriorReviewsLayer as l, ReviewStateAuthenticator as ln, fileDiffView as lr, classifyReviewRisks as lt, parseGitHubSubmittedAt as m, StoredReviewConcern as mn, readFileHandler as mr, reviewConcernKey as mt, GitHubApiFailure as n, MAX_TREE_COMPARISON_PATHS as nn, ReviewMission as nr, ReviewEvidenceShardId as nt, PublishedReview as o, ReviewScopeMode as on, WalkthroughEntry as or, ReviewUnitId as ot, gitHubReviewRetirementHostLayer as p, StoredAdjudication as pn, readFileDiffHandler as pr, rankAndDedupeFindings as pt, runFanOutReview as q, MAX_PATCH_CHARS as qn, decideReviewRetirement as qt, GitHubReviewTarget as r, ReviewExecutionContext as rn, ReviewToolkit as rr, ReviewPassId as rt, ReviewPublisher as s, ReviewState as sn, clampMaxFindings as sr, ReviewUnitPlan as st, DEFAULT_GITHUB_REVIEW_AUTHOR_LOGIN as t, MAX_STORED_UNREVIEWED_PATHS as tn, ReviewFinding as tr, ReviewEvidenceShard as tt, gitHubPullRequestSourceLayer as u, ReviewStateMarker as un, fileReviewEvidenceChunks as ur, findingAnchorInUnitEvidence as ut, extractFingerprint as v, adjudicationIdentity as vn, MAX_FILE_CHARS as vr, assessFlatReview as vt, FileReviewEvidence as w, fullReviewExecutionContextLayer as wn, ChangedFile as wr, AUTHORIZED_ADJUDICATION_ASSOCIATIONS as wt, ConcernCandidate as x, findingIdentity as xn, PullRequestSourceFailure as xr, flatAssurance as xt, renderFingerprintMarker as y, buildProfileMission as yn, PullRequestMetadata as yr, boundedListReason as yt, ReviewWorkPhase as z, FileSlice as zn, renderPriorFindingContextLine as zt };
 
-//# sourceMappingURL=github-NjgxGqwM.mjs.map
+//# sourceMappingURL=github-CCuLgyqb.mjs.map