Folkman’s theorem asserts that in any red-blue colouring of [N], there is an n-set all of whose finite sums are the same colour. How large must N be in terms of n? Improving on Erdos—Spencer from the 80s, I’ll show that N must be at least doubly exponential in n.