Prophet is a dynamic address allocation protocol described at INFOCOM 2003. This protocol is based upon a family of pseudo-random generators. The goal of Prophet is to establish an addresses scheme free of conflict. The addressing capabilities of Prophet depend on the underlying properties of the pseudo-random generators. The different pseudo-random generators proposed in Prophet are analyzed and the limits of the scheme are exhibited. Most notably, the periods of the generators limit the addressing capabilities of a node and the fact that Prophet is collision-free. In this research report, we show that the underlying assumptions made in Prophet can not be met by pseudo-random generators
