. . . . "Establishes that each agent-key account is the endpoint of at most one primary path, and that the whole path set is bounded by one plus the number of seed declarations plus the number of endorsements. Since each endpoint admits at most one primary path, each edge gives rise to at most one path. This bounds the computation and the fetches needed per recomputation, keeping the periodic trust derivation efficient as the network grows." . . . "Proof of the bounded path set (Lemma 2)" . . . "2026-08-18T08:41:36Z"^^ . . . . . . . . "RSA" . "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAxxo+arlpyxYYoHYYVTNSOWe/es90yVMBA8vaDyaAQk4pnOjTlpPptP5IkGg6zuCRIlm11QrHKkiU536witBT6gdh9kP9ay3S6m7wZ3iM7YcPMfhVHUXN6TBnuiKHHyJdVeK6RxMZlfXRKEz9HYcND+PGCXMVp8BofpKBKke3y4m8FTt+8aMEcgVcFBHFdrkWXoIIvkMlodtXkMgSwuGK8yXt/9lXqChIWpsbzu2juuX6pktMkfexkfQTwIH7oNSr/ma4KzZXERuLrCSO6IH5SfWXwjQUery6rKHiEMyie58mgBf0ssKh+uJoaZOqgbmj0f+EDwTIzq0dNsPA0A+n2QIDAQAB" . "dlvy7li+NrFxZTRMvdfv1YuCeoNj0xwKYICnYAIuJvMkDdpVOa88yej4FK0R9B4wOBHAogxNEhkpETtou5EpkQboSBjcbYg3Wk7l7I5a5AGk0LZcfcAPP4aaw0m1wtpmwnSoO0AWwvHs5QHCpVt5n4y7hoh7Z7AVFuKKld3GDG795isNSCrWRzxooXlWLyk/qQukWctUk8kqNQO5+Nc54r7/3H3zeL+zAQlKWmNriWSv2aAAGAQMqoT6D0beHkyNSs7IgmEXA7mBVP7avm4jM6Dc9as0xiMkPsuAv91caQYUGK+M9O5E5an8HtFobVm1CZvEDywqqN2satNBKWwcpg==" . . .