diff --git a/src/benchmarks/corefx/Common/UniqueValuesGenerator.cs b/src/benchmarks/corefx/Common/UniqueValuesGenerator.cs
index 0ce2dcb6952..fcf006a8a47 100644
--- a/src/benchmarks/corefx/Common/UniqueValuesGenerator.cs
+++ b/src/benchmarks/corefx/Common/UniqueValuesGenerator.cs
@@ -6,9 +6,11 @@ namespace Helpers
 {
     internal static class UniqueValuesGenerator
     {
+        private const int Seed = 12345; // we always use the same seed to have repeatable results!
+
         internal static T[] GenerateArray<T>(int count)
         {
-            var random = new Random(12345); // we always use the same seed to have repeatable results!
+            var random = new Random(Seed); 
 
             var uniqueValues = new HashSet<T>();
 
@@ -25,7 +27,7 @@ internal static T[] GenerateArray<T>(int count)
 
         internal static Dictionary<TKey, TValue> GenerateDictionary<TKey, TValue>(int count)
         {
-            var random = new Random(12345); // we always use the same seed to have repeatable results!
+            var random = new Random(Seed);
 
             var dictionary = new Dictionary<TKey, TValue>();
 
diff --git a/src/benchmarks/corefx/System.Collections/Contains/ContainsFalse.cs b/src/benchmarks/corefx/System.Collections/Contains/ContainsFalse.cs
index 9af028c8400..7e78798d9a1 100644
--- a/src/benchmarks/corefx/System.Collections/Contains/ContainsFalse.cs
+++ b/src/benchmarks/corefx/System.Collections/Contains/ContainsFalse.cs
@@ -17,15 +17,15 @@ public class ContainsFalse<T>
         
         private T[] _array;
         private List<T> _list;
-        private LinkedList<T> _linkedlist;
-        private HashSet<T> _hashset;
+        private LinkedList<T> _linkedList;
+        private HashSet<T> _hashSet;
         private Queue<T> _queue;
         private Stack<T> _stack;
-        private SortedSet<T> _sortedset;
-        private ImmutableArray<T> _immutablearray;
-        private ImmutableHashSet<T> _immutablehashset;
-        private ImmutableList<T> _immutablelist;
-        private ImmutableSortedSet<T> _immutablesortedset;
+        private SortedSet<T> _sortedSet;
+        private ImmutableArray<T> _immutableArray;
+        private ImmutableHashSet<T> _immutableHashSet;
+        private ImmutableList<T> _immutableList;
+        private ImmutableSortedSet<T> _immutableSortedSet;
 
         [Params(Utils.DefaultCollectionSize)]
         public int Size;
@@ -39,15 +39,15 @@ public void Setup()
 
             _array = secondHalf;
             _list = new List<T>(secondHalf);
-            _linkedlist = new LinkedList<T>(secondHalf);
-            _hashset = new HashSet<T>(secondHalf);
+            _linkedList = new LinkedList<T>(secondHalf);
+            _hashSet = new HashSet<T>(secondHalf);
             _queue = new Queue<T>(secondHalf);
             _stack = new Stack<T>(secondHalf);
-            _sortedset = new SortedSet<T>(secondHalf);
-            _immutablearray = Immutable.ImmutableArray.CreateRange<T>(secondHalf);
-            _immutablehashset = Immutable.ImmutableHashSet.CreateRange<T>(secondHalf);
-            _immutablelist = Immutable.ImmutableList.CreateRange<T>(secondHalf);
-            _immutablesortedset = Immutable.ImmutableSortedSet.CreateRange<T>(secondHalf);
+            _sortedSet = new SortedSet<T>(secondHalf);
+            _immutableArray = Immutable.ImmutableArray.CreateRange<T>(secondHalf);
+            _immutableHashSet = Immutable.ImmutableHashSet.CreateRange<T>(secondHalf);
+            _immutableList = Immutable.ImmutableList.CreateRange<T>(secondHalf);
+            _immutableSortedSet = Immutable.ImmutableSortedSet.CreateRange<T>(secondHalf);
         }
         
         [Benchmark]
@@ -57,7 +57,7 @@ public bool Array()
             var collection = _array;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.Contains(notFound[i]);
+                result ^= collection.Contains(notFound[i]);
             return result;
         }
         
@@ -68,7 +68,7 @@ public bool List()
             var collection = _list;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.Contains(notFound[i]);
+                result ^= collection.Contains(notFound[i]);
             return result;
         }
 
@@ -82,7 +82,7 @@ private bool Contains(ICollection<T> collection)
             bool result = default;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.Contains(notFound[i]);
+                result ^= collection.Contains(notFound[i]);
             return result;
         }
 
