This research examines GPU thread mapping for a Sierpiński gasket fractal embedded in an n×n discrete Euclidean space. The authors propose a block-space mapping function that operates in O(log2 log2(n)) time and uses a thread count proportional to n raised to the Hausdorff dimension (approximately 1.58), achieving parallel space efficiency proportional to O(n^H). Compared to traditional bounding-box approaches, the method delivers sub-exponential improvements in parallel space utilization with speedups reaching approximately 10x for n = 2^16.