1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
// SPDX-License-Identifier: MPL-2.0
//
// Part of Auguth Labs open-source softwares.
// Built for the Substrate framework.
//
// This Source Code Form is subject to the terms of the Mozilla Public
// License, v. 2.0. If a copy of the MPL was not distributed with this
// file, You can obtain one at https://mozilla.org/MPL/2.0/.
//
// Copyright (c) 2026 Auguth Labs (OPC) Pvt Ltd, India
// ===============================================================================
// ````````````````````````````````` KEYS SUITE ``````````````````````````````````
// ===============================================================================
//! Utilities for deterministic identifier derivation.
//!
//! Provides a generic mechanism to generate reproducible identifiers (`Id`)
//! from a combination of:
//! - a base key (`Id`)
//! - an associated item (`Item`)
//! - a salt (`Salt`)
//!
//! using a hashing algorithm (via [`Hash`]).
//!
//! The same input tuple `(Id, Item, Salt)` will always produce the same output,
//! enabling stable and namespaced key derivation.
//!
//! ## Components
//!
//! - [`KeySeedFor`]: Encodes the derivation inputs and produces a derived key.
//! - [`KeyGenFor`]: Trait providing a generic interface for key generation.
//!
//! ## Guarantees
//!
//! - Deterministic: identical inputs yield identical outputs
//! - Domain separation via `(Item, Salt)` inputs
//!
//! ## Notes
//!
//! - Uniqueness depends on correct salt usage
//! - Decoding from hash output must succeed for valid key generation
// ===============================================================================
// ``````````````````````````````````` IMPORTS ```````````````````````````````````
// ===============================================================================
// --- Core ---
use PhantomData;
// --- SCALE & metadata ---
use ;
use TypeInfo;
// --- Substrate crates ---
use ;
// ===============================================================================
// ``````````````````````````````` STRUCTURES ````````````````````````````````````
// ===============================================================================
/// A seed structure for deterministic identifier derivation.
///
/// `KeySeedFor` enables the generation of a unique, deterministic identifier (`Id`)
/// from a combination of:
/// - a target key type (`Id`)
/// - a meta-data value (`Item`)
/// - a unique salt (`Salt`)
///
/// within the context of a specific runtime (`T`) and hashing algorithm (`Hash`).
///
/// ### Overview
/// This struct serves as the canonical pre-image for generating new deterministic
/// IDs, based on a source identity (`target`), a value of interest (`item`), and a
/// unique `salt`.
///
/// ### Type Parameters
/// - `Item`: The value associated with the derived identifier. May be low entropy
/// or even default.
/// - `Id`: The identifier type, used both as the source (`key`) and the derived
/// output (`target`).
/// - `Salt`: A unique value to ensure uniqueness per `(Id, Item)` pair.
/// - `Hash`: The hashing algorithm used for deterministic ID derivation.
/// - `T`: The runtime context.
///
/// ### Constraints & Responsibilities
/// - `target` (`Id`): Must be a high-entropy, globally unique identifier (e.g., account ID, hash, public key).
/// - `item` (`Item`): May be low-entropy; a single `Id` can be associated with multiple `Item` types,
/// but each `Item` type must be uniquely tied to a single `Id` type.
/// - `salt`: Must be unique per `(Id, Item)` pair; implementers must ensure salts are not reused.
///
/// ### Example Use Cases
/// - Sub-identities derived from a parent identity
/// - Capability delegation
/// - Namespaced object IDs
/// - Resource handles scoped to specific keys
// ===============================================================================
// ````````````````````````````` INHERENT IMPLS ``````````````````````````````````
// ===============================================================================
/// Implementation of utility methods for `KeySeedFor`.
// ===============================================================================
// ````````````````````````````````` TRAITS ``````````````````````````````````````
// ===============================================================================
/// Trait for generating deterministic identifiers from a combination of key, item,
/// and salt.
///
/// This trait abstracts the process of deriving a unique, reproducible identifier (`Id`)
/// from a source key (`target`), associated item (metadata), and a salt value, using
/// a specified hashing algorithm.
///
/// It is intended for use cases where deterministic, namespaced, or context-specific
/// IDs are required, such as sub-identities, capability delegation, or resource handles.
///
/// ## Type Parameters
/// - `Id`: The identifier type to be generated and used as the source key.
/// - `Item`: The metadata or context value associated with the identifier.
/// - `Salt`: A unique value to ensure uniqueness per `(Id, Item)` pair.
/// - `Hasher`: The hashing algorithm used for deterministic ID derivation.
/// - `T`: The runtime context (e.g., a Substrate pallet's `Config`).
/// Blanket implementation of [`KeyGenFor`] for [`KeySeedFor`].
///
/// This allows any `KeySeedFor` instance to use the `gen_key` utility
///
// ===============================================================================
// ```````````````````````````` TEST UTILITIES ```````````````````````````````````
// ===============================================================================
/// Internal test utilities for validating [`KeyGenFor`] implementations.
///
/// This module provides reusable checks to ensure deterministic behavior
/// and basic input separation properties of key generation logic.