@@ -90,10 +90,10 @@ private bool Contains(ICollection<T> collection)
         public bool LinkedList()
         {
             bool result = default;
-            var collection = _linkedlist;
+            var collection = _linkedList;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.Contains(notFound[i]);
+                result ^= collection.Contains(notFound[i]);
             return result;
         }
 
@@ -101,10 +101,10 @@ public bool LinkedList()
         public bool HashSet()
         {
             bool result = default;
-            var collection = _hashset;
+            var collection = _hashSet;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.Contains(notFound[i]);
+                result ^= collection.Contains(notFound[i]);
             return result;
         }
 
@@ -115,7 +115,7 @@ public bool Queue()
             var collection = _queue;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.Contains(notFound[i]);
+                result ^= collection.Contains(notFound[i]);
             return result;
         }
 
@@ -126,7 +126,7 @@ public bool Stack()
             var collection = _stack;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.Contains(notFound[i]);
+                result ^= collection.Contains(notFound[i]);
             return result;
         }
 
@@ -134,10 +134,10 @@ public bool Stack()
         public bool SortedSet()
         {
             bool result = default;
-            var collection = _sortedset;
+            var collection = _sortedSet;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.Contains(notFound[i]);
+                result ^= collection.Contains(notFound[i]);
             return result;
         }
 
@@ -145,10 +145,10 @@ public bool SortedSet()
         public bool ImmutableArray()
         {
             bool result = default;
-            var collection = _immutablearray;
+            var collection = _immutableArray;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.Contains(notFound[i]);
+                result ^= collection.Contains(notFound[i]);
             return result;
         }
 
@@ -156,10 +156,10 @@ public bool ImmutableArray()
         public bool ImmutableHashSet()
         {
             bool result = default;
-            var collection = _immutablehashset;
+            var collection = _immutableHashSet;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.Contains(notFound[i]);
+                result ^= collection.Contains(notFound[i]);
             return result;
         }
 
@@ -167,10 +167,10 @@ public bool ImmutableHashSet()
         public bool ImmutableList()
         {
             bool result = default;
-            var collection = _immutablelist;
+            var collection = _immutableList;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.Contains(notFound[i]);
+                result ^= collection.Contains(notFound[i]);
             return result;
         }
 
@@ -178,10 +178,10 @@ public bool ImmutableList()
         public bool ImmutableSortedSet()
         {
             bool result = default;
-            var collection = _immutablesortedset;
+            var collection = _immutableSortedSet;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.Contains(notFound[i]);
+                result ^= collection.Contains(notFound[i]);
             return result;
         }
     }
diff --git a/src/benchmarks/corefx/System.Collections/Contains/ContainsKeyFalse.cs b/src/benchmarks/corefx/System.Collections/Contains/ContainsKeyFalse.cs
index 8c35d4cf7c0..c7bff8d14e9 100644
--- a/src/benchmarks/corefx/System.Collections/Contains/ContainsKeyFalse.cs
+++ b/src/benchmarks/corefx/System.Collections/Contains/ContainsKeyFalse.cs
@@ -18,11 +18,11 @@ public class ContainsKeyFalse<TKey, TValue>
         private Dictionary<TKey, TValue> _source;
         
         private Dictionary<TKey, TValue> _dictionary;
-        private SortedList<TKey, TValue> _sortedlist;
-        private SortedDictionary<TKey, TValue> _sorteddictionary;
-        private ConcurrentDictionary<TKey, TValue> _concurrentdictionary;
-        private ImmutableDictionary<TKey, TValue> _immutabledictionary;
-        private ImmutableSortedDictionary<TKey, TValue> _immutablesorteddictionary;
+        private SortedList<TKey, TValue> _sortedList;
+        private SortedDictionary<TKey, TValue> _sortedDictionary;
+        private ConcurrentDictionary<TKey, TValue> _concurrentDictionary;
+        private ImmutableDictionary<TKey, TValue> _immutableDictionary;
+        private ImmutableSortedDictionary<TKey, TValue> _immutableSortedDictionary;
 
         [Params(Utils.DefaultCollectionSize)]
         public int Size;
@@ -35,11 +35,11 @@ public void Setup()
             
             _source = values.Skip(Size).Take(Size).ToDictionary(item => item, item => (TValue)(object)item);
             _dictionary = new Dictionary<TKey, TValue>(_source);
-            _sortedlist = new SortedList<TKey, TValue>(_source);
-            _sorteddictionary = new SortedDictionary<TKey, TValue>(_source);
-            _concurrentdictionary = new ConcurrentDictionary<TKey, TValue>(_source);
-            _immutabledictionary = Immutable.ImmutableDictionary.CreateRange<TKey, TValue>(_source);
-            _immutablesorteddictionary = Immutable.ImmutableSortedDictionary.CreateRange<TKey, TValue>(_source);
+            _sortedList = new SortedList<TKey, TValue>(_source);
+            _sortedDictionary = new SortedDictionary<TKey, TValue>(_source);
+            _concurrentDictionary = new ConcurrentDictionary<TKey, TValue>(_source);
+            _immutableDictionary = Immutable.ImmutableDictionary.CreateRange<TKey, TValue>(_source);
+            _immutableSortedDictionary = Immutable.ImmutableSortedDictionary.CreateRange<TKey, TValue>(_source);
         }
 
         [Benchmark]
@@ -49,7 +49,7 @@ public bool Dictionary()
             var collection = _dictionary;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.ContainsKey(notFound[i]);
+                result ^= collection.ContainsKey(notFound[i]);
             return result;
         }
 
@@ -63,7 +63,7 @@ public bool ContainsKey(IDictionary<TKey, TValue> collection)
             bool result = default;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.ContainsKey(notFound[i]);
+                result ^= collection.ContainsKey(notFound[i]);
             return result;
         }
 
@@ -71,10 +71,10 @@ public bool ContainsKey(IDictionary<TKey, TValue> collection)
         public bool SortedList()
         {
             bool result = default;
-            var collection = _sortedlist;
+            var collection = _sortedList;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.ContainsKey(notFound[i]);
+                result ^= collection.ContainsKey(notFound[i]);
             return result;
         }
 
@@ -82,10 +82,10 @@ public bool SortedList()
         public bool SortedDictionary()
         {
             bool result = default;
-            var collection = _sorteddictionary;
+            var collection = _sortedDictionary;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.ContainsKey(notFound[i]);
+                result ^= collection.ContainsKey(notFound[i]);
             return result;
         }
 
@@ -93,10 +93,10 @@ public bool SortedDictionary()
         public bool ConcurrentDictionary()
         {
             bool result = default;
-            var collection = _concurrentdictionary;
+            var collection = _concurrentDictionary;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.ContainsKey(notFound[i]);
+                result ^= collection.ContainsKey(notFound[i]);
             return result;
         }
 
@@ -104,10 +104,10 @@ public bool ConcurrentDictionary()
         public bool ImmutableDictionary()
         {
             bool result = default;
-            var collection = _immutabledictionary;
+            var collection = _immutableDictionary;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.ContainsKey(notFound[i]);
+                result ^= collection.ContainsKey(notFound[i]);
             return result;
         }
 
