Let's say I have an output in the blockchain at height 100,000. At height 200,000, I want to prove that my output has the work of 100k blocks built onto it, securing it. In Bitcoin, proving that the output has X number of hashes securing it requires providing the full chain of headers, or 80 bytes * 100,000.
Is there an alternative proof of work where these 'work-proofs' do not grow in size indefinitely?
Now that I have found some resources, the terminology for I was looking for is "compact SPV proofs".