From dd6d9a71cfe5df50f42fb20e7dfd4c4f0def70c1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Marek=20Lema=C5=84czyk?= <marek@lemanczyk.eu>
Date: Fri, 12 Sep 2025 10:59:58 +0200
Subject: [PATCH] Stack overflow fixed

---
 PerfectNumbers.Core/Gpu/MersenneNumberDivisorGpuTester.cs | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/PerfectNumbers.Core/Gpu/MersenneNumberDivisorGpuTester.cs b/PerfectNumbers.Core/Gpu/MersenneNumberDivisorGpuTester.cs
index e2227c2..7a8a52a 100644
--- a/PerfectNumbers.Core/Gpu/MersenneNumberDivisorGpuTester.cs
+++ b/PerfectNumbers.Core/Gpu/MersenneNumberDivisorGpuTester.cs
@@ -15,7 +15,7 @@ public sealed class MersenneNumberDivisorGpuTester
 	public static void BuildDivisorCandidates()
 	{
 		uint[] snapshot = MersenneDivisorCycles.Shared.ExportSmallCyclesSnapshot();
-		Span<(ulong divisor, uint cycle)> list = stackalloc (ulong divisor, uint cycle)[snapshot.Length / 2];
+		(ulong divisor, uint cycle)[] list = new (ulong divisor, uint cycle)[snapshot.Length / 2];
 		uint cycle;
 		int count = 0, i, snapshotLength = snapshot.Length;
 		for (i = 3; i < snapshotLength; i += 2)
@@ -65,7 +65,7 @@ public sealed class MersenneNumberDivisorGpuTester
 		var candidates = _divisorCandidates!;
 		int k, len = candidates.Length;
 		uint cycle;
-		
+
 		// k is simple iterator here
 		for (k = 0; k < len; k++)
 		{