// Check for leakage: child2 should NOT have child1's repository
            boolean child2HasChild1Repo = child2Project.getRemoteArtifactRepositories().stream()
                    .anyMatch(repo -> "child1-repo".equals(repo.getId()));
            assertFalse(child2HasChild1Repo, "Child2 should NOT have child1's repository (leakage detected!)");

            // Check for leakage in the shared request

        private final ModelBuilder.ModelBuilderSession modelBuilderSession;
        private final Map<String, MavenProject> projectIndex = new ConcurrentHashMap<>(256);

        // Store computed repositories per project to avoid leakage between projects
        private final Map<String, List<ArtifactRepository>> projectRepositories = new ConcurrentHashMap<>();

        /**

= p - q diff.ExpandFor(p).Sub(qP, p) } // A tiny bit of leakage is acceptable because it's not adaptive, an // attacker only learns the magnitude of p - q. if diff.BitLenVarTime() <= N.BitLen()/2-100 { return errors.New("crypto/rsa: |p - q| too small") } // Check that d > 2^(nlen/2). // // See section 3 of https://crypto.stanford.edu/~dabo/papers/RSA-survey.pdf // for more details about attacks on small d values. // // Likewise, the leakage of the magnitude of d is not adaptive. if priv.d.BitLenVarTime()...

= p - q diff.ExpandFor(p).Sub(qP, p) } // A tiny bit of leakage is acceptable because it's not adaptive, an // attacker only learns the magnitude of p - q. if diff.BitLenVarTime() <= N.BitLen()/2-100 { return errors.New("crypto/rsa: |p - q| too small") } // Check that d > 2^(nlen/2). // // See section 3 of https://crypto.stanford.edu/~dabo/papers/RSA-survey.pdf // for more details about attacks on small d values. // // Likewise, the leakage of the magnitude of d is not adaptive. if priv.d.BitLenVarTime()...