You may be able to compute a SHA256 of part1-part2, if you already knew SHA256(part1), and the value for part2. This relies on a vulnerability in the underlying method of hash construction SHA256 uses (https://en.wikipedia.org/wiki/Length_extension_attack).
EDIT: To clarify the algorithm SHA256 will pad any input to a multiple of some given size.
Soo really you could think of it as SHA256(part1||padding), where 'padding' means x00 repeated till size(part1||padding) mod 512 = 0 (since SHA256 has a block size of 512 https://en.wikipedia.org/wiki/Secure_Hash_Algorithm). This becomes a problem if any padding needs to be added to part1.