In this work, merging ideas from compatible discretisations and polyhedral methods, we construct novel fully discrete polynomial de Rham sequences of arbitrary degree on polygons and polyhedra. The spaces and operators that appear in these sequences are directly amenable to computer implementation. Besides proving exactness, we show that the usual sequence of Finite Element spaces forms, through appropriate interpolation operators, a commutative diagram with our sequence, which ensures suitable approximation properties. A discussion on reconstructions of potentials and discrete $L^2$-products completes the exposition.