Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Detect a non-trivial subset of AlwaysPass policies #37

Open
sdgathman opened this issue Nov 21, 2021 · 1 comment
Open

Detect a non-trivial subset of AlwaysPass policies #37

sdgathman opened this issue Nov 21, 2021 · 1 comment

Comments

@sdgathman
Copy link
Owner

In addition to "v=spf1 +all", any sequence of positive matches ending in +all will always return Pass. Admins may wish to impose additional restrictive treatment on such worse than non-existent sender policies. @DanielAbrecht

@sdgathman
Copy link
Owner Author

I think this algorithm works:

if result is Pass and mechanism is "all":
  if all previously evaluated mechanisms were + (but didn't match, obviously):
    policy is "degenerate" and must alway return Pass

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant