There is no backstory to this question; I just thought of it.
Take a piece of origami paper, a square with area 1. Then fold the paper in any way possible without cutting. There is no limit to the number of folds. Then find the smallest possible cuboid that would contain the entirety of the folded paper.
What is the largest possible volume of the cuboid? In what way(s) could the paper be folded into to create a cuboid of this volume? And how would other problems similarily relating to folded paper be solved?