mirror of
https://github.com/onsonr/sonr.git
synced 2025-03-10 21:09:11 +00:00
* feat: add docs and CI workflow for publishing to onsonr.dev * (refactor): Move hway,motr executables to their own repos * feat: simplify devnet and testnet configurations * refactor: update import path for didcrypto package * docs(networks): Add README with project overview, architecture, and community links * refactor: Move network configurations to deploy directory * build: update golang version to 1.23 * refactor: move logger interface to appropriate package * refactor: Move devnet configuration to networks/devnet * chore: improve release process with date variable * (chore): Move Crypto Library * refactor: improve code structure and readability in DID module * feat: integrate Trunk CI checks * ci: optimize CI workflow by removing redundant build jobs --------- Co-authored-by: Darp Alakun <i@prad.nu>
50 lines
1.1 KiB
Go
Executable File
50 lines
1.1 KiB
Go
Executable File
//
|
|
// Copyright Coinbase, Inc. All Rights Reserved.
|
|
//
|
|
// SPDX-License-Identifier: Apache-2.0
|
|
//
|
|
|
|
package v1
|
|
|
|
import (
|
|
"github.com/onsonr/sonr/crypto/core/curves"
|
|
)
|
|
|
|
type polynomial struct {
|
|
Coefficients []*curves.Element
|
|
}
|
|
|
|
// newPoly creates a random polynomial of the given degree but with the provided intercept value
|
|
func newPoly(intercept *curves.Element, degree uint32) (polynomial, error) {
|
|
p := polynomial{
|
|
Coefficients: make([]*curves.Element, degree),
|
|
}
|
|
|
|
// Intercept is the value to be split
|
|
p.Coefficients[0] = intercept
|
|
|
|
// random coefficients
|
|
for i := uint32(1); i < degree; i++ {
|
|
c, err := intercept.Field().RandomElement(nil)
|
|
if err != nil {
|
|
return p, err
|
|
}
|
|
p.Coefficients[i] = c
|
|
}
|
|
|
|
return p, nil
|
|
}
|
|
|
|
// evaluate returns the value of the polynomial for the given x
|
|
func (p polynomial) evaluate(x *curves.Element) *curves.Element {
|
|
// Compute the polynomial value using Horner's Method
|
|
|
|
degree := len(p.Coefficients) - 1
|
|
result := p.Coefficients[degree].Clone()
|
|
for i := degree - 1; i >= 0; i-- {
|
|
result = result.Mul(x).Add(p.Coefficients[i])
|
|
}
|
|
|
|
return result
|
|
}
|