Code
Hub
Workspaces
Connect
Indexed graphs
Engine
MCP
copy
hub
/
github.com/ethereum/research
/ degree
Method
degree
polynomial_reconstruction/poly_gcd.py:50–53 ·
view source on GitHub ↗
(self, p)
Source
from the content-addressed store, hash-verified
48
49
50
def
degree(self, p):
51
for
i in range(len(p) - 1, -1, -1):
52
if
p[i] % self.modulus != 0:
53
return
i
54
55
def
leading_coefficient(self, p):
56
if
self.degree(p) is None:
Callers
11
mul_many_polys
Method · 0.95
mul_polys
Method · 0.95
leading_coefficient
Method · 0.95
truncate_poly
Method · 0.95
poly_quotient_remainder
Method · 0.95
M_hgcd
Method · 0.95
M_gcd
Method · 0.95
fast_extended_euclidean_algorithm
Method · 0.95
zero_polynomial_via_multiplication
Function · 0.80
zero_polynomial_via_gcd
Function · 0.80
zero_polynomial_via_multiplication
Function · 0.80
Calls
no outgoing calls
Tested by
no test coverage detected