@@ -115,10 +115,10 @@ public bool ImmutableDictionary()
         public bool ImmutableSortedDictionary()
         {
             bool result = default;
-            var collection = _immutablesorteddictionary;
+            var collection = _immutableSortedDictionary;
             var notFound = _notFound;
             for (int i = 0; i < notFound.Length; i++)
-                result = collection.ContainsKey(notFound[i]);
+                result ^= collection.ContainsKey(notFound[i]);
             return result;
         }
     }
diff --git a/src/benchmarks/corefx/System.Collections/Contains/ContainsKeyTrue.cs b/src/benchmarks/corefx/System.Collections/Contains/ContainsKeyTrue.cs
index 5982bbb8945..6f580767c00 100644
--- a/src/benchmarks/corefx/System.Collections/Contains/ContainsKeyTrue.cs
+++ b/src/benchmarks/corefx/System.Collections/Contains/ContainsKeyTrue.cs
@@ -18,11 +18,11 @@ public class ContainsKeyTrue<TKey, TValue>
         private Dictionary<TKey, TValue> _source;
         
         private Dictionary<TKey, TValue> _dictionary;
-        private SortedList<TKey, TValue> _sortedlist;
-        private SortedDictionary<TKey, TValue> _sorteddictionary;
-        private ConcurrentDictionary<TKey, TValue> _concurrentdictionary;
-        private ImmutableDictionary<TKey, TValue> _immutabledictionary;
-        private ImmutableSortedDictionary<TKey, TValue> _immutablesorteddictionary;
+        private SortedList<TKey, TValue> _sortedList;
+        private SortedDictionary<TKey, TValue> _sortedDictionary;
+        private ConcurrentDictionary<TKey, TValue> _concurrentDictionary;
+        private ImmutableDictionary<TKey, TValue> _immutableDictionary;
+        private ImmutableSortedDictionary<TKey, TValue> _immutableSortedDictionary;
 
         [Params(Utils.DefaultCollectionSize)]
         public int Size;
@@ -33,11 +33,11 @@ public void Setup()
             _found = UniqueValuesGenerator.GenerateArray<TKey>(Size);
             _source = _found.ToDictionary(item => item, item => (TValue)(object)item);
             _dictionary = new Dictionary<TKey, TValue>(_source);
-            _sortedlist = new SortedList<TKey, TValue>(_source);
-            _sorteddictionary = new SortedDictionary<TKey, TValue>(_source);
-            _concurrentdictionary = new ConcurrentDictionary<TKey, TValue>(_source);
-            _immutabledictionary = Immutable.ImmutableDictionary.CreateRange<TKey, TValue>(_source);
-            _immutablesorteddictionary = Immutable.ImmutableSortedDictionary.CreateRange<TKey, TValue>(_source);
+            _sortedList = new SortedList<TKey, TValue>(_source);
+            _sortedDictionary = new SortedDictionary<TKey, TValue>(_source);
+            _concurrentDictionary = new ConcurrentDictionary<TKey, TValue>(_source);
+            _immutableDictionary = Immutable.ImmutableDictionary.CreateRange<TKey, TValue>(_source);
+            _immutableSortedDictionary = Immutable.ImmutableSortedDictionary.CreateRange<TKey, TValue>(_source);
         }
 
         [Benchmark]
@@ -47,7 +47,7 @@ public bool Dictionary()
             var collection = _dictionary;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.ContainsKey(found[i]);
+                result ^= collection.ContainsKey(found[i]);
             return result;
         }
 
@@ -61,7 +61,7 @@ public bool ContainsKey(IDictionary<TKey, TValue> collection)
             bool result = default;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.ContainsKey(found[i]);
+                result ^= collection.ContainsKey(found[i]);
             return result;
         }
 
@@ -69,10 +69,10 @@ public bool ContainsKey(IDictionary<TKey, TValue> collection)
         public bool SortedList()
         {
             bool result = default;
-            var collection = _sortedlist;
+            var collection = _sortedList;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.ContainsKey(found[i]);
+                result ^= collection.ContainsKey(found[i]);
             return result;
         }
 
