Put all the IDs you have in the tree. Send the tree to the relay. Now give me everything that i do not already have.
Discussion
Is there a proposal for it already? Would love to see how that performance works on the relay side, I guess it would be an inverse proportion with the IDs array size
Not yet. But I hope to at least motivate somebody with more skills in the trade to propose a filter. I have not coded a tree myself and other people are saying a bloom filter is more efficient for this need. No idea which is better.
A bit filter would be much better. The only issue is there are false positives. So occasionally you would send a filter to a relay and it would think you already have some event that you dont. You can tune the false positive rate though.
False negatives are fine (receiving an event you already have). False positives (not sending info the user expects to see) are a big no.
Certainly the date ranges filtering we have nowadays are insufficient on a network where the consensus points to zero. And there is no much proposals for relays on that sense.