Bump the crates group across 1 directory with 2 updates

[dependabot]

Bumps the crates group with 2 updates in the / directory: ed25519-dalek and regex.

Updates ed25519-dalek from 2.2.0 to 3.0.0

Changelog

Sourced from ed25519-dalek's changelog.

3.0.0

• Update the digest dependency to 0.9. This requires a major version because the digest traits are part of the public API, but there are otherwise no changes to the API.

2.1.0

• Make Scalar::from_bits a const fn, allowing its use in const contexts.

2.0.0

• Fix a data modeling error in the serde feature pointed out by Trevor Perrin which caused points and scalars to be serialized with length fields rather than as fixed-size 32-byte arrays. This is a breaking change, but it fixes compatibility with serde-json and ensures that the serde-bincode encoding matches the conventional encoding for X/Ed25519.
• Update rand_core to 0.5, allowing use with new rand versions.
• Switch from clear_on_drop to zeroize (by Tony Arcieri).
• Require subtle = ^2.2.1 and remove the note advising nightly Rust, which is no longer required as of that version of subtle. See the subtle changelog for more details.
• Update README.md for 2.x series.
• Remove the build.rs hack which loaded the entire crate into its own build.rs to generate constants, and keep the constants in the source code.

The only significant change is the data model change to the serde feature; besides the rand_core version bump, there are no other user-visible changes.

1.2.4

• Specify a semver bound for clear_on_drop rather than an exact version, addressing an issue where changes to inline assembly in rustc prevented clear_on_drop from working without an update.

1.2.3

• Fix an issue identified by a Quarkslab audit (and Jack Grigg), where manually constructing unreduced Scalar values, as needed for X/Ed25519, and then performing scalar/scalar arithmetic could compute incorrect results.
• Switch to upstream Rust intrinsics for the IFMA backend now that they exist in Rust and don't need to be defined locally.
• Ensure that the NAF computation works correctly, even for parameters never used elsewhere in the codebase.
• Minor refactoring to EdwardsPoint decompression.
• Fix broken links in documentation.
• Fix compilation on nightly broken due to changes to the #[doc(include)] path root (not quite correctly done in 1.2.2).

1.2.2

... (truncated)

Commits

• 6d96eb7 Bump version to 3.0.0.
• c68b30f Merge pull request #330 from isislovecruft/fix/move-coc
• 2ee6193 Merge pull request #327 from huitseeker/digests-0.9
• 91a0fae Move CoC section from CONTRIBUTING.md to new file.
• 5038fcf Merge pull request #308 from isislovecruft/fix/pippenger-typo
• 6afd8ff Update sha2, digest to 0.9
• 3cc13a7 Merge branch 'master' into develop
• c4824e1 Merge branch 'release/2.1.0'
• 3fc47ef Bump version to 2.1.0
• f04b830 Merge branch 'master' into develop
• Additional commits viewable in compare view

Updates regex from 1.12.4 to 1.13.0

Changelog

Sourced from regex's changelog.

1.13.0 (2026-07-09)

This release includes a new API, a regex! macro, for lazy compilation of a regex from a string literal. If you use regexes a lot, it's likely you've already written one exactly like it. The new macro can be used like this:

use regex::regex;
fn is_match(line: &str) -> bool {
// The regex will be compiled approximately once and reused automatically.
// This avoids the footgun of using Regex::new here, which would
// guarantee that it would be compiled every time this routine is called.
// This would likely make this routine much slower than it needs to be.
regex!(r"bar|baz").is_match(line)
}
let hay = "
path/to/foo:54:Blue Harvest
path/to/bar:90:Something, Something, Something, Dark Side
path/to/baz:3:It's a Trap!
";
let matches = hay.lines().filter(|line| is_match(line)).count();
assert_eq!(matches, 2);

Improvements:

• #709: Add a new regex! macro for efficient and automatic reuse of a compiled regex.

Commits

• 926af2e 1.13.0
• 7d941a9 regex-automata-0.4.15
• e358341 api: add regex! macro for lazy compilation
• c420333 automata: disable miri on a couple doc tests
• b9d2cf7 github: add FUNDING link
• 0858006 docs: add AI policy for contributors
• 468fc64 automata: reject dense DFA start states that are match states
• See full diff in compare view

Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting @dependabot rebase.

---

Dependabot commands and options

You can trigger Dependabot actions by commenting on this PR:

• @dependabot rebase will rebase this PR
• @dependabot recreate will recreate this PR, overwriting any edits that have been made to it
• @dependabot show <dependency name> ignore conditions will show all of the ignore conditions of the specified dependency
• @dependabot ignore <dependency name> major version will close this group update PR and stop Dependabot creating any more for the specific dependency's major version (unless you unignore this specific dependency's major version or upgrade to it yourself)
• @dependabot ignore <dependency name> minor version will close this group update PR and stop Dependabot creating any more for the specific dependency's minor version (unless you unignore this specific dependency's minor version or upgrade to it yourself)
• @dependabot ignore <dependency name> will close this group update PR and stop Dependabot creating any more for the specific dependency (unless you unignore this specific dependency or upgrade to it yourself)
• @dependabot unignore <dependency name> will remove all of the ignore conditions of the specified dependency
• @dependabot unignore <dependency name> <ignore condition> will remove the ignore condition of the specified dependency and ignore conditions