What could "look for the constants that you might find in RC6" mean? In this presentation at the 30c3 (long but extremely interesting and well-documented), Jacob Appelbaum gave this verbal advice (circa 43'30"):


  look for the constants that you might find in RC6


I'm trying to make sense out of that; my problem is, there are very few constants that I could find in the description of RC6. Any idea?
The Key schedule appendix of the RC6 paper (Rivest et al.) defines two arbitrary constants in hexadecimal notation. They also appear in RC5.


$P_{32} = \tt{B7E15163}$
$Q_{32} = \tt{9E3779B9}$


Be aware that the binary coding of these constants will vary based on the endian-ness of the computer architecture.

There seems to be nothing 'special' about these constants in relation to the construction of the RC6 algorithm. They can be replaced with any random value, producing an incompatible variant of RC6 with presumably identical security properties, and the authors make note of this. (The 'official' constants were chosen based on open criteria, described in the paper, in order to dispel any notion that they induce a back door.) Thus a serious search for RC6 would include RC6-alikes and look for algorithm structure rather than constants.

There are no other arbitrary numeric constants defined in RC6, unless you would go so far as to consider the number of rounds etc. as such.

By the way, Appelbaum's talk wasn't "well documented" enough to provide any justification for this RC6 hunt. Typically of Appelbaum, he takes the position, "Trust me, I've seen the secret documents." Sounds like some senators I know.