Given a set of vertices and a set of attributes let each vertex include an attribute into a set with probability and let it include into a set with probability independently for each . The random binomial intersection digraph on the vertex set is defined as follows: for each the arc is present if and are not disjoint. For any we determine the birth threshold of the complete digraph on vertices and describe the configurations of intersecting sets that realise the threshold.