I can’t help but think about the possibilities here. Students can coalesce into pools, where ids are randomly circulating among those badges in the pool, using them as hosts. But then the counterattack to that might be for the system to recognize that a student can’t magically disappear from one place and reappear in a different place without time to get there, so that anomaly would identify the subversion. So the counter-counter-attack would be to semi-randomly circulate the ids only to other host badges that are within walking distance from the previous host. But then the counter-counter-counter attack might be to isolate random walks among the students, which would be a highly unusual occurance in real life. So the counter-counter-counter-counter attack would be to choose a virtual destination at random, and hop the ids in a semi-directed path among random hosts that happen to be in the direction of that destination. Sounds like a very fun project–and eminently doable!
4 Likes