Oh wow good question! I dont think so bc Erlay‘s goal is scaling not privacy, as it assumes that „every unreachable node is directly connected to several reachable nodes, this policy ensures that a transaction is quickly propagated to be within one hop from most of the nodes in the network“ - I think that obfuscating one hop (sometimes, not all the time) as a byproduct would probably not be enough to reliably break BS heuristics, but I wonder if parts of the BIP could be used to improve the stempool idea - would def be interesting to see an analysis from a privacy perspective for this!