@@ -80,10 +80,10 @@ public bool SortedList()
         public bool SortedDictionary()
         {
             bool result = default;
-            var collection = _sorteddictionary;
+            var collection = _sortedDictionary;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.ContainsKey(found[i]);
+                result ^= collection.ContainsKey(found[i]);
             return result;
         }
 
@@ -91,10 +91,10 @@ public bool SortedDictionary()
         public bool ConcurrentDictionary()
         {
             bool result = default;
-            var collection = _concurrentdictionary;
+            var collection = _concurrentDictionary;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.ContainsKey(found[i]);
+                result ^= collection.ContainsKey(found[i]);
             return result;
         }
 
@@ -102,10 +102,10 @@ public bool ConcurrentDictionary()
         public bool ImmutableDictionary()
         {
             bool result = default;
-            var collection = _immutabledictionary;
+            var collection = _immutableDictionary;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.ContainsKey(found[i]);
+                result ^= collection.ContainsKey(found[i]);
             return result;
         }
 
@@ -113,10 +113,10 @@ public bool ImmutableDictionary()
         public bool ImmutableSortedDictionary()
         {
             bool result = default;
-            var collection = _immutablesorteddictionary;
+            var collection = _immutableSortedDictionary;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.ContainsKey(found[i]);
+                result ^= collection.ContainsKey(found[i]);
             return result;
         }
     }
diff --git a/src/benchmarks/corefx/System.Collections/Contains/ContainsTrue.cs b/src/benchmarks/corefx/System.Collections/Contains/ContainsTrue.cs
index 329a8ed0dcc..53bd8dd1f21 100644
--- a/src/benchmarks/corefx/System.Collections/Contains/ContainsTrue.cs
+++ b/src/benchmarks/corefx/System.Collections/Contains/ContainsTrue.cs
@@ -17,15 +17,15 @@ public class ContainsTrue<T>
         
         private T[] _array;
         private List<T> _list;
-        private LinkedList<T> _linkedlist;
-        private HashSet<T> _hashset;
+        private LinkedList<T> _linkedList;
+        private HashSet<T> _hashSet;
         private Queue<T> _queue;
         private Stack<T> _stack;
-        private SortedSet<T> _sortedset;
-        private ImmutableArray<T> _immutablearray;
-        private ImmutableHashSet<T> _immutablehashset;
-        private ImmutableList<T> _immutablelist;
-        private ImmutableSortedSet<T> _immutablesortedset;
+        private SortedSet<T> _sortedSet;
+        private ImmutableArray<T> _immutableArray;
+        private ImmutableHashSet<T> _immutableHashSet;
+        private ImmutableList<T> _immutableList;
+        private ImmutableSortedSet<T> _immutableSortedSet;
 
         [Params(Utils.DefaultCollectionSize)]
         public int Size;
@@ -36,15 +36,15 @@ public void Setup()
             _found = UniqueValuesGenerator.GenerateArray<T>(Size);
             _array = _found.ToArray();
             _list = new List<T>(_found);
-            _linkedlist = new LinkedList<T>(_found);
-            _hashset = new HashSet<T>(_found);
+            _linkedList = new LinkedList<T>(_found);
+            _hashSet = new HashSet<T>(_found);
             _queue = new Queue<T>(_found);
             _stack = new Stack<T>(_found);
-            _sortedset = new SortedSet<T>(_found);
-            _immutablearray = Immutable.ImmutableArray.CreateRange<T>(_found);
-            _immutablehashset = Immutable.ImmutableHashSet.CreateRange<T>(_found);
-            _immutablelist = Immutable.ImmutableList.CreateRange<T>(_found);
-            _immutablesortedset = Immutable.ImmutableSortedSet.CreateRange<T>(_found);
+            _sortedSet = new SortedSet<T>(_found);
+            _immutableArray = Immutable.ImmutableArray.CreateRange<T>(_found);
+            _immutableHashSet = Immutable.ImmutableHashSet.CreateRange<T>(_found);
+            _immutableList = Immutable.ImmutableList.CreateRange<T>(_found);
+            _immutableSortedSet = Immutable.ImmutableSortedSet.CreateRange<T>(_found);
         }
         
         [Benchmark]
