feat: migrate from Cedar to SpiceDB authorization system

This is a major architectural change that replaces the Cedar policy-based
authorization system with SpiceDB's relation-based authorization.

Key changes:

- Migrate from Rust to Go implementation
- Replace Cedar policies with SpiceDB schema and relationships
- Switch from envoy `ext_authz` with Cedar to SpiceDB permission checks
- Update build system and dependencies for Go ecosystem
- Maintain Envoy integration for external authorization

This change enables more flexible permission modeling through SpiceDB's
Google Zanzibar inspired relation-based system, supporting complex
hierarchical permissions that were difficult to express in Cedar.

Breaking change: Existing Cedar policies and Rust-based configuration
will no longer work and need to be migrated to SpiceDB schema.

7 files changed, 0 insertions, 408 deletions

diff --git a/vendor/equivalent/.cargo-checksum.json b/vendor/equivalent/.cargo-checksum.json
deleted file mode 100644
index e7e12087..00000000
--- a/vendor/equivalent/.cargo-checksum.json
+++ /dev/null
@@ -1 +0,0 @@
-{"files":{"Cargo.lock":"2eea7e967981d2fd6ad933bab8c5c987ac6235a5697bb67bfe414764dc83b528","Cargo.toml":"92fcf6d8b32d99f40a5053b9026e417c958d6f5f19581c632d675211b7eeb9f9","LICENSE-APACHE":"a60eea817514531668d7e00765731449fe14d059d3249e0bc93b36de45f759f2","LICENSE-MIT":"7365cc8878a1d7ce155a58c4ca09c3d7a6be413efa5334a80ea842912b669349","README.md":"bbcbb8419f9bb01a51d3d5e808fe35651d423014992a72be3e7acd518485f190","src/lib.rs":"1dd84363f561b30b1da713486c6b583900353e62c569d7ba1dd84eb2c04f1a14"},"package":"877a4ace8713b0bcf2a4e7eec82529c029f1d0619886d18145fea96c3ffe5c0f"}
\ No newline at end of file
diff --git a/vendor/equivalent/Cargo.lock b/vendor/equivalent/Cargo.lock
deleted file mode 100644
index 3de893db..00000000
--- a/vendor/equivalent/Cargo.lock
+++ /dev/null
@@ -1,6 +0,0 @@
-# This file is automatically @generated by Cargo.
-# It is not intended for manual editing.
-[[package]]
-name = "equivalent"
-version = "1.0.2"
-
diff --git a/vendor/equivalent/Cargo.toml b/vendor/equivalent/Cargo.toml
deleted file mode 100644
index 95eff849..00000000
--- a/vendor/equivalent/Cargo.toml
+++ /dev/null
@@ -1,37 +0,0 @@
-# THIS FILE IS AUTOMATICALLY GENERATED BY CARGO
-#
-# When uploading crates to the registry Cargo will automatically
-# "normalize" Cargo.toml files for maximal compatibility
-# with all versions of Cargo and also rewrite `path` dependencies
-# to registry (e.g., crates.io) dependencies.
-#
-# If you are reading this file be aware that the original Cargo.toml
-# will likely look very different (and much more reasonable).
-# See Cargo.toml.orig for the original contents.
-
-[package]
-rust-version = "1.6"
-name = "equivalent"
-version = "1.0.2"
-build = false
-autolib = false
-autobins = false
-autoexamples = false
-autotests = false
-autobenches = false
-description = "Traits for key comparison in maps."
-readme = "README.md"
-keywords = [
-    "hashmap",
-    "no_std",
-]
-categories = [
-    "data-structures",
-    "no-std",
-]
-license = "Apache-2.0 OR MIT"
-repository = "https://github.com/indexmap-rs/equivalent"
-
-[lib]
-name = "equivalent"
-path = "src/lib.rs"
diff --git a/vendor/equivalent/LICENSE-APACHE b/vendor/equivalent/LICENSE-APACHE
deleted file mode 100644
index 16fe87b0..00000000
--- a/vendor/equivalent/LICENSE-APACHE
+++ /dev/null
@@ -1,201 +0,0 @@
-                              Apache License
-                        Version 2.0, January 2004
-                     http://www.apache.org/licenses/
-
-TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-1. Definitions.
-
-   "License" shall mean the terms and conditions for use, reproduction,
-   and distribution as defined by Sections 1 through 9 of this document.
-
-   "Licensor" shall mean the copyright owner or entity authorized by
-   the copyright owner that is granting the License.
-
-   "Legal Entity" shall mean the union of the acting entity and all
-   other entities that control, are controlled by, or are under common
-   control with that entity. For the purposes of this definition,
-   "control" means (i) the power, direct or indirect, to cause the
-   direction or management of such entity, whether by contract or
-   otherwise, or (ii) ownership of fifty percent (50%) or more of the
-   outstanding shares, or (iii) beneficial ownership of such entity.
-
-   "You" (or "Your") shall mean an individual or Legal Entity
-   exercising permissions granted by this License.
-
-   "Source" form shall mean the preferred form for making modifications,
-   including but not limited to software source code, documentation
-   source, and configuration files.
-
-   "Object" form shall mean any form resulting from mechanical
-   transformation or translation of a Source form, including but
-   not limited to compiled object code, generated documentation,
-   and conversions to other media types.
-
-   "Work" shall mean the work of authorship, whether in Source or
-   Object form, made available under the License, as indicated by a
-   copyright notice that is included in or attached to the work
-   (an example is provided in the Appendix below).
-
-   "Derivative Works" shall mean any work, whether in Source or Object
-   form, that is based on (or derived from) the Work and for which the
-   editorial revisions, annotations, elaborations, or other modifications
-   represent, as a whole, an original work of authorship. For the purposes
-   of this License, Derivative Works shall not include works that remain
-   separable from, or merely link (or bind by name) to the interfaces of,
-   the Work and Derivative Works thereof.
-
-   "Contribution" shall mean any work of authorship, including
-   the original version of the Work and any modifications or additions
-   to that Work or Derivative Works thereof, that is intentionally
-   submitted to Licensor for inclusion in the Work by the copyright owner
-   or by an individual or Legal Entity authorized to submit on behalf of
-   the copyright owner. For the purposes of this definition, "submitted"
-   means any form of electronic, verbal, or written communication sent
-   to the Licensor or its representatives, including but not limited to
-   communication on electronic mailing lists, source code control systems,
-   and issue tracking systems that are managed by, or on behalf of, the
-   Licensor for the purpose of discussing and improving the Work, but
-   excluding communication that is conspicuously marked or otherwise
-   designated in writing by the copyright owner as "Not a Contribution."
-
-   "Contributor" shall mean Licensor and any individual or Legal Entity
-   on behalf of whom a Contribution has been received by Licensor and
-   subsequently incorporated within the Work.
-
-2. Grant of Copyright License. Subject to the terms and conditions of
-   this License, each Contributor hereby grants to You a perpetual,
-   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-   copyright license to reproduce, prepare Derivative Works of,
-   publicly display, publicly perform, sublicense, and distribute the
-   Work and such Derivative Works in Source or Object form.
-
-3. Grant of Patent License. Subject to the terms and conditions of
-   this License, each Contributor hereby grants to You a perpetual,
-   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-   (except as stated in this section) patent license to make, have made,
-   use, offer to sell, sell, import, and otherwise transfer the Work,
-   where such license applies only to those patent claims licensable
-   by such Contributor that are necessarily infringed by their
-   Contribution(s) alone or by combination of their Contribution(s)
-   with the Work to which such Contribution(s) was submitted. If You
-   institute patent litigation against any entity (including a
-   cross-claim or counterclaim in a lawsuit) alleging that the Work
-   or a Contribution incorporated within the Work constitutes direct
-   or contributory patent infringement, then any patent licenses
-   granted to You under this License for that Work shall terminate
-   as of the date such litigation is filed.
-
-4. Redistribution. You may reproduce and distribute copies of the
-   Work or Derivative Works thereof in any medium, with or without
-   modifications, and in Source or Object form, provided that You
-   meet the following conditions:
-
-   (a) You must give any other recipients of the Work or
-       Derivative Works a copy of this License; and
-
-   (b) You must cause any modified files to carry prominent notices
-       stating that You changed the files; and
-
-   (c) You must retain, in the Source form of any Derivative Works
-       that You distribute, all copyright, patent, trademark, and
-       attribution notices from the Source form of the Work,
-       excluding those notices that do not pertain to any part of
-       the Derivative Works; and
-
-   (d) If the Work includes a "NOTICE" text file as part of its
-       distribution, then any Derivative Works that You distribute must
-       include a readable copy of the attribution notices contained
-       within such NOTICE file, excluding those notices that do not
-       pertain to any part of the Derivative Works, in at least one
-       of the following places: within a NOTICE text file distributed
-       as part of the Derivative Works; within the Source form or
-       documentation, if provided along with the Derivative Works; or,
-       within a display generated by the Derivative Works, if and
-       wherever such third-party notices normally appear. The contents
-       of the NOTICE file are for informational purposes only and
-       do not modify the License. You may add Your own attribution
-       notices within Derivative Works that You distribute, alongside
-       or as an addendum to the NOTICE text from the Work, provided
-       that such additional attribution notices cannot be construed
-       as modifying the License.
-
-   You may add Your own copyright statement to Your modifications and
-   may provide additional or different license terms and conditions
-   for use, reproduction, or distribution of Your modifications, or
-   for any such Derivative Works as a whole, provided Your use,
-   reproduction, and distribution of the Work otherwise complies with
-   the conditions stated in this License.
-
-5. Submission of Contributions. Unless You explicitly state otherwise,
-   any Contribution intentionally submitted for inclusion in the Work
-   by You to the Licensor shall be under the terms and conditions of
-   this License, without any additional terms or conditions.
-   Notwithstanding the above, nothing herein shall supersede or modify
-   the terms of any separate license agreement you may have executed
-   with Licensor regarding such Contributions.
-
-6. Trademarks. This License does not grant permission to use the trade
-   names, trademarks, service marks, or product names of the Licensor,
-   except as required for reasonable and customary use in describing the
-   origin of the Work and reproducing the content of the NOTICE file.
-
-7. Disclaimer of Warranty. Unless required by applicable law or
-   agreed to in writing, Licensor provides the Work (and each
-   Contributor provides its Contributions) on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-   implied, including, without limitation, any warranties or conditions
-   of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-   PARTICULAR PURPOSE. You are solely responsible for determining the
-   appropriateness of using or redistributing the Work and assume any
-   risks associated with Your exercise of permissions under this License.
-
-8. Limitation of Liability. In no event and under no legal theory,
-   whether in tort (including negligence), contract, or otherwise,
-   unless required by applicable law (such as deliberate and grossly
-   negligent acts) or agreed to in writing, shall any Contributor be
-   liable to You for damages, including any direct, indirect, special,
-   incidental, or consequential damages of any character arising as a
-   result of this License or out of the use or inability to use the
-   Work (including but not limited to damages for loss of goodwill,
-   work stoppage, computer failure or malfunction, or any and all
-   other commercial damages or losses), even if such Contributor
-   has been advised of the possibility of such damages.
-
-9. Accepting Warranty or Additional Liability. While redistributing
-   the Work or Derivative Works thereof, You may choose to offer,
-   and charge a fee for, acceptance of support, warranty, indemnity,
-   or other liability obligations and/or rights consistent with this
-   License. However, in accepting such obligations, You may act only
-   on Your own behalf and on Your sole responsibility, not on behalf
-   of any other Contributor, and only if You agree to indemnify,
-   defend, and hold each Contributor harmless for any liability
-   incurred by, or claims asserted against, such Contributor by reason
-   of your accepting any such warranty or additional liability.
-
-END OF TERMS AND CONDITIONS
-
-APPENDIX: How to apply the Apache License to your work.
-
-   To apply the Apache License to your work, attach the following
-   boilerplate notice, with the fields enclosed by brackets "[]"
-   replaced with your own identifying information. (Don't include
-   the brackets!)  The text should be enclosed in the appropriate
-   comment syntax for the file format. We also recommend that a
-   file or class name and description of purpose be included on the
-   same "printed page" as the copyright notice for easier
-   identification within third-party archives.
-
-Copyright [yyyy] [name of copyright owner]
-
-Licensed under the Apache License, Version 2.0 (the "License");
-you may not use this file except in compliance with the License.
-You may obtain a copy of the License at
-
-	http://www.apache.org/licenses/LICENSE-2.0
-
-Unless required by applicable law or agreed to in writing, software
-distributed under the License is distributed on an "AS IS" BASIS,
-WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-See the License for the specific language governing permissions and
-limitations under the License.
diff --git a/vendor/equivalent/LICENSE-MIT b/vendor/equivalent/LICENSE-MIT
deleted file mode 100644
index 5ac40dae..00000000
--- a/vendor/equivalent/LICENSE-MIT
+++ /dev/null
@@ -1,25 +0,0 @@
-Copyright (c) 2016--2023
-
-Permission is hereby granted, free of charge, to any
-person obtaining a copy of this software and associated
-documentation files (the "Software"), to deal in the
-Software without restriction, including without
-limitation the rights to use, copy, modify, merge,
-publish, distribute, sublicense, and/or sell copies of
-the Software, and to permit persons to whom the Software
-is furnished to do so, subject to the following
-conditions:
-
-The above copyright notice and this permission notice
-shall be included in all copies or substantial portions
-of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
-ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
-TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
-PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
-SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
-IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
-DEALINGS IN THE SOFTWARE.
diff --git a/vendor/equivalent/README.md b/vendor/equivalent/README.md
deleted file mode 100644
index 8ff7e24c..00000000
--- a/vendor/equivalent/README.md
+++ /dev/null
@@ -1,25 +0,0 @@
-# Equivalent
-
-[![crates.io](https://img.shields.io/crates/v/equivalent.svg)](https://crates.io/crates/equivalent)
-[![docs](https://docs.rs/equivalent/badge.svg)](https://docs.rs/equivalent)
-
-`Equivalent` and `Comparable` are Rust traits for key comparison in maps.
-
-These may be used in the implementation of maps where the lookup type `Q`
-may be different than the stored key type `K`.
-
-* `Q: Equivalent<K>` checks for equality, similar to the `HashMap<K, V>`
-  constraint `K: Borrow<Q>, Q: Eq`.
-* `Q: Comparable<K>` checks the ordering, similar to the `BTreeMap<K, V>`
-  constraint `K: Borrow<Q>, Q: Ord`.
-
-These traits are not used by the maps in the standard library, but they may
-add more flexibility in third-party map implementations, especially in
-situations where a strict `K: Borrow<Q>` relationship is not available.
-
-## License
-
-Equivalent is distributed under the terms of both the MIT license and the
-Apache License (Version 2.0). See [LICENSE-APACHE](LICENSE-APACHE) and
-[LICENSE-MIT](LICENSE-MIT) for details. Opening a pull request is
-assumed to signal agreement with these licensing terms.
diff --git a/vendor/equivalent/src/lib.rs b/vendor/equivalent/src/lib.rs
deleted file mode 100644
index 09ba58df..00000000
--- a/vendor/equivalent/src/lib.rs
+++ /dev/null
@@ -1,113 +0,0 @@
-//! [`Equivalent`] and [`Comparable`] are traits for key comparison in maps.
-//!
-//! These may be used in the implementation of maps where the lookup type `Q`
-//! may be different than the stored key type `K`.
-//!
-//! * `Q: Equivalent<K>` checks for equality, similar to the `HashMap<K, V>`
-//!   constraint `K: Borrow<Q>, Q: Eq`.
-//! * `Q: Comparable<K>` checks the ordering, similar to the `BTreeMap<K, V>`
-//!   constraint `K: Borrow<Q>, Q: Ord`.
-//!
-//! These traits are not used by the maps in the standard library, but they may
-//! add more flexibility in third-party map implementations, especially in
-//! situations where a strict `K: Borrow<Q>` relationship is not available.
-//!
-//! # Examples
-//!
-//! ```
-//! use equivalent::*;
-//! use std::cmp::Ordering;
-//!
-//! pub struct Pair<A, B>(pub A, pub B);
-//!
-//! impl<'a, A: ?Sized, B: ?Sized, C, D> Equivalent<(C, D)> for Pair<&'a A, &'a B>
-//! where
-//!     A: Equivalent<C>,
-//!     B: Equivalent<D>,
-//! {
-//!     fn equivalent(&self, key: &(C, D)) -> bool {
-//!         self.0.equivalent(&key.0) && self.1.equivalent(&key.1)
-//!     }
-//! }
-//!
-//! impl<'a, A: ?Sized, B: ?Sized, C, D> Comparable<(C, D)> for Pair<&'a A, &'a B>
-//! where
-//!     A: Comparable<C>,
-//!     B: Comparable<D>,
-//! {
-//!     fn compare(&self, key: &(C, D)) -> Ordering {
-//!         match self.0.compare(&key.0) {
-//!             Ordering::Equal => self.1.compare(&key.1),
-//!             not_equal => not_equal,
-//!         }
-//!     }
-//! }
-//!
-//! fn main() {
-//!     let key = (String::from("foo"), String::from("bar"));
-//!     let q1 = Pair("foo", "bar");
-//!     let q2 = Pair("boo", "bar");
-//!     let q3 = Pair("foo", "baz");
-//!
-//!     assert!(q1.equivalent(&key));
-//!     assert!(!q2.equivalent(&key));
-//!     assert!(!q3.equivalent(&key));
-//!
-//!     assert_eq!(q1.compare(&key), Ordering::Equal);
-//!     assert_eq!(q2.compare(&key), Ordering::Less);
-//!     assert_eq!(q3.compare(&key), Ordering::Greater);
-//! }
-//! ```
-
-#![no_std]
-
-use core::borrow::Borrow;
-use core::cmp::Ordering;
-
-/// Key equivalence trait.
-///
-/// This trait allows hash table lookup to be customized. It has one blanket
-/// implementation that uses the regular solution with `Borrow` and `Eq`, just
-/// like `HashMap` does, so that you can pass `&str` to lookup into a map with
-/// `String` keys and so on.
-///
-/// # Contract
-///
-/// The implementor **must** hash like `K`, if it is hashable.
-pub trait Equivalent<K: ?Sized> {
-    /// Compare self to `key` and return `true` if they are equal.
-    fn equivalent(&self, key: &K) -> bool;
-}
-
-impl<Q: ?Sized, K: ?Sized> Equivalent<K> for Q
-where
-    Q: Eq,
-    K: Borrow<Q>,
-{
-    #[inline]
-    fn equivalent(&self, key: &K) -> bool {
-        PartialEq::eq(self, key.borrow())
-    }
-}
-
-/// Key ordering trait.
-///
-/// This trait allows ordered map lookup to be customized. It has one blanket
-/// implementation that uses the regular solution with `Borrow` and `Ord`, just
-/// like `BTreeMap` does, so that you can pass `&str` to lookup into a map with
-/// `String` keys and so on.
-pub trait Comparable<K: ?Sized>: Equivalent<K> {
-    /// Compare self to `key` and return their ordering.
-    fn compare(&self, key: &K) -> Ordering;
-}
-
-impl<Q: ?Sized, K: ?Sized> Comparable<K> for Q
-where
-    Q: Ord,
-    K: Borrow<Q>,
-{
-    #[inline]
-    fn compare(&self, key: &K) -> Ordering {
-        Ord::cmp(self, key.borrow())
-    }
-}