@pbnjam/bandersnatch 0.1.0 → 0.7.2-rc1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/LICENSE ADDED
@@ -0,0 +1,206 @@
1
+ Apache License
2
+ Version 2.0, January 2004
3
+ http://www.apache.org/licenses/
4
+
5
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
6
+
7
+ 1. Definitions.
8
+
9
+ "License" shall mean the terms and conditions for use, reproduction,
10
+ and distribution as defined by Sections 1 through 9 of this document.
11
+
12
+ "Licensor" shall mean the copyright owner or entity authorized by
13
+ the copyright owner that is granting the License.
14
+
15
+ "Legal Entity" shall mean the union of the acting entity and all
16
+ other entities that control, are controlled by, or are under common
17
+ control with that entity. For the purposes of this definition,
18
+ "control" means (i) the power, direct or indirect, to cause the
19
+ direction or management of such entity, whether by contract or
20
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
21
+ outstanding shares, or (iii) beneficial ownership of such entity.
22
+
23
+ "You" (or "Your") shall mean an individual or Legal Entity
24
+ exercising permissions granted by this License.
25
+
26
+ "Source" form shall mean the preferred form for making modifications,
27
+ including but not limited to software source code, documentation
28
+ source, and configuration files.
29
+
30
+ "Object" form shall mean any form resulting from mechanical
31
+ transformation or translation of a Source form, including but
32
+ not limited to compiled object code, generated documentation,
33
+ and conversions to other media types.
34
+
35
+ "Work" shall mean the work of authorship, whether in Source or
36
+ Object form, made available under the License, as indicated by a
37
+ copyright notice that is included in or attached to the work
38
+ (which shall not include Communications that are clearly marked or
39
+ otherwise designated in writing by the copyright owner as "Not a Work").
40
+
41
+ "Derivative Works" shall mean any work, whether in Source or Object
42
+ form, that is based on (or derived from) the Work and for which the
43
+ editorial revisions, annotations, elaborations, or other modifications
44
+ represent, as a whole, an original work of authorship. For the purposes
45
+ of this License, Derivative Works shall not include works that remain
46
+ separable from, or merely link (or bind by name) to the interfaces of,
47
+ the Work and Derivative Works thereof.
48
+
49
+ "Contribution" shall mean any work of authorship, including
50
+ the original version of the Work and any modifications or additions
51
+ to that Work or Derivative Works thereof, that is intentionally
52
+ submitted to Licensor for inclusion in the Work by the copyright owner
53
+ or by an individual or Legal Entity authorized to submit on behalf of
54
+ the copyright owner. For the purposes of this definition, "submitted"
55
+ means any form of electronic, verbal, or written communication sent
56
+ to the Licensor or its representatives, including but not limited to
57
+ communication on electronic mailing lists, source code control systems,
58
+ and issue tracking systems that are managed by, or on behalf of, the
59
+ Licensor for the purpose of discussing and improving the Work, but
60
+ excluding communication that is clearly marked or otherwise designated
61
+ in writing by the copyright owner as "Not a Contribution."
62
+
63
+ "Contributor" shall mean Licensor and any individual or Legal Entity
64
+ on behalf of whom a Contribution has been received by Licensor and
65
+ subsequently incorporated within the Work.
66
+
67
+ 2. Grant of Copyright License. Subject to the terms and conditions of
68
+ this License, each Contributor hereby grants to You a perpetual,
69
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
70
+ copyright license to reproduce, prepare Derivative Works of,
71
+ publicly display, publicly perform, sublicense, and distribute the
72
+ Work and such Derivative Works in Source or Object form.
73
+
74
+ 3. Grant of Patent License. Subject to the terms and conditions of
75
+ this License, each Contributor hereby grants to You a perpetual,
76
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
77
+ (except as stated in this section) patent license to make, have made,
78
+ use, offer to sell, sell, import, and otherwise transfer the Work,
79
+ where such license applies only to those patent claims licensable
80
+ by such Contributor that are necessarily infringed by their
81
+ Contribution(s) alone or by combination of their Contribution(s)
82
+ with the Work to which such Contribution(s) was submitted. If You
83
+ institute patent litigation against any entity (including a
84
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
85
+ or a Contribution incorporated within the Work constitutes direct
86
+ or contributory patent infringement, then any patent licenses
87
+ granted to You under this License for that Work shall terminate
88
+ as of the date such litigation is filed.
89
+
90
+ 4. Redistribution. You may reproduce and distribute copies of the
91
+ Work or Derivative Works thereof in any medium, with or without
92
+ modifications, and in Source or Object form, provided that You
93
+ meet the following conditions:
94
+
95
+ (a) You must give any other recipients of the Work or
96
+ Derivative Works a copy of this License; and
97
+
98
+ (b) You must cause any modified files to carry prominent notices
99
+ stating that You changed the files; and
100
+
101
+ (c) You must retain, in the Source form of any Derivative Works
102
+ that You distribute, all copyright, patent, trademark, and
103
+ attribution notices from the Source form of the Work,
104
+ excluding those notices that do not pertain to any part of
105
+ the Derivative Works; and
106
+
107
+ (d) If the Work includes a "NOTICE" text file as part of its
108
+ distribution, then any Derivative Works that You distribute must
109
+ include a readable copy of the attribution notices contained
110
+ within such NOTICE file, excluding those notices that do not
111
+ pertain to any part of the Derivative Works, in at least one
112
+ of the following places: within a NOTICE text file distributed
113
+ as part of the Derivative Works; within the Source form or
114
+ documentation, if provided along with the Derivative Works; or,
115
+ within a display generated by the Derivative Works, if and
116
+ wherever such third-party notices normally appear. The contents
117
+ of the NOTICE file are for informational purposes only and
118
+ do not modify the License. You may add Your own attribution
119
+ notices within Derivative Works that You distribute, alongside
120
+ or as an addendum to the NOTICE text from the Work, provided
121
+ that such additional attribution notices cannot be construed
122
+ as modifying the License.
123
+
124
+ You may add Your own copyright statement to Your modifications and
125
+ may provide additional or different license terms and conditions
126
+ for use, reproduction, or distribution of Your modifications, or
127
+ for any such Derivative Works as a whole, provided Your use,
128
+ reproduction, and distribution of the Work otherwise complies with
129
+ the conditions stated in this License.
130
+
131
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
132
+ any Contribution intentionally submitted for inclusion in the Work
133
+ by You to the Licensor shall be under the terms and conditions of
134
+ this License, without any additional terms or conditions.
135
+ Notwithstanding the above, nothing herein shall supersede or modify
136
+ the terms of any separate license agreement you may have executed
137
+ with Licensor regarding such Contributions.
138
+
139
+ 6. Trademarks. This License does not grant permission to use the trade
140
+ names, trademarks, service marks, or product names of the Licensor,
141
+ except as required for reasonable and customary use in describing the
142
+ origin of the Work and reproducing the content of the NOTICE file.
143
+
144
+ 7. Disclaimer of Warranty. Unless required by applicable law or
145
+ agreed to in writing, Licensor provides the Work (and each
146
+ Contributor provides its Contributions) on an "AS IS" BASIS,
147
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
148
+ implied, including, without limitation, any warranties or conditions
149
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
150
+ PARTICULAR PURPOSE. You are solely responsible for determining the
151
+ appropriateness of using or redistributing the Work and assume any
152
+ risks associated with Your exercise of permissions under this License.
153
+
154
+ 8. Limitation of Liability. In no event and under no legal theory,
155
+ whether in tort (including negligence), contract, or otherwise,
156
+ unless required by applicable law (such as deliberate and grossly
157
+ negligent acts) or agreed to in writing, shall any Contributor be
158
+ liable to You for damages, including any direct, indirect, special,
159
+ incidental, or consequential damages of any character arising as a
160
+ result of this License or out of the use or inability to use the
161
+ Work (including but not limited to damages for loss of goodwill,
162
+ work stoppage, computer failure or malfunction, or any and all
163
+ other commercial damages or losses), even if such Contributor
164
+ has been advised of the possibility of such damages.
165
+
166
+ 9. Accepting Warranty or Additional Liability. While redistributing
167
+ the Work or Derivative Works thereof, You may choose to offer,
168
+ and charge a fee for, acceptance of support, warranty, indemnity,
169
+ or other liability obligations and/or rights consistent with this
170
+ License. However, in accepting such obligations, You may act only
171
+ on Your own behalf and on Your sole responsibility, not on behalf
172
+ of any other Contributor, and only if You agree to indemnify,
173
+ defend, and hold each Contributor harmless for any liability
174
+ incurred by, or claims asserted against, such Contributor by reason
175
+ of your accepting any such warranty or additional liability.
176
+
177
+ END OF TERMS AND CONDITIONS
178
+
179
+ APPENDIX: How to apply the Apache License to your work.
180
+
181
+ To apply the Apache License to your work, attach the following
182
+ boilerplate notice, with the fields enclosed by brackets "[]"
183
+ replaced with your own identifying information. (Don't include
184
+ the brackets!) The text should be enclosed in the appropriate
185
+ comment syntax for the file format. We also recommend that a
186
+ file or class name and description of purpose be included on the
187
+ same "printed page" as the copyright notice for easier
188
+ identification within third-party archives.
189
+
190
+ Copyright [yyyy] [name of copyright owner]
191
+
192
+ Licensed under the Apache License, Version 2.0 (the "License");
193
+ you may not use this file except in compliance with the License.
194
+ You may obtain a copy of the License at
195
+
196
+ http://www.apache.org/licenses/LICENSE-2.0
197
+
198
+ Unless required by applicable law or agreed to in writing, software
199
+ distributed under the License is distributed on an "AS IS" BASIS,
200
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
201
+ See the License for the specific language governing permissions and
202
+ limitations under the License.
203
+
204
+
205
+
206
+
package/package.json CHANGED
@@ -1,7 +1,8 @@
1
1
  {
2
2
  "name": "@pbnjam/bandersnatch",
3
- "version": "0.1.0",
3
+ "version": "0.7.2-rc1",
4
4
  "description": "Bandersnatch elliptic curve implementation",
5
+ "license": "Apache-2.0",
5
6
  "type": "module",
6
7
  "repository": {
7
8
  "type": "git",
@@ -18,13 +19,13 @@
18
19
  "docs": "npx typedoc --out docs --entryPoints src/index.ts --entryPointStrategy expand --readme none --name '@pbnjam/bandersnatch' --includeVersion --tsconfig tsconfig.typedoc.json"
19
20
  },
20
21
  "dependencies": {
21
- "@noble/curves": "^2.0.1",
22
- "@noble/hashes": "^2.0.1"
22
+ "@noble/curves": "2.0.1",
23
+ "@noble/hashes": "2.0.1"
23
24
  },
24
25
  "devDependencies": {
25
- "@types/bun": "^1.3.1",
26
+ "@types/bun": "1.3.5",
26
27
  "@types/node": "^22.0.0",
27
- "bun-types": "^1.3.1",
28
+ "bun-types": "1.3.5",
28
29
  "typescript": "5.9.3",
29
30
  "typedoc": "0.28.15"
30
31
  },
package/src/curve.ts CHANGED
@@ -43,12 +43,12 @@ export const Bandersnatch = edwards(BANDERSNATCH_CURVE)
43
43
 
44
44
  /**
45
45
  * Bandersnatch curve operations using @noble/curves.
46
- *
46
+ *
47
47
  * This class provides a high-level interface for working with points on the
48
48
  * Bandersnatch elliptic curve. It implements all standard elliptic curve operations
49
49
  * including point addition, scalar multiplication, and point compression/decompression
50
50
  * compatible with arkworks serialization format.
51
- *
51
+ *
52
52
  * The Bandersnatch curve is a Twisted Edwards curve defined over the BLS12-381 scalar field,
53
53
  * designed for efficient cryptographic operations in the JAM protocol.
54
54
  */
@@ -92,7 +92,7 @@ export class BandersnatchCurve {
92
92
 
93
93
  /**
94
94
  * Decompresses arkworks-compatible point bytes to a Noble EdwardsPoint.
95
- *
95
+ *
96
96
  * This is the inverse operation of `pointToBytes`. It handles arkworks sign bit logic
97
97
  * to reconstruct the full point from compressed bytes. The method:
98
98
  * 1. Extracts the y-coordinate from the first 31 bytes (little-endian)
@@ -193,12 +193,12 @@ export class BandersnatchCurve {
193
193
 
194
194
  /**
195
195
  * Performs scalar multiplication on a curve point.
196
- *
196
+ *
197
197
  * Computes `scalar * point` on the Bandersnatch curve. Handles edge cases including:
198
198
  * - Scalar 0: returns the identity point (infinity)
199
199
  * - Negative scalars: negates the point and uses positive scalar
200
200
  * - Scalars >= curve order: reduces modulo curve order
201
- *
201
+ *
202
202
  * @param point - The curve point to multiply
203
203
  * @param scalar - The scalar multiplier (can be negative or >= curve order)
204
204
  * @returns The result of scalar multiplication: `scalar * point`
@@ -234,10 +234,10 @@ export class BandersnatchCurve {
234
234
 
235
235
  /**
236
236
  * Adds two curve points together.
237
- *
237
+ *
238
238
  * Performs point addition on the Bandersnatch curve: `P + Q`.
239
239
  * This operation is commutative: `add(P, Q) === add(Q, P)`.
240
- *
240
+ *
241
241
  * @param p1 - First curve point
242
242
  * @param p2 - Second curve point
243
243
  * @returns The sum of the two points: `p1 + p2`
@@ -249,10 +249,10 @@ export class BandersnatchCurve {
249
249
 
250
250
  /**
251
251
  * Doubles a curve point.
252
- *
252
+ *
253
253
  * Computes `2 * point` on the Bandersnatch curve. This is equivalent to
254
254
  * `add(point, point)` but is typically more efficient.
255
- *
255
+ *
256
256
  * @param point - The curve point to double
257
257
  * @returns The doubled point: `2 * point`
258
258
  * @throws {Error} If the point is invalid or not on the curve
@@ -263,10 +263,10 @@ export class BandersnatchCurve {
263
263
 
264
264
  /**
265
265
  * Negates a curve point.
266
- *
266
+ *
267
267
  * Computes the additive inverse of a point on the Bandersnatch curve.
268
268
  * The result satisfies: `add(point, negate(point)) === INFINITY`.
269
- *
269
+ *
270
270
  * @param point - The curve point to negate
271
271
  * @returns The negated point: `-point`
272
272
  * @throws {Error} If the point is invalid or not on the curve
@@ -277,10 +277,10 @@ export class BandersnatchCurve {
277
277
 
278
278
  /**
279
279
  * Checks if a point lies on the Bandersnatch curve.
280
- *
280
+ *
281
281
  * Validates that the point satisfies the Twisted Edwards curve equation:
282
282
  * `a*x^2 + y^2 = 1 + d*x^2*y^2` where `a = -5` and `d` is the curve parameter.
283
- *
283
+ *
284
284
  * @param point - The curve point to validate
285
285
  * @returns `true` if the point is on the curve, `false` otherwise
286
286
  */
@@ -290,10 +290,10 @@ export class BandersnatchCurve {
290
290
 
291
291
  /**
292
292
  * Gets the generator point (base point) of the Bandersnatch curve.
293
- *
293
+ *
294
294
  * The generator is a point on the curve that generates the prime subgroup G.
295
295
  * All points in the prime subgroup can be expressed as scalar multiples of the generator.
296
- *
296
+ *
297
297
  * @returns The generator point G
298
298
  */
299
299
  static get GENERATOR() {
@@ -302,10 +302,10 @@ export class BandersnatchCurve {
302
302
 
303
303
  /**
304
304
  * Gets the identity point (point at infinity) of the Bandersnatch curve.
305
- *
305
+ *
306
306
  * The identity point is the neutral element for point addition:
307
307
  * `add(point, INFINITY) === point` for any point on the curve.
308
- *
308
+ *
309
309
  * @returns The identity point (point at infinity)
310
310
  */
311
311
  static get INFINITY() {
@@ -314,11 +314,11 @@ export class BandersnatchCurve {
314
314
 
315
315
  /**
316
316
  * Converts a curve point to its byte representation.
317
- *
317
+ *
318
318
  * Serializes the point to bytes, typically used for challenge generation
319
319
  * in cryptographic protocols. The output format matches the point compression
320
320
  * format used by the curve implementation.
321
- *
321
+ *
322
322
  * @param point - The curve point to hash
323
323
  * @returns Byte representation of the point
324
324
  * @throws {Error} If the point is invalid
@@ -329,10 +329,10 @@ export class BandersnatchCurve {
329
329
 
330
330
  /**
331
331
  * Gets the order (cardinality) of the prime subgroup of the Bandersnatch curve.
332
- *
332
+ *
333
333
  * The curve order is the number of points in the prime subgroup G.
334
334
  * For any point P in G, `scalarMultiply(P, CURVE_ORDER) === INFINITY`.
335
- *
335
+ *
336
336
  * @returns The curve order as a bigint
337
337
  */
338
338
  static get CURVE_ORDER() {
package/src/index.ts CHANGED
@@ -5,16 +5,16 @@
5
5
  * with all necessary operations for cryptographic applications.
6
6
  */
7
7
 
8
- // Export types
9
- export type { CurvePoint } from './types'
10
8
  // Export curve parameters
11
9
  export { BANDERSNATCH_PARAMS } from './config'
12
10
  // Elligator2 hash-to-curve is now available in bandersnatch-vrf package
13
11
  // Export curve implementations
14
12
  // Temporary alias for legacy compatibility
15
13
  export {
16
- BandersnatchCurve,
17
14
  Bandersnatch,
15
+ BandersnatchCurve,
18
16
  } from './curve'
19
17
  // VRF functionality moved to bandersnatch-vrf package
20
- export * from './math'
18
+ export * from './math'
19
+ // Export types
20
+ export type { CurvePoint } from './types'
package/src/math.ts CHANGED
@@ -10,10 +10,10 @@ import {
10
10
 
11
11
  /**
12
12
  * Computes the non-negative modular reduction.
13
- *
13
+ *
14
14
  * Returns `a mod m` where the result is always non-negative (0 <= result < m).
15
15
  * This handles negative inputs correctly by adding the modulus to negative results.
16
- *
16
+ *
17
17
  * @param a - The value to reduce
18
18
  * @param m - The modulus
19
19
  * @returns Non-negative result of `a mod m`
@@ -25,10 +25,10 @@ export function mod(a: bigint, m: bigint): bigint {
25
25
 
26
26
  /**
27
27
  * Computes the modular inverse using the extended Euclidean algorithm.
28
- *
28
+ *
29
29
  * Finds the value `x` such that `(a * x) mod m = 1`. The modular inverse exists
30
30
  * if and only if `gcd(a, m) = 1`.
31
- *
31
+ *
32
32
  * @param a - The value to find the inverse of
33
33
  * @param m - The modulus
34
34
  * @returns The modular inverse of `a` modulo `m`
@@ -53,10 +53,10 @@ export function modInverse(a: bigint, m: bigint): bigint {
53
53
 
54
54
  /**
55
55
  * Computes the modular square root using the noble package FpSqrt.
56
- *
56
+ *
57
57
  * Finds a value `x` such that `x^2 mod p = value`. The square root exists
58
58
  * if and only if `value` is a quadratic residue modulo `p`.
59
- *
59
+ *
60
60
  * @param value - The value to find the square root of
61
61
  * @param p - The prime modulus
62
62
  * @param field - The field implementation from @noble/curves
@@ -81,11 +81,10 @@ export function modSqrt(
81
81
  }
82
82
 
83
83
  export function numberToBytesLittleEndian(value: bigint): Uint8Array {
84
- const bytes = new Uint8Array(32)
85
- const hex = value.toString(16).padStart(64, '0')
86
- for (let i = 0; i < 32; i++) {
87
- bytes[i] = Number.parseInt(hex.slice(62 - i * 2, 64 - i * 2), 16)
88
- }
89
- return bytes
84
+ const bytes = new Uint8Array(32)
85
+ const hex = value.toString(16).padStart(64, '0')
86
+ for (let i = 0; i < 32; i++) {
87
+ bytes[i] = Number.parseInt(hex.slice(62 - i * 2, 64 - i * 2), 16)
90
88
  }
91
-
89
+ return bytes
90
+ }
package/src/types.ts CHANGED
@@ -4,11 +4,11 @@
4
4
 
5
5
  /**
6
6
  * Represents a point on an elliptic curve.
7
- *
7
+ *
8
8
  * This interface defines the structure for curve points used in Bandersnatch
9
9
  * curve operations. Points can be either finite points with (x, y) coordinates
10
10
  * or the point at infinity.
11
- *
11
+ *
12
12
  * @interface CurvePoint
13
13
  */
14
14
  export interface CurvePoint {
@@ -19,4 +19,3 @@ export interface CurvePoint {
19
19
  /** Whether this point is the point at infinity (identity element) */
20
20
  isInfinity: boolean
21
21
  }
22
-