In article <efa0117e-5b17-800d-820d-b5d2413c6...@tana.it> you write: >> One of the points of the tree walk is to get rid of the PSL processing. > >The PSL processing is a local lookup on an in-memory suffix tree. How is it a >progress to replace it with a tree walk? A PSL search is lightning faster >than >even a single DNS lookup, isn't it?
You have to download a copy of the PSL, read it into your program, and parse it into some internal form. The PSL is over 200K of text and 13,000 lines, so while it's not a large file, it's not zero either. If you're lucky you can amortize your PSL parsing across multiple DMARC checks, but your DNS cache amortizes DNS lookups across mutiple checke, too. The DNS approach has the advantage that you don't have to depend on a third party's text file updated at unknown intervals, and also makes it easier to deal with what I've called the Holy Roman Empire problem. R's, John _______________________________________________ dmarc mailing list dmarc@ietf.org https://www.ietf.org/mailman/listinfo/dmarc
