Structural Determinism in Computational Hardness: A Counter-Argument to the Randomness Assumption in SETH via Fermat-Brahmagupta (FB) Locking | Synapse