Thanks to visit codestin.com
Credit goes to github.com

Skip to content

fix: dead links #550

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open

fix: dead links #550

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
cbfccd7
Update dead link fflonk_prove.js
loopy811 Mar 4, 2025
8cb9812
Update dead link verifier_plonk.sol.ejs
loopy811 Mar 4, 2025
55674e4
Update dead link verifier_fflonk.sol.ejs
loopy811 Mar 4, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/fflonk_prove.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -120,7 +120,7 @@ export default async function fflonkProve(zkeyFileName, witnessFileName, logger,
// The Extended Euclidean Algorithm is expensive in terms of computation.
// For the special case where we need to do many modular inverses, there's a simple mathematical trick
// that allows us to compute many inverses, called Montgomery batch inversion.
// More info: https://vitalik.ca/general/2018/07/21/starks_part_3.html
// More info: https://vitalik.eth.limo/general/2018/07/21/starks_part_3.html
// Montgomery batch inversion reduces the n inverse computations to a single one
// To save this (single) inverse computation on-chain, will compute it in proving time and send it to the verifier.
// The verifier will have to check:
Expand Down
4 changes: 2 additions & 2 deletions templates/verifier_fflonk.sol.ejs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -169,7 +169,7 @@ contract FflonkVerifier {
function verifyProof(bytes32[24] calldata proof, uint256[<%- Math.max(nPublic, 1) %>] calldata pubSignals) public view returns (bool) {
assembly {
// Computes the inverse of an array of values
// See https://vitalik.ca/general/2018/07/21/starks_part_3.html in section where explain fields operations
// See https://vitalik.eth.limo/general/2018/07/21/starks_part_3.html in section where explain fields operations
// To save the inverse to be computed on chain the prover sends the inverse as an evaluation in commits.eval_inv
function inverseArray(pMem) {

Expand Down Expand Up @@ -865,7 +865,7 @@ contract FflonkVerifier {

// To divide prime fields the Extended Euclidean Algorithm for computing modular inverses is needed.
// The Montgomery batch inversion algorithm allow us to compute n inverses reducing to a single one inversion.
// More info: https://vitalik.ca/general/2018/07/21/starks_part_3.html
// More info: https://vitalik.eth.limo/general/2018/07/21/starks_part_3.html
// To avoid this single inverse computation on-chain, it has been computed in proving time and send it to the verifier.
// Therefore, the verifier:
// 1) Prepare all the denominators to inverse
Expand Down
2 changes: 1 addition & 1 deletion templates/verifier_plonk.sol.ejs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -150,7 +150,7 @@ contract PlonkVerifier {

///////
// Computes the inverse of an array of values
// See https://vitalik.ca/general/2018/07/21/starks_part_3.html in section where explain fields operations
// See https://vitalik.eth.limo/general/2018/07/21/starks_part_3.html in section where explain fields operations
//////
function inverseArray(pVals, n) {

Expand Down