aitbc
816e258d4c
Development Artifact Cleanup: ✅ BROTHER_NODE REORGANIZATION: Moved development test node to appropriate location - dev/test-nodes/brother_node/: Moved from root directory for better organization - Contains development configuration, test logs, and test chain data - No impact on production systems - purely development/testing artifact ✅ DEVELOPMENT ARTIFACTS IDENTIFIED: - Chain ID: aitbc-brother-chain (test/development chain) - Ports: 8010 (P2P) and 8011 (RPC) - different from production - Environment: .env file with test configuration - Logs: rpc.log and node.log from development testing session (March 15, 2026) ✅ ROOT DIRECTORY CLEANUP: Removed development clutter from production directory - brother_node/ moved to dev/test-nodes/brother_node/ - Root directory now contains only production-ready components - Development artifacts properly organized in dev/ subdirectory DIRECTORY STRUCTURE IMPROVEMENT: 📁 dev/test-nodes/: Development and testing node configurations 🏗️ Root Directory: Clean production structure with only essential components 🧪 Development Isolation: Test environments separated from production BENEFITS: ✅ Clean Production Directory: No development artifacts in root ✅ Better Organization: Development nodes grouped in dev/ subdirectory ✅ Clear Separation: Production vs development environments clearly distinguished ✅ Maintainability: Easier to identify and manage development components RESULT: Successfully moved brother_node development artifact to dev/test-nodes/ subdirectory, cleaning up the root directory while preserving development testing environment for future use.
70 lines
2.2 KiB
TypeScript
Executable File
70 lines
2.2 KiB
TypeScript
Executable File
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
||
import { IField } from './modular.js';
|
||
export type AffinePoint<T> = {
|
||
x: T;
|
||
y: T;
|
||
} & {
|
||
z?: never;
|
||
t?: never;
|
||
};
|
||
export interface Group<T extends Group<T>> {
|
||
double(): T;
|
||
negate(): T;
|
||
add(other: T): T;
|
||
subtract(other: T): T;
|
||
equals(other: T): boolean;
|
||
multiply(scalar: bigint): T;
|
||
}
|
||
export type GroupConstructor<T> = {
|
||
BASE: T;
|
||
ZERO: T;
|
||
};
|
||
export type Mapper<T> = (i: T[]) => T[];
|
||
export declare function wNAF<T extends Group<T>>(c: GroupConstructor<T>, bits: number): {
|
||
constTimeNegate: (condition: boolean, item: T) => T;
|
||
unsafeLadder(elm: T, n: bigint): T;
|
||
/**
|
||
* Creates a wNAF precomputation window. Used for caching.
|
||
* Default window size is set by `utils.precompute()` and is equal to 8.
|
||
* Number of precomputed points depends on the curve size:
|
||
* 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
|
||
* - 𝑊 is the window size
|
||
* - 𝑛 is the bitlength of the curve order.
|
||
* For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
|
||
* @returns precomputed point tables flattened to a single array
|
||
*/
|
||
precomputeWindow(elm: T, W: number): Group<T>[];
|
||
/**
|
||
* Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
|
||
* @param W window size
|
||
* @param precomputes precomputed tables
|
||
* @param n scalar (we don't check here, but should be less than curve order)
|
||
* @returns real and fake (for const-time) points
|
||
*/
|
||
wNAF(W: number, precomputes: T[], n: bigint): {
|
||
p: T;
|
||
f: T;
|
||
};
|
||
wNAFCached(P: T, precomputesMap: Map<T, T[]>, n: bigint, transform: Mapper<T>): {
|
||
p: T;
|
||
f: T;
|
||
};
|
||
};
|
||
export type BasicCurve<T> = {
|
||
Fp: IField<T>;
|
||
n: bigint;
|
||
nBitLength?: number;
|
||
nByteLength?: number;
|
||
h: bigint;
|
||
hEff?: bigint;
|
||
Gx: T;
|
||
Gy: T;
|
||
allowInfinityPoint?: boolean;
|
||
};
|
||
export declare function validateBasic<FP, T>(curve: BasicCurve<FP> & T): Readonly<{
|
||
readonly nBitLength: number;
|
||
readonly nByteLength: number;
|
||
} & BasicCurve<FP> & T & {
|
||
p: bigint;
|
||
}>;
|
||
//# sourceMappingURL=curve.d.ts.map
|