@@ -54,7 +54,7 @@ public bool Array()
             var collection = _array;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.Contains(found[i]);
+                result ^= collection.Contains(found[i]);
             return result;
         }
         
@@ -65,7 +65,7 @@ public bool List()
             var collection = _list;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.Contains(found[i]);
+                result ^= collection.Contains(found[i]);
             return result;
         }
 
@@ -79,7 +79,7 @@ private bool Contains(ICollection<T> collection)
             bool result = default;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.Contains(found[i]);
+                result ^= collection.Contains(found[i]);
             return result;
         }
 
@@ -87,10 +87,10 @@ private bool Contains(ICollection<T> collection)
         public bool LinkedList()
         {
             bool result = default;
-            var collection = _linkedlist;
+            var collection = _linkedList;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.Contains(found[i]);
+                result ^= collection.Contains(found[i]);
             return result;
         }
 
@@ -98,10 +98,10 @@ public bool LinkedList()
         public bool HashSet()
         {
             bool result = default;
-            var collection = _hashset;
+            var collection = _hashSet;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.Contains(found[i]);
+                result ^= collection.Contains(found[i]);
             return result;
         }
 
@@ -112,7 +112,7 @@ public bool Queue()
             var collection = _queue;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.Contains(found[i]);
+                result ^= collection.Contains(found[i]);
             return result;
         }
 
@@ -123,7 +123,7 @@ public bool Stack()
             var collection = _stack;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.Contains(found[i]);
+                result ^= collection.Contains(found[i]);
             return result;
         }
 
@@ -131,10 +131,10 @@ public bool Stack()
         public bool SortedSet()
         {
             bool result = default;
-            var collection = _sortedset;
+            var collection = _sortedSet;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.Contains(found[i]);
+                result ^= collection.Contains(found[i]);
             return result;
         }
 
@@ -142,10 +142,10 @@ public bool SortedSet()
         public bool ImmutableArray()
         {
             bool result = default;
-            var collection = _immutablearray;
+            var collection = _immutableArray;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.Contains(found[i]);
+                result ^= collection.Contains(found[i]);
             return result;
         }
 
@@ -153,10 +153,10 @@ public bool ImmutableArray()
         public bool ImmutableHashSet()
         {
             bool result = default;
-            var collection = _immutablehashset;
+            var collection = _immutableHashSet;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.Contains(found[i]);
+                result ^= collection.Contains(found[i]);
             return result;
         }
 
@@ -164,10 +164,10 @@ public bool ImmutableHashSet()
         public bool ImmutableList()
         {
             bool result = default;
-            var collection = _immutablelist;
+            var collection = _immutableList;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.Contains(found[i]);
+                result ^= collection.Contains(found[i]);
             return result;
         }
 
@@ -175,10 +175,10 @@ public bool ImmutableList()
         public bool ImmutableSortedSet()
         {
             bool result = default;
-            var collection = _immutablesortedset;
+            var collection = _immutableSortedSet;
             var found = _found;
             for (int i = 0; i < found.Length; i++)
-                result = collection.Contains(found[i]);
+                result ^= collection.Contains(found[i]);
             return result;
         }
     }
diff --git a/src/benchmarks/corefx/System.Collections/Create/CtorDefaultSize.cs b/src/benchmarks/corefx/System.Collections/Create/CtorDefaultSize.cs
index 30f4a9f8fef..7eac19890d5 100644
--- a/src/benchmarks/corefx/System.Collections/Create/CtorDefaultSize.cs
+++ b/src/benchmarks/corefx/System.Collections/Create/CtorDefaultSize.cs
@@ -11,7 +11,7 @@ namespace System.Collections
     [GenericTypeArguments(typeof(string))] // reference type
     public class CtorDefaultSize<T>
     {
-        [Benchmark]
+        [Benchmark] // we keep this benchmark to compare the cost of creating array vs cost of array wrappers (List, Queue, Stack)
         public T[] Array() => new T[4]; // array has no default size, List has = 4 so I decided to use 4 here
 
         [Benchmark]