[Research] Geometric analysis of SHA-256: Finding 68% bit-match pairs through dimensional transformation

New preprint exploring unconventional cryptanalysis: • Framework: “Inverse Dimensionalization” • Target: SHA-256 structural analysis • Result: 174/256 matching bits (M₁ = 88514, M₂ = 88551) • Time: 3.8 seconds • NOT a collision — but statistically anomalous Paper + reproducible code: https://doi.org/10.17605/OSF.IO/6YRW8 Full paper with math and code: https://doi.org/10.17605/OSF.IO/6YRW8 Paper: https://osf.io/6yrw8/files/wj9ze Code: https://osf.io/6yrw8/files/zy8ck Verification code: https://osf.io/6yrw8/files/pqne7 Device specifications used to find the 174/256-bit match in 3.8 seconds: • Google Colab Free CPU • Intel Xeon • Clock speed: between 2.20 GHz and 2.30 GHz • Cores (vCPUs): 2 virtual cores • RAM: 12 GB Security implications discussion welcome. submitted by /u/No_Arachnid_5563 [link] [comments]Technical Information Security Content & DiscussionRead More