One of the main obstacles for the wider deployment of radio (RF) distance bounding is the lack of platforms that implement these protocols. We address this problem and we build a prototype system that demonstratesthatradiodistanceboundingprotocols can be implemented to match the strict processing thattheseprotocolsrequire. Oursystemimplements a proverthat is able to receive, process and transmit signals in less than 1ns. The security guaranteethat adistancebounding protocolbuilt ontop ofthis systemthereforeprovidesisthatamaliciousprovercan, at most, pretend to be about 15cm closer to the verifier than it really is. To enable such fast processing at the prover, we use specially implemented concatenation as the prover’s processing function and show how it can be integrated into a distance bounding protocol. Finally, we show that functions such as XORandthecomparisonfunction, thatwereusedin a number of previously proposed distance bounding protocols,arenot bestsuited forthe implementation of radio distance bounding.