I have a text sentence that consists of
448 digits [0-9] [a-f] (in HEX format).
This text sentence is partially cut off, but I know the middle, and the beginning and end are damaged.
What I know is
322 known digits in the middle of a text sentence.
74 unknown digits at the beginning
52 unknown digits at the end
That is, the entire text
Size: 224 bytes and it is hashed using the SHA256 hash algorithm I know of.
Is it possible to simplify the search for the same hash in this case? (simplify brute force)
Is it possible to stumble upon a collision of this hash since I know
322 known digits in the middle of the text?