coosld/ceremonyclient
1
0
Fork 0
mirror of https://github.com/QuilibriumNetwork/ceremonyclient.git synced 2026-02-21 10:27:26 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

final parameters

Browse Source
This commit is contained in:
Cassandra Heart 2025-01-09 22:31:54 -06:00
parent 0b831deec1
commit adb9a4d124
No known key found for this signature in database
GPG Key ID: 6352152859385958
3 changed files with 21 additions and 43 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
node/config/version.go
View File

@ -17,7 +17,7 @@ func GetMinimumPatchVersion() byte {
}
func GetMinimumVersion() []byte {
return []byte{0x02, 0x00, 0x06}
return []byte{0x02, 0x00, 0x05}
}
func GetVersion() []byte {

2
node/execution/intrinsics/token/application/token_handle_mint.go
View File

@ -22,7 +22,7 @@ import (
var PROOF_FRAME_CUTOFF = uint64(46500)
var PROOF_FRAME_RING_RESET = uint64(52000)
var PROOF_FRAME_RING_RESET_2 = uint64(53028)
var PROOF_FRAME_COMBINE_CUTOFF = uint64(99000)
var PROOF_FRAME_COMBINE_CUTOFF = uint64(99900)
const PROOF_FRAME_SENIORITY_REPAIR = 59029

60
node/execution/intrinsics/token/application/token_handle_prover_join_test.go
View File

@ -181,50 +181,28 @@ func (p *prover) generateProof(
challenge,
frame.FrameNumber,
)
individualChallenge := append([]byte{}, challenge...)
individualChallenge = binary.BigEndian.AppendUint32(
individualChallenge,
uint32(0),
)
individualChallenge = append(individualChallenge, frame.Output...)
if proofTree != nil {
individualChallenge = append(individualChallenge, proofTree.Root...)
}
out1, _ := wprover.CalculateChallengeProof(individualChallenge, 10000)
if breakWesoProof {
out1[4] ^= 0xff
}
individualChallenge = append([]byte{}, challenge...)
individualChallenge = binary.BigEndian.AppendUint32(
individualChallenge,
uint32(1),
)
individualChallenge = append(individualChallenge, frame.Output...)
if proofTree != nil {
individualChallenge = append(individualChallenge, proofTree.Root...)
}
out2, _ := wprover.CalculateChallengeProof(individualChallenge, 10000)
if breakWesoProof {
out2[4] ^= 0xff
}
outs := []merkletree.DataBlock{}
for i := 0; i < 64; i++ {
individualChallenge := append([]byte{}, challenge...)
individualChallenge = binary.BigEndian.AppendUint32(
individualChallenge,
uint32(i),
)
individualChallenge = append(individualChallenge, frame.Output...)
if proofTree != nil {
individualChallenge = append(individualChallenge, proofTree.Root...)
}
out, _ := wprover.CalculateChallengeProof(individualChallenge, 10000)
if breakWesoProof {
out[0] ^= 0xff
}
individualChallenge = append([]byte{}, challenge...)
individualChallenge = binary.BigEndian.AppendUint32(
individualChallenge,
uint32(2),
)
individualChallenge = append(individualChallenge, frame.Output...)
if proofTree != nil {
individualChallenge = append(individualChallenge, proofTree.Root...)
}
out3, _ := wprover.CalculateChallengeProof(individualChallenge, 10000)
if breakWesoProof {
out3[4] ^= 0xff
outs = append(outs, tries.NewProofLeaf(out))
}
proofTree, output, _ := tries.PackOutputIntoMultiPayloadAndProof(
[]merkletree.DataBlock{tries.NewProofLeaf(out1), tries.NewProofLeaf(out2), tries.NewProofLeaf(out3)},
3,
outs,
len(outs),
frame,
proofTree,
)
@ -237,7 +215,7 @@ func (p *prover) generateProof(
}
mint.SignED448([]byte(p.pubKey), p.privKey.Sign)
return proofTree, [][]byte{out1, out2}, &protobufs.TokenRequest{
return proofTree, [][]byte{}, &protobufs.TokenRequest{
Request: &protobufs.TokenRequest_Mint{
Mint: mint,
},