@bonfida/spl-name-service 3.0.0 → 3.0.1

package/dist/cjs/instructions/createInstruction.cjs

@@ -0,0 +1,2 @@
+"use strict";require("../node_modules/buffer/index.cjs");var e=require("@solana/web3.js"),r=require("../int.cjs"),i=require("../_virtual/index.cjs");exports.createInstruction=function(s,u,t,n,a,b,o,p,f,l,c){const y=[i.__exports.Buffer.from(Int8Array.from([0])),new r.Numberu32(b.length).toBuffer(),b,o.toBuffer(),p.toBuffer()],g=i.__exports.Buffer.concat(y),k=[{pubkey:u,isSigner:!1,isWritable:!1},{pubkey:a,isSigner:!0,isWritable:!0},{pubkey:t,isSigner:!1,isWritable:!0},{pubkey:n,isSigner:!1,isWritable:!1}];return f?k.push({pubkey:f,isSigner:!0,isWritable:!1}):k.push({pubkey:new e.PublicKey(i.__exports.Buffer.alloc(32)),isSigner:!1,isWritable:!1}),l?k.push({pubkey:l,isSigner:!1,isWritable:!1}):k.push({pubkey:new e.PublicKey(i.__exports.Buffer.alloc(32)),isSigner:!1,isWritable:!1}),c&&k.push({pubkey:c,isSigner:!0,isWritable:!1}),new e.TransactionInstruction({keys:k,programId:s,data:g})};
+//# sourceMappingURL=createInstruction.cjs.map

package/dist/cjs/instructions/createInstruction.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"createInstruction.cjs","sources":["../../../src/instructions/createInstruction.ts"],"sourcesContent":[null],"names":["nameProgramId","systemProgramId","nameKey","nameOwnerKey","payerKey","hashed_name","lamports","space","nameClassKey","nameParent","nameParentOwner","buffers","Buffer","__exports","from","Int8Array","Numberu32","length","toBuffer","data","concat","keys","pubkey","isSigner","isWritable","push","PublicKey","alloc","TransactionInstruction","programId"],"mappings":"+KAIM,SACJA,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAU,CACdC,EAAMC,UAAAD,OAACE,KAAKC,UAAUD,KAAK,CAAC,KAC5B,IAAIE,YAAUX,EAAYY,QAAQC,WAClCb,EACAC,EAASY,WACTX,EAAMW,YAGFC,EAAOP,EAAAA,UAAAA,OAAOQ,OAAOT,GAErBU,EAAO,CACX,CACEC,OAAQrB,EACRsB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQlB,EACRmB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQpB,EACRqB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQnB,EACRoB,UAAU,EACVC,YAAY,IAsChB,OAlCIhB,EACFa,EAAKI,KAAK,CACRH,OAAQd,EACRe,UAAU,EACVC,YAAY,IAGdH,EAAKI,KAAK,CACRH,OAAQ,IAAII,EAASA,UAACd,EAAMC,UAAAD,OAACe,MAAM,KACnCJ,UAAU,EACVC,YAAY,IAGZf,EACFY,EAAKI,KAAK,CACRH,OAAQb,EACRc,UAAU,EACVC,YAAY,IAGdH,EAAKI,KAAK,CACRH,OAAQ,IAAII,EAASA,UAACd,EAAMC,UAAAD,OAACe,MAAM,KACnCJ,UAAU,EACVC,YAAY,IAGZd,GACFW,EAAKI,KAAK,CACRH,OAAQZ,EACRa,UAAU,EACVC,YAAY,IAIT,IAAII,EAAAA,uBAAuB,CAChCP,OACAQ,UAAW7B,EACXmB,QAEJ"}

package/dist/cjs/instructions/createInstructionV3.cjs

@@ -0,0 +1,2 @@
+"use strict";require("../node_modules/buffer/index.cjs");var e=require("@solana/web3.js"),i=require("../node_modules/borsh/lib/esm/index.cjs"),s=require("../_virtual/index.cjs");class r{constructor(e){this.tag=13,this.name=e.name,this.space=e.space,this.referrerIdxOpt=e.referrerIdxOpt}serialize(){return i.serialize(r.schema,this)}getInstruction(i,r,t,u,p,a,n,b,l,h,g,c,o,k,y,S,W){const d=s.__exports.Buffer.from(this.serialize());let m=[];return m.push({pubkey:r,isSigner:!1,isWritable:!1}),m.push({pubkey:t,isSigner:!1,isWritable:!1}),m.push({pubkey:u,isSigner:!1,isWritable:!0}),m.push({pubkey:p,isSigner:!1,isWritable:!0}),m.push({pubkey:a,isSigner:!1,isWritable:!1}),m.push({pubkey:n,isSigner:!1,isWritable:!1}),m.push({pubkey:b,isSigner:!0,isWritable:!0}),m.push({pubkey:l,isSigner:!1,isWritable:!0}),m.push({pubkey:h,isSigner:!1,isWritable:!1}),m.push({pubkey:g,isSigner:!1,isWritable:!1}),m.push({pubkey:c,isSigner:!1,isWritable:!1}),m.push({pubkey:o,isSigner:!1,isWritable:!0}),m.push({pubkey:k,isSigner:!1,isWritable:!1}),m.push({pubkey:y,isSigner:!1,isWritable:!1}),m.push({pubkey:S,isSigner:!1,isWritable:!1}),W&&m.push({pubkey:W,isSigner:!1,isWritable:!0}),new e.TransactionInstruction({keys:m,programId:i,data:d})}}r.schema={struct:{tag:"u8",name:"string",space:"u32",referrerIdxOpt:{option:"u16"}}},exports.createInstructionV3=r;
+//# sourceMappingURL=createInstructionV3.cjs.map

package/dist/cjs/instructions/createInstructionV3.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"createInstructionV3.cjs","sources":["../../../src/instructions/createInstructionV3.ts"],"sourcesContent":[null],"names":["createInstructionV3","constructor","obj","this","tag","name","space","referrerIdxOpt","serialize","schema","getInstruction","programId","namingServiceProgram","rootDomain","reverseLookup","systemProgram","centralState","buyer","buyerTokenSource","pythMappingAcc","pythProductAcc","pythPriceAcc","vault","splTokenProgram","rentSysvar","state","referrerAccountOpt","data","Buffer","from","keys","push","pubkey","isSigner","isWritable","TransactionInstruction","struct","option"],"mappings":"wLAKaA,EAcX,WAAAC,CAAYC,GAKVC,KAAKC,IAAM,GACXD,KAAKE,KAAOH,EAAIG,KAChBF,KAAKG,MAAQJ,EAAII,MACjBH,KAAKI,eAAiBL,EAAIK,cAC3B,CACD,SAAAC,GACE,OAAOA,YAAUR,EAAoBS,OAAQN,KAC9C,CACD,cAAAO,CACEC,EACAC,EACAC,EACAR,EACAS,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAOC,EAAAA,UAAAA,OAAOC,KAAK1B,KAAKK,aAC9B,IAAIsB,EAAqB,GAmFzB,OAlFAA,EAAKC,KAAK,CACRC,OAAQpB,EACRqB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQnB,EACRoB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQ3B,EACR4B,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQlB,EACRmB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQjB,EACRkB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQhB,EACRiB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQf,EACRgB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQd,EACRe,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQb,EACRc,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQZ,EACRa,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQX,EACRY,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQV,EACRW,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQT,EACRU,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQR,EACRS,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQP,EACRQ,UAAU,EACVC,YAAY,IAERR,GACJI,EAAKC,KAAK,CACRC,OAAQN,EACRO,UAAU,EACVC,YAAY,IAGT,IAAIC,EAAAA,uBAAuB,CAChCL,OACAnB,YACAgB,QAEH,EAlIM3B,EAAAS,OAAS,CACd2B,OAAQ,CACNhC,IAAK,KACLC,KAAM,SACNC,MAAO,MACPC,eAAgB,CAAE8B,OAAQ"}

package/dist/cjs/instructions/createReverseInstruction.cjs

@@ -0,0 +1,2 @@
+"use strict";require("../node_modules/buffer/index.cjs");var e=require("@solana/web3.js"),i=require("../node_modules/borsh/lib/esm/index.cjs"),s=require("../_virtual/index.cjs");class r{constructor(e){this.tag=12,this.name=e.name}serialize(){return i.serialize(r.schema,this)}getInstruction(i,r,t,u,n,a,b,p,l,o){const c=s.__exports.Buffer.from(this.serialize());let h=[];return h.push({pubkey:r,isSigner:!1,isWritable:!1}),h.push({pubkey:t,isSigner:!1,isWritable:!1}),h.push({pubkey:u,isSigner:!1,isWritable:!0}),h.push({pubkey:n,isSigner:!1,isWritable:!1}),h.push({pubkey:a,isSigner:!1,isWritable:!1}),h.push({pubkey:b,isSigner:!0,isWritable:!0}),h.push({pubkey:p,isSigner:!1,isWritable:!1}),l&&h.push({pubkey:l,isSigner:!1,isWritable:!0}),o&&h.push({pubkey:o,isSigner:!0,isWritable:!0}),new e.TransactionInstruction({keys:h,programId:i,data:c})}}r.schema={struct:{tag:"u8",name:"string"}},exports.createReverseInstruction=r;
+//# sourceMappingURL=createReverseInstruction.cjs.map

package/dist/cjs/instructions/createReverseInstruction.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"createReverseInstruction.cjs","sources":["../../../src/instructions/createReverseInstruction.ts"],"sourcesContent":[null],"names":["createReverseInstruction","constructor","obj","this","tag","name","serialize","schema","getInstruction","programId","namingServiceProgram","rootDomain","reverseLookup","systemProgram","centralState","feePayer","rentSysvar","parentName","parentNameOwner","data","Buffer","from","keys","push","pubkey","isSigner","isWritable","TransactionInstruction","struct"],"mappings":"wLAKaA,EAUX,WAAAC,CAAYC,GACVC,KAAKC,IAAM,GACXD,KAAKE,KAAOH,EAAIG,IACjB,CACD,SAAAC,GACE,OAAOA,YAAUN,EAAyBO,OAAQJ,KACnD,CACD,cAAAK,CACEC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAOC,EAAAA,UAAAA,OAAOC,KAAKlB,KAAKG,aAC9B,IAAIgB,EAAqB,GAkDzB,OAjDAA,EAAKC,KAAK,CACRC,OAAQd,EACRe,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQb,EACRc,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQZ,EACRa,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQX,EACRY,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQV,EACRW,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQT,EACRU,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQR,EACRS,UAAU,EACVC,YAAY,IAERT,GACJK,EAAKC,KAAK,CACRC,OAAQP,EACRQ,UAAU,EACVC,YAAY,IAGVR,GACJI,EAAKC,KAAK,CACRC,OAAQN,EACRO,UAAU,EACVC,YAAY,IAGT,IAAIC,EAAAA,uBAAuB,CAChCL,OACAb,YACAU,QAEH,EAlFMnB,EAAAO,OAAS,CACdqB,OAAQ,CACNxB,IAAK,KACLC,KAAM"}

package/dist/cjs/instructions/createSplitV2Instruction.cjs

@@ -0,0 +1,2 @@
+"use strict";require("../node_modules/buffer/index.cjs");var e=require("@solana/web3.js"),i=require("../node_modules/borsh/lib/esm/index.cjs"),s=require("../_virtual/index.cjs");class r{constructor(e){this.tag=20,this.name=e.name,this.space=e.space,this.referrerIdxOpt=e.referrerIdxOpt}serialize(){return i.serialize(r.schema,this)}getInstruction(i,r,t,u,p,a,n,b,l,h,g,c,o,k,y,S,W){const d=s.__exports.Buffer.from(this.serialize());let m=[];return m.push({pubkey:r,isSigner:!1,isWritable:!1}),m.push({pubkey:t,isSigner:!1,isWritable:!1}),m.push({pubkey:u,isSigner:!1,isWritable:!0}),m.push({pubkey:p,isSigner:!1,isWritable:!0}),m.push({pubkey:a,isSigner:!1,isWritable:!1}),m.push({pubkey:n,isSigner:!1,isWritable:!1}),m.push({pubkey:b,isSigner:!0,isWritable:!0}),m.push({pubkey:l,isSigner:!1,isWritable:!1}),m.push({pubkey:h,isSigner:!0,isWritable:!0}),m.push({pubkey:g,isSigner:!1,isWritable:!0}),m.push({pubkey:c,isSigner:!1,isWritable:!1}),m.push({pubkey:o,isSigner:!1,isWritable:!0}),m.push({pubkey:k,isSigner:!1,isWritable:!1}),m.push({pubkey:y,isSigner:!1,isWritable:!1}),m.push({pubkey:S,isSigner:!1,isWritable:!1}),W&&m.push({pubkey:W,isSigner:!1,isWritable:!0}),new e.TransactionInstruction({keys:m,programId:i,data:d})}}r.schema={struct:{tag:"u8",name:"string",space:"u32",referrerIdxOpt:{option:"u16"}}},exports.createSplitV2Instruction=r;
+//# sourceMappingURL=createSplitV2Instruction.cjs.map

package/dist/cjs/instructions/createSplitV2Instruction.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"createSplitV2Instruction.cjs","sources":["../../../src/instructions/createSplitV2Instruction.ts"],"sourcesContent":[null],"names":["createSplitV2Instruction","constructor","obj","this","tag","name","space","referrerIdxOpt","serialize","schema","getInstruction","programId","namingServiceProgram","rootDomain","reverseLookup","systemProgram","centralState","buyer","domainOwner","feePayer","buyerTokenSource","pythFeedAccount","vault","splTokenProgram","rentSysvar","state","referrerAccountOpt","data","Buffer","from","keys","push","pubkey","isSigner","isWritable","TransactionInstruction","struct","option"],"mappings":"wLAKaA,EAaX,WAAAC,CAAYC,GAKVC,KAAKC,IAAM,GACXD,KAAKE,KAAOH,EAAIG,KAChBF,KAAKG,MAAQJ,EAAII,MACjBH,KAAKI,eAAiBL,EAAIK,cAC3B,CACD,SAAAC,GACE,OAAOA,YAAUR,EAAyBS,OAAQN,KACnD,CACD,cAAAO,CACEC,EACAC,EACAC,EACAR,EACAS,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAOC,EAAAA,UAAAA,OAAOC,KAAK1B,KAAKK,aAC9B,IAAIsB,EAAqB,GAmFzB,OAlFAA,EAAKC,KAAK,CACRC,OAAQpB,EACRqB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQnB,EACRoB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQ3B,EACR4B,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQlB,EACRmB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQjB,EACRkB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQhB,EACRiB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQf,EACRgB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQd,EACRe,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQb,EACRc,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQZ,EACRa,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQX,EACRY,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQV,EACRW,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQT,EACRU,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQR,EACRS,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQP,EACRQ,UAAU,EACVC,YAAY,IAERR,GACJI,EAAKC,KAAK,CACRC,OAAQN,EACRO,UAAU,EACVC,YAAY,IAGT,IAAIC,EAAAA,uBAAuB,CAChCL,OACAnB,YACAgB,QAEH,EAjIM3B,EAAAS,OAAS,CACd2B,OAAQ,CACNhC,IAAK,KACLC,KAAM,SACNC,MAAO,MACPC,eAAgB,CAAE8B,OAAQ"}

package/dist/cjs/instructions/createV2Instruction.cjs

@@ -0,0 +1,2 @@
+"use strict";require("../node_modules/buffer/index.cjs");var e=require("@solana/web3.js"),i=require("../node_modules/borsh/lib/esm/index.cjs"),s=require("../_virtual/index.cjs"),r=require("../node_modules/@solana/spl-token/lib/esm/constants.cjs");class t{constructor(e){this.tag=9,this.name=e.name,this.space=e.space}serialize(){return i.serialize(t.schema,this)}getInstruction(i,t,a,n,u,b,l,o,c,p,g){const m=s.__exports.Buffer.from(this.serialize()),k=[{pubkey:t,isSigner:!1,isWritable:!1},{pubkey:a,isSigner:!1,isWritable:!1},{pubkey:n,isSigner:!1,isWritable:!1},{pubkey:u,isSigner:!1,isWritable:!0},{pubkey:b,isSigner:!1,isWritable:!0},{pubkey:e.SystemProgram.programId,isSigner:!1,isWritable:!1},{pubkey:l,isSigner:!1,isWritable:!1},{pubkey:o,isSigner:!0,isWritable:!0},{pubkey:c,isSigner:!1,isWritable:!0},{pubkey:p,isSigner:!1,isWritable:!0},{pubkey:r.TOKEN_PROGRAM_ID,isSigner:!1,isWritable:!1},{pubkey:g,isSigner:!1,isWritable:!1}];return new e.TransactionInstruction({keys:k,programId:i,data:m})}}t.schema={struct:{tag:"u8",name:"string",space:"u32"}},exports.createV2Instruction=t;
+//# sourceMappingURL=createV2Instruction.cjs.map

package/dist/cjs/instructions/createV2Instruction.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"createV2Instruction.cjs","sources":["../../../src/instructions/createV2Instruction.ts"],"sourcesContent":[null],"names":["createV2Instruction","constructor","obj","this","tag","name","space","serialize","schema","getInstruction","programId","rentSysvarAccount","nameProgramId","rootDomain","nameAccount","reverseLookupAccount","centralState","buyer","buyerTokenAccount","usdcVault","state","data","Buffer","from","keys","pubkey","isSigner","isWritable","SystemProgram","TOKEN_PROGRAM_ID","TransactionInstruction","struct"],"mappings":"6PASaA,EAaX,WAAAC,CAAYC,GACVC,KAAKC,IAAM,EACXD,KAAKE,KAAOH,EAAIG,KAChBF,KAAKG,MAAQJ,EAAII,KAClB,CAED,SAAAC,GACE,OAAOA,YAAUP,EAAoBQ,OAAQL,KAC9C,CAED,cAAAM,CACEC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAOC,EAAAA,UAAAA,OAAOC,KAAKpB,KAAKI,aACxBiB,EAAO,CACX,CACEC,OAAQd,EACRe,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQb,EACRc,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQZ,EACRa,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQX,EACRY,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQV,EACRW,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQG,EAAaA,cAAClB,UACtBgB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQT,EACRU,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQR,EACRS,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQP,EACRQ,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQN,EACRO,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQI,EAAgBA,iBACxBH,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQL,EACRM,UAAU,EACVC,YAAY,IAIhB,OAAO,IAAIG,EAAAA,uBAAuB,CAChCN,OACAd,YACAW,QAEH,EApGMrB,EAAAQ,OAAS,CACduB,OAAQ,CACN3B,IAAK,KACLC,KAAM,SACNC,MAAO"}

package/dist/cjs/instructions/createWithNftInstruction.cjs

@@ -0,0 +1,2 @@
+"use strict";require("../node_modules/buffer/index.cjs");var e=require("@solana/web3.js"),i=require("../node_modules/borsh/lib/esm/index.cjs"),s=require("../_virtual/index.cjs");class r{constructor(e){this.tag=17,this.name=e.name,this.space=e.space}serialize(){return i.serialize(r.schema,this)}getInstruction(i,r,u,t,a,n,p,b,l,h,g,c,k,o,y,W,S){const m=s.__exports.Buffer.from(this.serialize());let d=[];return d.push({pubkey:r,isSigner:!1,isWritable:!1}),d.push({pubkey:u,isSigner:!1,isWritable:!1}),d.push({pubkey:t,isSigner:!1,isWritable:!0}),d.push({pubkey:a,isSigner:!1,isWritable:!0}),d.push({pubkey:n,isSigner:!1,isWritable:!1}),d.push({pubkey:p,isSigner:!1,isWritable:!1}),d.push({pubkey:b,isSigner:!0,isWritable:!0}),d.push({pubkey:l,isSigner:!1,isWritable:!0}),d.push({pubkey:h,isSigner:!1,isWritable:!0}),d.push({pubkey:g,isSigner:!1,isWritable:!0}),d.push({pubkey:c,isSigner:!1,isWritable:!0}),d.push({pubkey:k,isSigner:!1,isWritable:!0}),d.push({pubkey:o,isSigner:!1,isWritable:!1}),d.push({pubkey:y,isSigner:!1,isWritable:!1}),d.push({pubkey:W,isSigner:!1,isWritable:!1}),d.push({pubkey:S,isSigner:!1,isWritable:!1}),new e.TransactionInstruction({keys:d,programId:i,data:m})}}r.schema={struct:{tag:"u8",name:"string",space:"u32"}},exports.createWithNftInstruction=r;
+//# sourceMappingURL=createWithNftInstruction.cjs.map

package/dist/cjs/instructions/createWithNftInstruction.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"createWithNftInstruction.cjs","sources":["../../../src/instructions/createWithNftInstruction.ts"],"sourcesContent":[null],"names":["createWithNftInstruction","constructor","obj","this","tag","name","space","serialize","schema","getInstruction","programId","namingServiceProgram","rootDomain","reverseLookup","systemProgram","centralState","buyer","nftSource","nftMetadata","nftMint","masterEdition","collection","splTokenProgram","rentSysvar","state","mplTokenMetadata","data","Buffer","from","keys","push","pubkey","isSigner","isWritable","TransactionInstruction","struct"],"mappings":"wLAKaA,EAYX,WAAAC,CAAYC,GACVC,KAAKC,IAAM,GACXD,KAAKE,KAAOH,EAAIG,KAChBF,KAAKG,MAAQJ,EAAII,KAClB,CACD,SAAAC,GACE,OAAOA,YAAUP,EAAyBQ,OAAQL,KACnD,CACD,cAAAM,CACEC,EACAC,EACAC,EACAP,EACAQ,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAOC,EAAAA,UAAAA,OAAOC,KAAKzB,KAAKI,aAC9B,IAAIsB,EAAqB,GAiFzB,OAhFAA,EAAKC,KAAK,CACRC,OAAQpB,EACRqB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQnB,EACRoB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQ1B,EACR2B,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQlB,EACRmB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQjB,EACRkB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQhB,EACRiB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQf,EACRgB,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQd,EACRe,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQb,EACRc,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQZ,EACRa,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQX,EACRY,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQV,EACRW,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQT,EACRU,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQR,EACRS,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQP,EACRQ,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQN,EACRO,UAAU,EACVC,YAAY,IAEP,IAAIC,EAAAA,uBAAuB,CAChCL,OACAnB,YACAgB,QAEH,EA1HM1B,EAAAQ,OAAS,CACd2B,OAAQ,CACN/B,IAAK,KACLC,KAAM,SACNC,MAAO"}

package/dist/cjs/instructions/deleteInstruction.cjs

@@ -0,0 +1,2 @@
+"use strict";require("../node_modules/buffer/index.cjs");var e=require("@solana/web3.js"),r=require("../_virtual/index.cjs");exports.deleteInstruction=function(i,s,t,n){const u=[r.__exports.Buffer.from(Int8Array.from([3]))],o=r.__exports.Buffer.concat(u),a=[{pubkey:s,isSigner:!1,isWritable:!0},{pubkey:n,isSigner:!0,isWritable:!1},{pubkey:t,isSigner:!1,isWritable:!0}];return new e.TransactionInstruction({keys:a,programId:i,data:o})};
+//# sourceMappingURL=deleteInstruction.cjs.map

package/dist/cjs/instructions/deleteInstruction.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"deleteInstruction.cjs","sources":["../../../src/instructions/deleteInstruction.ts"],"sourcesContent":[null],"names":["nameProgramId","nameAccountKey","refundTargetKey","nameOwnerKey","buffers","Buffer","__exports","from","Int8Array","data","concat","keys","pubkey","isSigner","isWritable","TransactionInstruction","programId"],"mappings":"uJAGM,SACJA,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAU,CAACC,EAAMC,UAAAD,OAACE,KAAKC,UAAUD,KAAK,CAAC,MAEvCE,EAAOJ,EAAAA,UAAAA,OAAOK,OAAON,GACrBO,EAAO,CACX,CACEC,OAAQX,EACRY,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQT,EACRU,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQV,EACRW,UAAU,EACVC,YAAY,IAIhB,OAAO,IAAIC,EAAAA,uBAAuB,CAChCJ,OACAK,UAAWhB,EACXS,QAEJ"}

package/dist/cjs/instructions/reallocInstruction.cjs

@@ -0,0 +1,2 @@
+"use strict";require("../node_modules/buffer/index.cjs");var r=require("@solana/web3.js"),e=require("../_virtual/index.cjs");exports.reallocInstruction=function(i,s,t,n,u,o){const a=[e.__exports.Buffer.from(Int8Array.from([4])),o.toBuffer()],c=e.__exports.Buffer.concat(a),f=[{pubkey:s,isSigner:!1,isWritable:!1},{pubkey:t,isSigner:!0,isWritable:!0},{pubkey:n,isSigner:!1,isWritable:!0},{pubkey:u,isSigner:!0,isWritable:!1}];return new r.TransactionInstruction({keys:f,programId:i,data:c})};
+//# sourceMappingURL=reallocInstruction.cjs.map

package/dist/cjs/instructions/reallocInstruction.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"reallocInstruction.cjs","sources":["../../../src/instructions/reallocInstruction.ts"],"sourcesContent":[null],"names":["nameProgramId","systemProgramId","payerKey","nameAccountKey","nameOwnerKey","space","buffers","Buffer","from","Int8Array","toBuffer","data","concat","keys","pubkey","isSigner","isWritable","TransactionInstruction","programId"],"mappings":"wJAIgB,SACdA,EACAC,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAU,CAACC,mBAAOC,KAAKC,UAAUD,KAAK,CAAC,KAAMH,EAAMK,YAEnDC,EAAOJ,EAAAA,UAAAA,OAAOK,OAAON,GACrBO,EAAO,CACX,CACEC,OAAQb,EACRc,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQZ,EACRa,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQX,EACRY,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQV,EACRW,UAAU,EACVC,YAAY,IAIhB,OAAO,IAAIC,EAAAA,uBAAuB,CAChCJ,OACAK,UAAWlB,EACXW,QAEJ"}

package/dist/cjs/instructions/registerFavoriteInstruction.cjs

@@ -0,0 +1,2 @@
+"use strict";require("../node_modules/buffer/index.cjs");var e=require("@solana/web3.js"),s=require("../node_modules/borsh/lib/esm/index.cjs"),r=require("../_virtual/index.cjs");class i{constructor(){this.tag=6}serialize(){return s.serialize(i.schema,this)}getInstruction(s,i,t,u,n,a){const o=r.__exports.Buffer.from(this.serialize());let c=[];return c.push({pubkey:i,isSigner:!1,isWritable:!1}),c.push({pubkey:t,isSigner:!1,isWritable:!0}),c.push({pubkey:u,isSigner:!0,isWritable:!0}),c.push({pubkey:n,isSigner:!1,isWritable:!1}),a&&c.push({pubkey:a,isSigner:!1,isWritable:!1}),new e.TransactionInstruction({keys:c,programId:s,data:o})}}i.schema={struct:{tag:"u8"}},exports.registerFavoriteInstruction=i;
+//# sourceMappingURL=registerFavoriteInstruction.cjs.map

package/dist/cjs/instructions/registerFavoriteInstruction.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"registerFavoriteInstruction.cjs","sources":["../../../src/instructions/registerFavoriteInstruction.ts"],"sourcesContent":[null],"names":["registerFavoriteInstruction","constructor","this","tag","serialize","schema","getInstruction","programId","nameAccount","favouriteAccount","owner","systemProgram","optParent","data","Buffer","from","keys","push","pubkey","isSigner","isWritable","TransactionInstruction","struct"],"mappings":"wLAKaA,EAOX,WAAAC,GACEC,KAAKC,IAAM,CACZ,CACD,SAAAC,GACE,OAAOA,YAAUJ,EAA4BK,OAAQH,KACtD,CACD,cAAAI,CACEC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAOC,EAAAA,UAAAA,OAAOC,KAAKb,KAAKE,aAC9B,IAAIY,EAAqB,GA4BzB,OA3BAA,EAAKC,KAAK,CACRC,OAAQV,EACRW,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQT,EACRU,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQR,EACRS,UAAU,EACVC,YAAY,IAEdJ,EAAKC,KAAK,CACRC,OAAQP,EACRQ,UAAU,EACVC,YAAY,IAERR,GACJI,EAAKC,KAAK,CACRC,OAAQN,EACRO,UAAU,EACVC,YAAY,IAGT,IAAIC,EAAAA,uBAAuB,CAChCL,OACAT,YACAM,QAEH,EArDMb,EAAAK,OAAS,CACdiB,OAAQ,CACNnB,IAAK"}

package/dist/cjs/instructions/transferInstruction.cjs

@@ -0,0 +1,2 @@
+"use strict";require("../node_modules/buffer/index.cjs");var e=require("@solana/web3.js"),r=require("../_virtual/index.cjs");exports.transferInstruction=function(i,s,t,u,n,a,o){const b=[r.__exports.Buffer.from(Int8Array.from([2])),t.toBuffer()],f=r.__exports.Buffer.concat(b),p=[{pubkey:s,isSigner:!1,isWritable:!0},{pubkey:o||u,isSigner:!0,isWritable:!1}];return n&&p.push({pubkey:n,isSigner:!0,isWritable:!1}),o&&a&&(n||p.push({pubkey:e.PublicKey.default,isSigner:!1,isWritable:!1}),p.push({pubkey:a,isSigner:!1,isWritable:!1})),new e.TransactionInstruction({keys:p,programId:i,data:f})};
+//# sourceMappingURL=transferInstruction.cjs.map

package/dist/cjs/instructions/transferInstruction.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"transferInstruction.cjs","sources":["../../../src/instructions/transferInstruction.ts"],"sourcesContent":[null],"names":["nameProgramId","nameAccountKey","newOwnerKey","currentNameOwnerKey","nameClassKey","nameParent","parentOwner","buffers","Buffer","from","Int8Array","toBuffer","data","concat","keys","pubkey","isSigner","isWritable","push","PublicKey","default","TransactionInstruction","programId"],"mappings":"yJAGgB,SACdA,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAU,CAACC,mBAAOC,KAAKC,UAAUD,KAAK,CAAC,KAAMP,EAAYS,YAEzDC,EAAOJ,EAAAA,UAAAA,OAAOK,OAAON,GAErBO,EAAO,CACX,CACEC,OAAQd,EACRe,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQT,GAA4BH,EACpCa,UAAU,EACVC,YAAY,IA2BhB,OAvBIb,GACFU,EAAKI,KAAK,CACRH,OAAQX,EACRY,UAAU,EACVC,YAAY,IAIZX,GAAeD,IACZD,GACHU,EAAKI,KAAK,CACRH,OAAQI,EAASA,UAACC,QAClBJ,UAAU,EACVC,YAAY,IAGhBH,EAAKI,KAAK,CACRH,OAAQV,EACRW,UAAU,EACVC,YAAY,KAIT,IAAII,EAAAA,uBAAuB,CAChCP,OACAQ,UAAWtB,EACXY,QAEJ"}

package/dist/cjs/instructions/types.cjs

@@ -0,0 +1,2 @@
+"use strict";
+//# sourceMappingURL=types.cjs.map

package/dist/cjs/instructions/types.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.cjs","sources":[],"sourcesContent":[],"names":[],"mappings":""}

package/dist/cjs/instructions/updateInstruction.cjs

@@ -0,0 +1,2 @@
+"use strict";require("../node_modules/buffer/index.cjs");var e=require("@solana/web3.js"),r=require("../int.cjs"),t=require("../_virtual/index.cjs");exports.updateInstruction=function(n,i,u,s,o){const a=[t.__exports.Buffer.from(Int8Array.from([1])),u.toBuffer(),new r.Numberu32(s.length).toBuffer(),s],f=t.__exports.Buffer.concat(a),c=[{pubkey:i,isSigner:!1,isWritable:!0},{pubkey:o,isSigner:!0,isWritable:!1}];return new e.TransactionInstruction({keys:c,programId:n,data:f})};
+//# sourceMappingURL=updateInstruction.cjs.map

package/dist/cjs/instructions/updateInstruction.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"updateInstruction.cjs","sources":["../../../src/instructions/updateInstruction.ts"],"sourcesContent":[null],"names":["nameProgramId","nameAccountKey","offset","input_data","nameUpdateSigner","buffers","Buffer","__exports","from","Int8Array","toBuffer","Numberu32","length","data","concat","keys","pubkey","isSigner","isWritable","TransactionInstruction","programId"],"mappings":"+KAIM,SACJA,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAU,CACdC,EAAMC,UAAAD,OAACE,KAAKC,UAAUD,KAAK,CAAC,KAC5BN,EAAOQ,WACP,IAAIC,YAAUR,EAAWS,QAAQF,WACjCP,GAGIU,EAAOP,EAAAA,UAAAA,OAAOQ,OAAOT,GACrBU,EAAO,CACX,CACEC,OAAQf,EACRgB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQZ,EACRa,UAAU,EACVC,YAAY,IAIhB,OAAO,IAAIC,EAAAA,uBAAuB,CAChCJ,OACAK,UAAWpB,EACXa,QAEJ"}

package/dist/cjs/int.cjs

@@ -0,0 +1,2 @@
+"use strict";require("./node_modules/buffer/index.cjs");var r=require("./error.cjs"),e=require("./_virtual/index.cjs");class t{constructor(r){this.value=BigInt(r)}toBuffer(){const r=e.__exports.Buffer.alloc(4);return r.writeUInt32LE(Number(this.value)),r}static fromBuffer(e){if(4!==e.length)throw new r.InvalidBufferLengthError(`Invalid buffer length: ${e.length}`);const u=BigInt(e.readUInt32LE(0));return new t(u)}toNumber(){return Number(this.value)}toString(){return String(this.value)}}class u{constructor(r){this.value=BigInt(r)}toBuffer(){const r=e.__exports.Buffer.alloc(8);return r.writeBigUInt64LE(this.value),r}static fromBuffer(e){8!==e.length&&new r.U64OverflowError(`Invalid buffer length: ${e.length}`);const t=e.readBigUInt64LE(0);return new u(t)}toNumber(){return Number(this.value)}toString(){return String(this.value)}}exports.Numberu32=t,exports.Numberu64=u;
+//# sourceMappingURL=int.cjs.map

package/dist/cjs/int.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"int.cjs","sources":["../../src/int.ts"],"sourcesContent":[null],"names":["Numberu32","constructor","value","this","BigInt","toBuffer","a","Buffer","alloc","writeUInt32LE","Number","fromBuffer","buffer","length","InvalidBufferLengthError","readUInt32LE","toNumber","toString","String","Numberu64","writeBigUInt64LE","U64OverflowError","readBigUInt64LE"],"mappings":"6HAEaA,EAGX,WAAAC,CAAYC,GACVC,KAAKD,MAAQE,OAAOF,EACrB,CAKD,QAAAG,GACE,MAAMC,EAAIC,EAAAA,UAAAA,OAAOC,MAAM,GAEvB,OADAF,EAAEG,cAAcC,OAAOP,KAAKD,QACrBI,CACR,CAKD,iBAAOK,CAAWC,GAChB,GAAsB,IAAlBA,EAAOC,OACT,MAAM,IAAIC,EAAwBA,yBAChC,0BAA0BF,EAAOC,UAIrC,MAAMX,EAAQE,OAAOQ,EAAOG,aAAa,IACzC,OAAO,IAAIf,EAAUE,EACtB,CAED,QAAAc,GACE,OAAON,OAAOP,KAAKD,MACpB,CAED,QAAAe,GACE,OAAOC,OAAOf,KAAKD,MACpB,QAGUiB,EAGX,WAAAlB,CAAYC,GACVC,KAAKD,MAAQE,OAAOF,EACrB,CAKD,QAAAG,GACE,MAAMC,EAAIC,EAAAA,UAAAA,OAAOC,MAAM,GAEvB,OADAF,EAAEc,iBAAiBjB,KAAKD,OACjBI,CACR,CAKD,iBAAOK,CAAWC,GACM,IAAlBA,EAAOC,QACT,IAAIQ,EAAAA,iBAAiB,0BAA0BT,EAAOC,UAGxD,MAAMX,EAAQU,EAAOU,gBAAgB,GACrC,OAAO,IAAIH,EAAUjB,EACtB,CAED,QAAAc,GACE,OAAON,OAAOP,KAAKD,MACpB,CAED,QAAAe,GACE,OAAOC,OAAOf,KAAKD,MACpB"}

package/dist/cjs/nft/const.cjs

@@ -0,0 +1,2 @@
+"use strict";var e=require("@solana/web3.js");require("../node_modules/buffer/index.cjs");var r=require("../_virtual/index.cjs");const s=new e.PublicKey("nftD3vbNkNqfj2Sd3HZwbpw4BxxKWr4AjGb9X38JeZk"),i=r.__exports.Buffer.from("tokenized_name");exports.MINT_PREFIX=i,exports.NAME_TOKENIZER_ID=s;
+//# sourceMappingURL=const.cjs.map

package/dist/cjs/nft/const.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"const.cjs","sources":["../../../src/nft/const.ts"],"sourcesContent":[null],"names":["NAME_TOKENIZER_ID","PublicKey","MINT_PREFIX","Buffer","from"],"mappings":"uIAGaA,EAAoB,IAAIC,EAASA,UAC5C,+CAGWC,EAAcC,EAAAA,UAAAA,OAAOC,KAAK"}

package/dist/cjs/nft/getDomainMint.cjs

@@ -0,0 +1,2 @@
+"use strict";var r=require("@solana/web3.js"),e=require("./const.cjs");exports.getDomainMint=s=>{const[t]=r.PublicKey.findProgramAddressSync([e.MINT_PREFIX,s.toBuffer()],e.NAME_TOKENIZER_ID);return t};
+//# sourceMappingURL=getDomainMint.cjs.map

package/dist/cjs/nft/getDomainMint.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"getDomainMint.cjs","sources":["../../../src/nft/getDomainMint.ts"],"sourcesContent":[null],"names":["domain","mint","PublicKey","findProgramAddressSync","MINT_PREFIX","toBuffer","NAME_TOKENIZER_ID"],"mappings":"6FAG8BA,IAC5B,MAAOC,GAAQC,EAASA,UAACC,uBACvB,CAACC,cAAaJ,EAAOK,YACrBC,EAAAA,mBAEF,OAAOL,CAAI"}

package/dist/cjs/nft/getRecordFromMint.cjs

@@ -0,0 +1,2 @@
+"use strict";var e=require("./const.cjs"),t=require("./state.cjs");exports.getRecordFromMint=async(s,r)=>{const c=[{dataSize:t.NftRecord.LEN},{memcmp:{offset:0,bytes:"3"}},{memcmp:{offset:66,bytes:r.toBase58()}}];return await s.getProgramAccounts(e.NAME_TOKENIZER_ID,{filters:c})};
+//# sourceMappingURL=getRecordFromMint.cjs.map

package/dist/cjs/nft/getRecordFromMint.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"getRecordFromMint.cjs","sources":["../../../src/nft/getRecordFromMint.ts"],"sourcesContent":[null],"names":["async","connection","mint","filters","dataSize","NftRecord","LEN","memcmp","offset","bytes","toBase58","getProgramAccounts","NAME_TOKENIZER_ID"],"mappings":"6FAeiCA,MAC/BC,EACAC,KAEA,MAAMC,EAAsC,CAC1C,CAAEC,SAAUC,EAASA,UAACC,KACtB,CACEC,OAAQ,CACNC,OAAQ,EACRC,MAAO,MAGX,CACEF,OAAQ,CACNC,OAAQ,GACRC,MAAOP,EAAKQ,cASlB,aAJqBT,EAAWU,mBAAmBC,EAAAA,kBAAmB,CACpET,WAGW"}

package/dist/cjs/nft/retrieveNftOwner.cjs

@@ -0,0 +1,2 @@
+"use strict";var e=require("@solana/web3.js"),t=require("./getDomainMint.cjs"),s=require("../node_modules/@solana/spl-token/lib/esm/state/mint.cjs"),n=require("../node_modules/@solana/spl-token/lib/esm/constants.cjs");exports.retrieveNftOwner=async(r,a)=>{try{const i=t.getDomainMint(a);if("0"===(await s.getMint(r,i)).supply.toString())return;const o=[{memcmp:{offset:0,bytes:i.toBase58()}},{memcmp:{offset:64,bytes:"2"}},{dataSize:165}],c=await r.getProgramAccounts(n.TOKEN_PROGRAM_ID,{filters:o});if(1!=c.length)return;return new e.PublicKey(c[0].account.data.slice(32,64))}catch{return}};
+//# sourceMappingURL=retrieveNftOwner.cjs.map

package/dist/cjs/nft/retrieveNftOwner.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"retrieveNftOwner.cjs","sources":["../../../src/nft/retrieveNftOwner.ts"],"sourcesContent":[null],"names":["async","connection","nameAccount","mint","getDomainMint","getMint","supply","toString","filters","memcmp","offset","bytes","toBase58","dataSize","result","getProgramAccounts","TOKEN_PROGRAM_ID","length","PublicKey","account","data","slice"],"mappings":"mPAegCA,MAC9BC,EACAC,KAEA,IACE,MAAMC,EAAOC,gBAAcF,GAG3B,GAAmC,aADZG,EAAAA,QAAQJ,EAAYE,IAC9BG,OAAOC,WAClB,OAGF,MAAMC,EAAsC,CAC1C,CACEC,OAAQ,CACNC,OAAQ,EACRC,MAAOR,EAAKS,aAGhB,CACEH,OAAQ,CACNC,OAAQ,GACRC,MAAO,MAGX,CAAEE,SAAU,MAGRC,QAAeb,EAAWc,mBAAmBC,EAAAA,iBAAkB,CACnER,YAGF,GAAqB,GAAjBM,EAAOG,OACT,OAGF,OAAO,IAAIC,EAASA,UAACJ,EAAO,GAAGK,QAAQC,KAAKC,MAAM,GAAI,IACvD,CAAC,MACA,MACD"}

package/dist/cjs/nft/retrieveNftOwnerV2.cjs

@@ -0,0 +1,2 @@
+"use strict";var t=require("@solana/web3.js"),e=require("./getDomainMint.cjs"),n=require("../node_modules/@solana/spl-token/lib/esm/state/account.cjs");exports.retrieveNftOwnerV2=async(r,o)=>{try{const t=e.getDomainMint(o),a=await r.getTokenLargestAccounts(t);if(0===a.value.length)return null;const s=await r.getAccountInfo(a.value[0].address);if(!s)return null;const u=n.AccountLayout.decode(s.data);return"1"===u.amount.toString()?u.owner:null}catch(e){if(e instanceof t.SolanaJSONRPCError&&-32602===e.code)return null;throw e}};
+//# sourceMappingURL=retrieveNftOwnerV2.cjs.map

package/dist/cjs/nft/retrieveNftOwnerV2.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"retrieveNftOwnerV2.cjs","sources":["../../../src/nft/retrieveNftOwnerV2.ts"],"sourcesContent":[null],"names":["async","connection","nameAccount","mint","getDomainMint","largestAccounts","getTokenLargestAccounts","value","length","largestAccountInfo","getAccountInfo","address","decoded","AccountLayout","decode","data","amount","toString","owner","err","SolanaJSONRPCError","code"],"mappings":"mLAIkCA,MAChCC,EACAC,KAEA,IACE,MAAMC,EAAOC,gBAAcF,GAErBG,QAAwBJ,EAAWK,wBAAwBH,GACjE,GAAqC,IAAjCE,EAAgBE,MAAMC,OACxB,OAAO,KAGT,MAAMC,QAA2BR,EAAWS,eAC1CL,EAAgBE,MAAM,GAAGI,SAG3B,IAAKF,EACH,OAAO,KAGT,MAAMG,EAAUC,EAAaA,cAACC,OAAOL,EAAmBM,MACxD,MAAkC,MAA9BH,EAAQI,OAAOC,WACVL,EAAQM,MAEV,IACR,CAAC,MAAOC,GACP,GAAIA,aAAeC,EAAkBA,qBAAkB,QAAdD,EAAIE,KAE3C,OAAO,KAET,MAAMF,CACP"}

package/dist/cjs/nft/retrieveNfts.cjs

@@ -0,0 +1,2 @@
+"use strict";var e=require("@solana/web3.js"),t=require("./const.cjs"),r=require("./state.cjs");exports.retrieveNfts=async s=>{const a=[{dataSize:r.NftRecord.LEN},{memcmp:{offset:0,bytes:"3"}}],c=await s.getProgramAccounts(t.NAME_TOKENIZER_ID,{filters:a});return c.map((t=>new e.PublicKey(t.account.data.slice(66,98))))};
+//# sourceMappingURL=retrieveNfts.cjs.map

package/dist/cjs/nft/retrieveNfts.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"retrieveNfts.cjs","sources":["../../../src/nft/retrieveNfts.ts"],"sourcesContent":[null],"names":["async","connection","filters","dataSize","NftRecord","LEN","memcmp","offset","bytes","result","getProgramAccounts","NAME_TOKENIZER_ID","map","e","PublicKey","account","data","slice"],"mappings":"qHAc4BA,MAAOC,IACjC,MAAMC,EAAsC,CAC1C,CAAEC,SAAUC,EAASA,UAACC,KACtB,CACEC,OAAQ,CACNC,OAAQ,EACRC,MAAO,OAKPC,QAAeR,EAAWS,mBAAmBC,EAAAA,kBAAmB,CACpET,YAGF,OAAOO,EAAOG,KACXC,GAAM,IAAIC,EAASA,UAACD,EAAEE,QAAQC,KAAKC,MAFvB,GAEqCV,MACnD"}

package/dist/cjs/nft/retrieveRecords.cjs

@@ -0,0 +1,2 @@
+"use strict";var e=require("./state.cjs"),t=require("./getRecordFromMint.cjs"),s=require("../node_modules/@solana/spl-token/lib/esm/constants.cjs"),a=require("../node_modules/@solana/spl-token/lib/esm/state/account.cjs");const o=e=>[{memcmp:{offset:32,bytes:e}},{memcmp:{offset:64,bytes:"2"}}];exports.retrieveRecords=async(r,c)=>{const n=[...o(c.toBase58()),{dataSize:165}],i=(await r.getProgramAccounts(s.TOKEN_PROGRAM_ID,{filters:n})).map((e=>a.AccountLayout.decode(e.account.data))).map((s=>(async(s,a)=>{const o=await t.getRecordFromMint(s,a.mint);if(1===o.length)return e.NftRecord.deserialize(o[0].account.data)})(r,s)));return(await Promise.all(i)).filter((e=>void 0!==e))};
+//# sourceMappingURL=retrieveRecords.cjs.map

package/dist/cjs/nft/retrieveRecords.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"retrieveRecords.cjs","sources":["../../../src/nft/retrieveRecords.ts"],"sourcesContent":[null],"names":["getFilter","owner","memcmp","offset","bytes","async","connection","filters","toBase58","dataSize","promises","getProgramAccounts","TOKEN_PROGRAM_ID","map","e","AccountLayout","decode","account","data","acc","record","getRecordFromMint","mint","length","NftRecord","deserialize","closure","Promise","all","filter","undefined"],"mappings":"6NAUA,MAAMA,EAAaC,GACe,CAC9B,CACEC,OAAQ,CAAEC,OAAQ,GAAIC,MAAOH,IAE/B,CAAEC,OAAQ,CAAEC,OAAQ,GAAIC,MAAO,+BAYJC,MAC7BC,EACAL,KAEA,MAAMM,EAAsC,IACvCP,EAAUC,EAAMO,YACnB,CAAEC,SAAU,MAQRC,SANeJ,EAAWK,mBAAmBC,EAAAA,iBAAkB,CACnEL,aAGuBM,KAAKC,GAAMC,gBAAcC,OAAOF,EAAEG,QAAQC,QAExCL,KAAKM,GArBlBd,OAAOC,EAAwBa,KAC7C,MAAMC,QAAeC,EAAiBA,kBAACf,EAAYa,EAAIG,MACvD,GAAsB,IAAlBF,EAAOG,OACT,OAAOC,EAAAA,UAAUC,YAAYL,EAAO,GAAGH,QAAQC,KAChD,EAiBuCQ,CAAQpB,EAAYa,KAG5D,aAFsBQ,QAAQC,IAAIlB,IAEnBmB,QAAQf,QAAYgB,IAANhB,GAA+B"}

package/dist/cjs/nft/state.cjs

@@ -0,0 +1,2 @@
+"use strict";var e=require("../node_modules/borsh/lib/esm/index.cjs"),r=require("@solana/web3.js");require("../node_modules/buffer/index.cjs");var t,n=require("../error.cjs"),i=require("../_virtual/index.cjs");exports.Tag=void 0,(t=exports.Tag||(exports.Tag={}))[t.Uninitialized=0]="Uninitialized",t[t.CentralState=1]="CentralState",t[t.ActiveRecord=2]="ActiveRecord",t[t.InactiveRecord=3]="InactiveRecord";class a{constructor(e){this.tag=e.tag,this.nonce=e.nonce,this.nameAccount=new r.PublicKey(e.nameAccount),this.owner=new r.PublicKey(e.owner),this.nftMint=new r.PublicKey(e.nftMint)}static deserialize(r){return new a(e.deserialize(this.schema,r))}static async retrieve(e,r){const t=await e.getAccountInfo(r);if(!t||!t.data)throw new n.NftRecordNotFoundError("NFT record not found: "+r.toBase58());return this.deserialize(t.data)}static async findKey(e,t){return await r.PublicKey.findProgramAddress([i.__exports.Buffer.from("nft_record"),e.toBuffer()],t)}static findKeySync(e,t){return r.PublicKey.findProgramAddressSync([i.__exports.Buffer.from("nft_record"),e.toBuffer()],t)}}a.LEN=98,a.schema={struct:{tag:"u8",nonce:"u8",nameAccount:{array:{type:"u8",len:32}},owner:{array:{type:"u8",len:32}},nftMint:{array:{type:"u8",len:32}}}},exports.NftRecord=a;
+//# sourceMappingURL=state.cjs.map

package/dist/cjs/nft/state.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"state.cjs","sources":["../../../src/nft/state.ts"],"sourcesContent":[null],"names":["Tag","NftRecord","constructor","obj","this","tag","nonce","nameAccount","PublicKey","owner","nftMint","deserialize","data","schema","retrieve","connection","key","accountInfo","getAccountInfo","NftRecordNotFoundError","toBase58","findKey","programId","findProgramAddress","Buffer","__exports","from","toBuffer","findKeySync","findProgramAddressSync","LEN","struct","array","type","len"],"mappings":"mJAKYA,+DAAAA,QAKXA,SAAA,GALWA,EAAAA,cAAAA,QAAAA,IAKX,CAAA,IAJCA,EAAA,cAAA,GAAA,gBACAA,EAAAA,EAAA,aAAA,GAAA,eACAA,EAAAA,EAAA,aAAA,GAAA,eACAA,EAAAA,EAAA,eAAA,GAAA,uBAGWC,EAmBX,WAAAC,CAAYC,GAOVC,KAAKC,IAAMF,EAAIE,IACfD,KAAKE,MAAQH,EAAIG,MACjBF,KAAKG,YAAc,IAAIC,EAASA,UAACL,EAAII,aACrCH,KAAKK,MAAQ,IAAID,EAASA,UAACL,EAAIM,OAC/BL,KAAKM,QAAU,IAAIF,EAASA,UAACL,EAAIO,QAClC,CAED,kBAAOC,CAAYC,GACjB,OAAO,IAAIX,EAAUU,EAAWA,YAACP,KAAKS,OAAQD,GAC/C,CAED,qBAAaE,CAASC,EAAwBC,GAC5C,MAAMC,QAAoBF,EAAWG,eAAeF,GACpD,IAAKC,IAAgBA,EAAYL,KAC/B,MAAM,IAAIO,EAAAA,uBACR,yBAA2BH,EAAII,YAGnC,OAAOhB,KAAKO,YAAYM,EAAYL,KACrC,CACD,oBAAaS,CAAQd,EAAwBe,GAC3C,aAAad,EAASA,UAACe,mBACrB,CAACC,EAAMC,UAAAD,OAACE,KAAK,cAAenB,EAAYoB,YACxCL,EAEH,CACD,kBAAOM,CAAYrB,EAAwBe,GACzC,OAAOd,YAAUqB,uBACf,CAACL,EAAAA,UAAAA,OAAOE,KAAK,cAAenB,EAAYoB,YACxCL,EAEH,EAlDMrB,EAAG6B,IAAG,GAEN7B,EAAAY,OAAS,CACdkB,OAAQ,CACN1B,IAAK,KACLC,MAAO,KACPC,YAAa,CAAEyB,MAAO,CAAEC,KAAM,KAAMC,IAAK,KACzCzB,MAAO,CAAEuB,MAAO,CAAEC,KAAM,KAAMC,IAAK,KACnCxB,QAAS,CAAEsB,MAAO,CAAEC,KAAM,KAAMC,IAAK"}

package/dist/cjs/node_modules/@bonfida/sns-records/dist/index.cjs

@@ -0,0 +1,2 @@
+"use strict";var e,t=require("@solana/web3.js"),r=["u8","u16","u32","u64","u128","i8","i16","i32","i64","i128","f32","f64"],i=function(){function e(){this.offset=0,this.buffer_size=256,this.buffer=new ArrayBuffer(this.buffer_size),this.view=new DataView(this.buffer)}return e.prototype.resize_if_necessary=function(e){if(this.buffer_size-this.offset<e){this.buffer_size=Math.max(2*this.buffer_size,this.buffer_size+e);var t=new ArrayBuffer(this.buffer_size);new Uint8Array(t).set(new Uint8Array(this.buffer)),this.buffer=t,this.view=new DataView(t)}},e.prototype.get_used_buffer=function(){return new Uint8Array(this.buffer).slice(0,this.offset)},e.prototype.store_value=function(e,t){var r=t.substring(1),i=parseInt(r)/8;this.resize_if_necessary(i);var n="f"===t[0]?"setFloat".concat(r):"i"===t[0]?"setInt".concat(r):"setUint".concat(r);this.view[n](this.offset,e,!0),this.offset+=i},e.prototype.store_bytes=function(e){this.resize_if_necessary(e.length),new Uint8Array(this.buffer).set(new Uint8Array(e),this.offset),this.offset+=e.length},e}(),n=function(){function e(e){this.offset=0,this.buffer_size=e.length,this.buffer=new ArrayBuffer(e.length),new Uint8Array(this.buffer).set(e),this.view=new DataView(this.buffer)}return e.prototype.assert_enough_buffer=function(e){if(this.offset+e>this.buffer.byteLength)throw new Error("Error in schema, the buffer is smaller than expected")},e.prototype.consume_value=function(e){var t=e.substring(1),r=parseInt(t)/8;this.assert_enough_buffer(r);var i="f"===e[0]?"getFloat".concat(t):"i"===e[0]?"getInt".concat(t):"getUint".concat(t),n=this.view[i](this.offset,!0);return this.offset+=r,n},e.prototype.consume_bytes=function(e){this.assert_enough_buffer(e);var t=this.buffer.slice(this.offset,this.offset+e);return this.offset+=e,t},e}(),s=(e=function(t,r){return e=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(e,t){e.__proto__=t}||function(e,t){for(var r in t)Object.prototype.hasOwnProperty.call(t,r)&&(e[r]=t[r])},e(t,r)},function(t,r){if("function"!=typeof r&&null!==r)throw new TypeError("Class extends value "+String(r)+" is not a constructor or null");function i(){this.constructor=t}e(t,r),t.prototype=null===r?Object.create(r):(i.prototype=r.prototype,new i)});function o(e,t,r){if(typeof e!==t)throw new Error("Expected ".concat(t," not ").concat(typeof e,"(").concat(e,") at ").concat(r.join(".")))}function a(e,t,r){if(e!==t)throw new Error("Array length ".concat(e," does not match schema length ").concat(t," at ").concat(r.join(".")))}var u=r.concat(["bool","string"]),c=["option","enum","array","set","map","struct"],h=function(e){function t(t,r){var i="Invalid schema: ".concat(JSON.stringify(t)," expected ").concat(r);return e.call(this,i)||this}return s(t,e),t}(Error);function f(e){if("string"!=typeof e||!u.includes(e)){if(e&&"object"==typeof e){var t=Object.keys(e);if(1===t.length&&c.includes(t[0])){var r=t[0];if("option"===r)return f(e[r]);if("enum"===r)return function(e){if(!Array.isArray(e))throw new h(e,"Array");for(var t=0,r=e;t<r.length;t++){var i=r[t];if("object"!=typeof i||!("struct"in i))throw new Error('Missing "struct" key in enum schema');if("object"!=typeof i.struct||1!==Object.keys(i.struct).length)throw new Error('The "struct" in each enum must have a single key');f({struct:i.struct})}}(e[r]);if("array"===r)return function(e){if("object"!=typeof e)throw new h(e,"{ type, len? }");if(e.len&&"number"!=typeof e.len)throw new Error("Invalid schema: ".concat(e));if("type"in e)return f(e.type);throw new h(e,"{ type, len? }")}(e[r]);if("set"===r)return f(e[r]);if("map"===r)return function(e){if("object"!=typeof e||!("key"in e)||!("value"in e))throw new h(e,"{ key, value }");f(e.key),f(e.value)}(e[r]);if("struct"===r)return function(e){if("object"!=typeof e)throw new h(e,"object");for(var t in e)f(e[t])}(e[r])}}throw new h(e,c.join(", ")+" or "+u.join(", "))}}var d=function(){function e(e){this.encoded=new i,this.fieldPath=["value"],this.checkTypes=e}return e.prototype.encode=function(e,t){return this.encode_value(e,t),this.encoded.get_used_buffer()},e.prototype.encode_value=function(e,t){if("string"==typeof t){if(r.includes(t))return this.encode_integer(e,t);if("string"===t)return this.encode_string(e);if("bool"===t)return this.encode_boolean(e)}if("object"==typeof t){if("option"in t)return this.encode_option(e,t);if("enum"in t)return this.encode_enum(e,t);if("array"in t)return this.encode_array(e,t);if("set"in t)return this.encode_set(e,t);if("map"in t)return this.encode_map(e,t);if("struct"in t)return this.encode_struct(e,t)}},e.prototype.encode_integer=function(e,t){var r=parseInt(t.substring(1));r<=32||"f64"==t?(this.checkTypes&&o(e,"number",this.fieldPath),this.encoded.store_value(e,t)):(this.checkTypes&&function(e,t){if(!(["number","string","bigint","boolean"].includes(typeof e)||"object"==typeof e&&null!==e&&"toString"in e))throw new Error("Expected bigint, number, boolean or string not ".concat(typeof e,"(").concat(e,") at ").concat(t.join(".")))}(e,this.fieldPath),this.encode_bigint(BigInt(e),r))},e.prototype.encode_bigint=function(e,t){for(var r=t/8,i=new Uint8Array(r),n=0;n<r;n++)i[n]=Number(e&BigInt(255)),e>>=BigInt(8);this.encoded.store_bytes(new Uint8Array(i))},e.prototype.encode_string=function(e){this.checkTypes&&o(e,"string",this.fieldPath);var t=e;this.encoded.store_value(t.length,"u32");for(var r=0;r<t.length;r++)this.encoded.store_value(t.charCodeAt(r),"u8")},e.prototype.encode_boolean=function(e){this.checkTypes&&o(e,"boolean",this.fieldPath),this.encoded.store_value(e?1:0,"u8")},e.prototype.encode_option=function(e,t){null==e?this.encoded.store_value(0,"u8"):(this.encoded.store_value(1,"u8"),this.encode_value(e,t.option))},e.prototype.encode_enum=function(e,t){this.checkTypes&&function(e,t){if("object"!=typeof e||null===e)throw new Error("Expected object not ".concat(typeof e,"(").concat(e,") at ").concat(t.join(".")))}(e,this.fieldPath);for(var r=Object.keys(e)[0],i=0;i<t.enum.length;i++){var n=t.enum[i];if(r===Object.keys(n.struct)[0])return this.encoded.store_value(i,"u8"),this.encode_struct(e,n)}throw new Error("Enum key (".concat(r,") not found in enum schema: ").concat(JSON.stringify(t)," at ").concat(this.fieldPath.join(".")))},e.prototype.encode_array=function(e,t){if(function(e){return Array.isArray(e)||!!e&&"object"==typeof e&&"length"in e&&"number"==typeof e.length&&(0===e.length||e.length>0&&e.length-1 in e)}(e))return this.encode_arraylike(e,t);if(e instanceof ArrayBuffer)return this.encode_buffer(e,t);throw new Error("Expected Array-like not ".concat(typeof e,"(").concat(e,") at ").concat(this.fieldPath.join(".")))},e.prototype.encode_arraylike=function(e,t){t.array.len?a(e.length,t.array.len,this.fieldPath):this.encoded.store_value(e.length,"u32");for(var r=0;r<e.length;r++)this.encode_value(e[r],t.array.type)},e.prototype.encode_buffer=function(e,t){t.array.len?a(e.byteLength,t.array.len,this.fieldPath):this.encoded.store_value(e.byteLength,"u32"),this.encoded.store_bytes(new Uint8Array(e))},e.prototype.encode_set=function(e,t){this.checkTypes&&o(e,"object",this.fieldPath);var r=e instanceof Set?Array.from(e.values()):Object.values(e);this.encoded.store_value(r.length,"u32");for(var i=0,n=r;i<n.length;i++){var s=n[i];this.encode_value(s,t.set)}},e.prototype.encode_map=function(e,t){this.checkTypes&&o(e,"object",this.fieldPath);var r=e instanceof Map,i=r?Array.from(e.keys()):Object.keys(e);this.encoded.store_value(i.length,"u32");for(var n=0,s=i;n<s.length;n++){var a=s[n];this.encode_value(a,t.map.key),this.encode_value(r?e.get(a):e[a],t.map.value)}},e.prototype.encode_struct=function(e,t){this.checkTypes&&o(e,"object",this.fieldPath);for(var r=0,i=Object.keys(t.struct);r<i.length;r++){var n=i[r];this.fieldPath.push(n),this.encode_value(e[n],t.struct[n]),this.fieldPath.pop()}},e}(),p=function(){function e(e){this.buffer=new n(e)}return e.prototype.decode=function(e){return this.decode_value(e)},e.prototype.decode_value=function(e){if("string"==typeof e){if(r.includes(e))return this.decode_integer(e);if("string"===e)return this.decode_string();if("bool"===e)return this.decode_boolean()}if("object"==typeof e){if("option"in e)return this.decode_option(e);if("enum"in e)return this.decode_enum(e);if("array"in e)return this.decode_array(e);if("set"in e)return this.decode_set(e);if("map"in e)return this.decode_map(e);if("struct"in e)return this.decode_struct(e)}throw new Error("Unsupported type: ".concat(e))},e.prototype.decode_integer=function(e){var t=parseInt(e.substring(1));return t<=32||"f64"==e?this.buffer.consume_value(e):this.decode_bigint(t,e.startsWith("i"))},e.prototype.decode_bigint=function(e,t){void 0===t&&(t=!1);var r=e/8,i=new Uint8Array(this.buffer.consume_bytes(r)),n=i.reduceRight((function(e,t){return e+t.toString(16).padStart(2,"0")}),"");return t&&i[r-1]?BigInt.asIntN(e,BigInt("0x".concat(n))):BigInt("0x".concat(n))},e.prototype.decode_string=function(){var e=this.decode_integer("u32"),t=new Uint8Array(this.buffer.consume_bytes(e));return String.fromCharCode.apply(null,t)},e.prototype.decode_boolean=function(){return this.buffer.consume_value("u8")>0},e.prototype.decode_option=function(e){var t=this.buffer.consume_value("u8");if(1===t)return this.decode_value(e.option);if(0!==t)throw new Error("Invalid option ".concat(t));return null},e.prototype.decode_enum=function(e){var t,r=this.buffer.consume_value("u8");if(r>e.enum.length)throw new Error("Enum option ".concat(r," is not available"));var i=e.enum[r].struct,n=Object.keys(i)[0];return(t={})[n]=this.decode_value(i[n]),t},e.prototype.decode_array=function(e){for(var t=[],r=e.array.len?e.array.len:this.decode_integer("u32"),i=0;i<r;++i)t.push(this.decode_value(e.array.type));return t},e.prototype.decode_set=function(e){for(var t=this.decode_integer("u32"),r=new Set,i=0;i<t;++i)r.add(this.decode_value(e.set));return r},e.prototype.decode_map=function(e){for(var t=this.decode_integer("u32"),r=new Map,i=0;i<t;++i){var n=this.decode_value(e.map.key),s=this.decode_value(e.map.value);r.set(n,s)}return r},e.prototype.decode_struct=function(e){var t={};for(var r in e.struct)t[r]=this.decode_value(e.struct[r]);return t},e}();function l(e,t,r){return void 0===r&&(r=!0),r&&f(e),new d(r).encode(t,e)}class y{constructor(e){this.tag=1,this.record=e.record,this.content=e.content}serialize(){return l(y.schema,this)}getInstruction(e,r,i,n,s,o,a,u){const c=Buffer.from(this.serialize());let h=[];return h.push({pubkey:r,isSigner:!1,isWritable:!1}),h.push({pubkey:i,isSigner:!1,isWritable:!1}),h.push({pubkey:n,isSigner:!0,isWritable:!0}),h.push({pubkey:s,isSigner:!1,isWritable:!0}),h.push({pubkey:o,isSigner:!1,isWritable:!0}),h.push({pubkey:a,isSigner:!0,isWritable:!0}),h.push({pubkey:u,isSigner:!1,isWritable:!1}),new t.TransactionInstruction({keys:h,programId:e,data:c})}}y.schema={struct:{tag:"u8",record:"string",content:{array:{type:"u8"}}}};class g{constructor(e){this.tag=4,this.validation=e.validation,this.signature=e.signature,this.expectedPubkey=e.expectedPubkey}serialize(){return l(g.schema,this)}getInstruction(e,r,i,n,s,o,a,u){const c=Buffer.from(this.serialize());let h=[];return h.push({pubkey:r,isSigner:!1,isWritable:!1}),h.push({pubkey:i,isSigner:!1,isWritable:!1}),h.push({pubkey:n,isSigner:!0,isWritable:!0}),h.push({pubkey:s,isSigner:!1,isWritable:!0}),h.push({pubkey:o,isSigner:!1,isWritable:!0}),h.push({pubkey:a,isSigner:!0,isWritable:!0}),h.push({pubkey:u,isSigner:!1,isWritable:!1}),new t.TransactionInstruction({keys:h,programId:e,data:c})}}g.schema={struct:{tag:"u8",validation:"u8",signature:{array:{type:"u8"}},expectedPubkey:{array:{type:"u8"}}}};class b{constructor(e){this.tag=3,this.staleness=e.staleness}serialize(){return l(b.schema,this)}getInstruction(e,r,i,n,s,o,a,u,c){const h=Buffer.from(this.serialize());let f=[];return f.push({pubkey:r,isSigner:!1,isWritable:!1}),f.push({pubkey:i,isSigner:!1,isWritable:!1}),f.push({pubkey:n,isSigner:!0,isWritable:!0}),f.push({pubkey:s,isSigner:!1,isWritable:!0}),f.push({pubkey:o,isSigner:!1,isWritable:!0}),f.push({pubkey:a,isSigner:!1,isWritable:!0}),f.push({pubkey:u,isSigner:!1,isWritable:!1}),f.push({pubkey:c,isSigner:!0,isWritable:!0}),new t.TransactionInstruction({keys:f,programId:e,data:h})}}b.schema={struct:{tag:"u8",staleness:"bool"}};class _{constructor(e){this.tag=2,this.record=e.record,this.content=e.content}serialize(){return l(_.schema,this)}getInstruction(e,r,i,n,s,o,a,u){const c=Buffer.from(this.serialize());let h=[];return h.push({pubkey:r,isSigner:!1,isWritable:!1}),h.push({pubkey:i,isSigner:!1,isWritable:!1}),h.push({pubkey:n,isSigner:!0,isWritable:!0}),h.push({pubkey:s,isSigner:!1,isWritable:!0}),h.push({pubkey:o,isSigner:!1,isWritable:!0}),h.push({pubkey:a,isSigner:!0,isWritable:!0}),h.push({pubkey:u,isSigner:!1,isWritable:!1}),new t.TransactionInstruction({keys:h,programId:e,data:c})}}_.schema={struct:{tag:"u8",record:"string",content:{array:{type:"u8"}}}};class v{constructor(){this.tag=5}serialize(){return l(v.schema,this)}getInstruction(e,r,i,n,s,o,a,u){const c=Buffer.from(this.serialize());let h=[];return h.push({pubkey:r,isSigner:!1,isWritable:!1}),h.push({pubkey:i,isSigner:!1,isWritable:!1}),h.push({pubkey:n,isSigner:!0,isWritable:!0}),h.push({pubkey:s,isSigner:!1,isWritable:!0}),h.push({pubkey:o,isSigner:!1,isWritable:!0}),h.push({pubkey:a,isSigner:!0,isWritable:!0}),h.push({pubkey:u,isSigner:!1,isWritable:!1}),new t.TransactionInstruction({keys:h,programId:e,data:c})}}v.schema={struct:{tag:"u8"}};class m{constructor(e){this.tag=6,this.roaId=e.roaId}serialize(){return l(m.schema,this)}getInstruction(e,r,i,n,s,o,a,u){const c=Buffer.from(this.serialize());let h=[];return h.push({pubkey:r,isSigner:!1,isWritable:!1}),h.push({pubkey:i,isSigner:!1,isWritable:!1}),h.push({pubkey:n,isSigner:!0,isWritable:!0}),h.push({pubkey:s,isSigner:!1,isWritable:!0}),h.push({pubkey:o,isSigner:!1,isWritable:!0}),h.push({pubkey:a,isSigner:!0,isWritable:!0}),h.push({pubkey:u,isSigner:!1,isWritable:!1}),new t.TransactionInstruction({keys:h,programId:e,data:c})}}m.schema={struct:{tag:"u8",roaId:{array:{type:"u8"}}}};const w=new t.PublicKey("HP3D4D1ZCmohQGFVms2SS4LCANgJyksBf5s1F77FuFjZ"),[k]=t.PublicKey.findProgramAddressSync([w.toBuffer()],w);var S;exports.Validation=void 0,(S=exports.Validation||(exports.Validation={}))[S.None=0]="None",S[S.Solana=1]="Solana",S[S.Ethereum=2]="Ethereum",S[S.UnverifiedSolana=3]="UnverifiedSolana";const I=e=>{switch(e){case exports.Validation.None:return 0;case exports.Validation.Ethereum:return 20;case exports.Validation.Solana:case exports.Validation.UnverifiedSolana:return 32;default:throw new Error("Invalid validation enum")}};class A{constructor(e){this.stalenessValidation=e.stalenessValidation,this.rightOfAssociationValidation=e.rightOfAssociationValidation,this.contentLength=e.contentLength}static deserialize(e){return new A((t=this.schema,r=e,void 0===(i=!0)&&(i=!0),i&&f(t),new p(r).decode(t)));var t,r,i}static async retrieve(e,t){const r=await e.getAccountInfo(t);if(!r||!r.data)throw new Error("Record header account not found");return this.deserialize(r.data.slice(96,96+this.LEN))}}A.LEN=8,A.schema={struct:{stalenessValidation:"u16",rightOfAssociationValidation:"u16",contentLength:"u32"}};class W{constructor(e,t){this.data=t,this.header=e}static deserialize(e){const t=A.deserialize(e.slice(96,96+A.LEN)),r=e.slice(96+A.LEN);return new W(t,r)}static async retrieve(e,t){const r=await e.getAccountInfo(t);if(!r||!r.data)throw new Error("Record header account not found");return this.deserialize(r.data)}static async retrieveBatch(e,t){return(await e.getMultipleAccountsInfo(t)).map((e=>{if(null==e?void 0:e.data)return this.deserialize(e.data)}))}getContent(){let e=I(this.header.stalenessValidation)+I(this.header.rightOfAssociationValidation);return this.data.slice(e)}getStalenessId(){let e=I(this.header.stalenessValidation);return this.data.slice(0,e)}getRoAId(){let e=I(this.header.stalenessValidation),t=e+I(this.header.rightOfAssociationValidation);return this.data.slice(e,t)}}exports.CENTRAL_STATE_SNS_RECORDS=k,exports.Record=W,exports.RecordHeader=A,exports.SNS_RECORDS_ID=w,exports.allocateAndPostRecord=(e,r,i,n,s,o,a,u)=>new y({record:o,content:Array.from(a)}).getInstruction(u,t.SystemProgram.programId,s,e,r,i,n,k),exports.allocateAndPostRecordInstruction=y,exports.deleteRecord=(e,r,i,n,s,o)=>(new v).getInstruction(o,t.SystemProgram.programId,s,e,n,r,i,k),exports.deleteRecordInstruction=v,exports.editRecord=(e,r,i,n,s,o,a,u)=>new _({record:o,content:Array.from(a)}).getInstruction(u,t.SystemProgram.programId,s,e,r,i,n,k),exports.editRecordInstruction=_,exports.getValidationLength=I,exports.validateEthSignature=(e,r,i,n,s,o,a,u,c)=>new g({validation:o,signature:Array.from(a),expectedPubkey:Array.from(u)}).getInstruction(c,t.SystemProgram.programId,s,e,r,i,n,k),exports.validateEthereumSignatureInstruction=g,exports.validateSolanaSignature=(e,r,i,n,s,o,a,u)=>new b({staleness:a}).getInstruction(u,t.SystemProgram.programId,o,e,r,i,n,k,s),exports.validateSolanaSignatureInstruction=b,exports.writeRoa=(e,r,i,n,s,o,a)=>new m({roaId:Array.from(o.toBuffer())}).getInstruction(a,t.SystemProgram.programId,r,e,i,n,s,k),exports.writeRoaInstruction=m;
+//# sourceMappingURL=index.cjs.map

package/dist/cjs/node_modules/@bonfida/sns-records/dist/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","sources":["../../../../../../node_modules/@bonfida/sns-records/dist/index.mjs"],"sourcesContent":["import{TransactionInstruction as e,PublicKey as t,SystemProgram as r}from\"@solana/web3.js\";var i,n=[\"u8\",\"u16\",\"u32\",\"u64\",\"u128\",\"i8\",\"i16\",\"i32\",\"i64\",\"i128\",\"f32\",\"f64\"],s=function(){function e(){this.offset=0,this.buffer_size=256,this.buffer=new ArrayBuffer(this.buffer_size),this.view=new DataView(this.buffer)}return e.prototype.resize_if_necessary=function(e){if(this.buffer_size-this.offset<e){this.buffer_size=Math.max(2*this.buffer_size,this.buffer_size+e);var t=new ArrayBuffer(this.buffer_size);new Uint8Array(t).set(new Uint8Array(this.buffer)),this.buffer=t,this.view=new DataView(t)}},e.prototype.get_used_buffer=function(){return new Uint8Array(this.buffer).slice(0,this.offset)},e.prototype.store_value=function(e,t){var r=t.substring(1),i=parseInt(r)/8;this.resize_if_necessary(i);var n=\"f\"===t[0]?\"setFloat\".concat(r):\"i\"===t[0]?\"setInt\".concat(r):\"setUint\".concat(r);this.view[n](this.offset,e,!0),this.offset+=i},e.prototype.store_bytes=function(e){this.resize_if_necessary(e.length),new Uint8Array(this.buffer).set(new Uint8Array(e),this.offset),this.offset+=e.length},e}(),o=function(){function e(e){this.offset=0,this.buffer_size=e.length,this.buffer=new ArrayBuffer(e.length),new Uint8Array(this.buffer).set(e),this.view=new DataView(this.buffer)}return e.prototype.assert_enough_buffer=function(e){if(this.offset+e>this.buffer.byteLength)throw new Error(\"Error in schema, the buffer is smaller than expected\")},e.prototype.consume_value=function(e){var t=e.substring(1),r=parseInt(t)/8;this.assert_enough_buffer(r);var i=\"f\"===e[0]?\"getFloat\".concat(t):\"i\"===e[0]?\"getInt\".concat(t):\"getUint\".concat(t),n=this.view[i](this.offset,!0);return this.offset+=r,n},e.prototype.consume_bytes=function(e){this.assert_enough_buffer(e);var t=this.buffer.slice(this.offset,this.offset+e);return this.offset+=e,t},e}(),a=(i=function(e,t){return i=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(e,t){e.__proto__=t}||function(e,t){for(var r in t)Object.prototype.hasOwnProperty.call(t,r)&&(e[r]=t[r])},i(e,t)},function(e,t){if(\"function\"!=typeof t&&null!==t)throw new TypeError(\"Class extends value \"+String(t)+\" is not a constructor or null\");function r(){this.constructor=e}i(e,t),e.prototype=null===t?Object.create(t):(r.prototype=t.prototype,new r)});function u(e,t,r){if(typeof e!==t)throw new Error(\"Expected \".concat(t,\" not \").concat(typeof e,\"(\").concat(e,\") at \").concat(r.join(\".\")))}function c(e,t,r){if(e!==t)throw new Error(\"Array length \".concat(e,\" does not match schema length \").concat(t,\" at \").concat(r.join(\".\")))}var h=n.concat([\"bool\",\"string\"]),f=[\"option\",\"enum\",\"array\",\"set\",\"map\",\"struct\"],p=function(e){function t(t,r){var i=\"Invalid schema: \".concat(JSON.stringify(t),\" expected \").concat(r);return e.call(this,i)||this}return a(t,e),t}(Error);function l(e){if(\"string\"!=typeof e||!h.includes(e)){if(e&&\"object\"==typeof e){var t=Object.keys(e);if(1===t.length&&f.includes(t[0])){var r=t[0];if(\"option\"===r)return l(e[r]);if(\"enum\"===r)return function(e){if(!Array.isArray(e))throw new p(e,\"Array\");for(var t=0,r=e;t<r.length;t++){var i=r[t];if(\"object\"!=typeof i||!(\"struct\"in i))throw new Error('Missing \"struct\" key in enum schema');if(\"object\"!=typeof i.struct||1!==Object.keys(i.struct).length)throw new Error('The \"struct\" in each enum must have a single key');l({struct:i.struct})}}(e[r]);if(\"array\"===r)return function(e){if(\"object\"!=typeof e)throw new p(e,\"{ type, len? }\");if(e.len&&\"number\"!=typeof e.len)throw new Error(\"Invalid schema: \".concat(e));if(\"type\"in e)return l(e.type);throw new p(e,\"{ type, len? }\")}(e[r]);if(\"set\"===r)return l(e[r]);if(\"map\"===r)return function(e){if(\"object\"!=typeof e||!(\"key\"in e)||!(\"value\"in e))throw new p(e,\"{ key, value }\");l(e.key),l(e.value)}(e[r]);if(\"struct\"===r)return function(e){if(\"object\"!=typeof e)throw new p(e,\"object\");for(var t in e)l(e[t])}(e[r])}}throw new p(e,f.join(\", \")+\" or \"+h.join(\", \"))}}var d=function(){function e(e){this.encoded=new s,this.fieldPath=[\"value\"],this.checkTypes=e}return e.prototype.encode=function(e,t){return this.encode_value(e,t),this.encoded.get_used_buffer()},e.prototype.encode_value=function(e,t){if(\"string\"==typeof t){if(n.includes(t))return this.encode_integer(e,t);if(\"string\"===t)return this.encode_string(e);if(\"bool\"===t)return this.encode_boolean(e)}if(\"object\"==typeof t){if(\"option\"in t)return this.encode_option(e,t);if(\"enum\"in t)return this.encode_enum(e,t);if(\"array\"in t)return this.encode_array(e,t);if(\"set\"in t)return this.encode_set(e,t);if(\"map\"in t)return this.encode_map(e,t);if(\"struct\"in t)return this.encode_struct(e,t)}},e.prototype.encode_integer=function(e,t){var r=parseInt(t.substring(1));r<=32||\"f64\"==t?(this.checkTypes&&u(e,\"number\",this.fieldPath),this.encoded.store_value(e,t)):(this.checkTypes&&function(e,t){if(!([\"number\",\"string\",\"bigint\",\"boolean\"].includes(typeof e)||\"object\"==typeof e&&null!==e&&\"toString\"in e))throw new Error(\"Expected bigint, number, boolean or string not \".concat(typeof e,\"(\").concat(e,\") at \").concat(t.join(\".\")))}(e,this.fieldPath),this.encode_bigint(BigInt(e),r))},e.prototype.encode_bigint=function(e,t){for(var r=t/8,i=new Uint8Array(r),n=0;n<r;n++)i[n]=Number(e&BigInt(255)),e>>=BigInt(8);this.encoded.store_bytes(new Uint8Array(i))},e.prototype.encode_string=function(e){this.checkTypes&&u(e,\"string\",this.fieldPath);var t=e;this.encoded.store_value(t.length,\"u32\");for(var r=0;r<t.length;r++)this.encoded.store_value(t.charCodeAt(r),\"u8\")},e.prototype.encode_boolean=function(e){this.checkTypes&&u(e,\"boolean\",this.fieldPath),this.encoded.store_value(e?1:0,\"u8\")},e.prototype.encode_option=function(e,t){null==e?this.encoded.store_value(0,\"u8\"):(this.encoded.store_value(1,\"u8\"),this.encode_value(e,t.option))},e.prototype.encode_enum=function(e,t){this.checkTypes&&function(e,t){if(\"object\"!=typeof e||null===e)throw new Error(\"Expected object not \".concat(typeof e,\"(\").concat(e,\") at \").concat(t.join(\".\")))}(e,this.fieldPath);for(var r=Object.keys(e)[0],i=0;i<t.enum.length;i++){var n=t.enum[i];if(r===Object.keys(n.struct)[0])return this.encoded.store_value(i,\"u8\"),this.encode_struct(e,n)}throw new Error(\"Enum key (\".concat(r,\") not found in enum schema: \").concat(JSON.stringify(t),\" at \").concat(this.fieldPath.join(\".\")))},e.prototype.encode_array=function(e,t){if(function(e){return Array.isArray(e)||!!e&&\"object\"==typeof e&&\"length\"in e&&\"number\"==typeof e.length&&(0===e.length||e.length>0&&e.length-1 in e)}(e))return this.encode_arraylike(e,t);if(e instanceof ArrayBuffer)return this.encode_buffer(e,t);throw new Error(\"Expected Array-like not \".concat(typeof e,\"(\").concat(e,\") at \").concat(this.fieldPath.join(\".\")))},e.prototype.encode_arraylike=function(e,t){t.array.len?c(e.length,t.array.len,this.fieldPath):this.encoded.store_value(e.length,\"u32\");for(var r=0;r<e.length;r++)this.encode_value(e[r],t.array.type)},e.prototype.encode_buffer=function(e,t){t.array.len?c(e.byteLength,t.array.len,this.fieldPath):this.encoded.store_value(e.byteLength,\"u32\"),this.encoded.store_bytes(new Uint8Array(e))},e.prototype.encode_set=function(e,t){this.checkTypes&&u(e,\"object\",this.fieldPath);var r=e instanceof Set?Array.from(e.values()):Object.values(e);this.encoded.store_value(r.length,\"u32\");for(var i=0,n=r;i<n.length;i++){var s=n[i];this.encode_value(s,t.set)}},e.prototype.encode_map=function(e,t){this.checkTypes&&u(e,\"object\",this.fieldPath);var r=e instanceof Map,i=r?Array.from(e.keys()):Object.keys(e);this.encoded.store_value(i.length,\"u32\");for(var n=0,s=i;n<s.length;n++){var o=s[n];this.encode_value(o,t.map.key),this.encode_value(r?e.get(o):e[o],t.map.value)}},e.prototype.encode_struct=function(e,t){this.checkTypes&&u(e,\"object\",this.fieldPath);for(var r=0,i=Object.keys(t.struct);r<i.length;r++){var n=i[r];this.fieldPath.push(n),this.encode_value(e[n],t.struct[n]),this.fieldPath.pop()}},e}(),y=function(){function e(e){this.buffer=new o(e)}return e.prototype.decode=function(e){return this.decode_value(e)},e.prototype.decode_value=function(e){if(\"string\"==typeof e){if(n.includes(e))return this.decode_integer(e);if(\"string\"===e)return this.decode_string();if(\"bool\"===e)return this.decode_boolean()}if(\"object\"==typeof e){if(\"option\"in e)return this.decode_option(e);if(\"enum\"in e)return this.decode_enum(e);if(\"array\"in e)return this.decode_array(e);if(\"set\"in e)return this.decode_set(e);if(\"map\"in e)return this.decode_map(e);if(\"struct\"in e)return this.decode_struct(e)}throw new Error(\"Unsupported type: \".concat(e))},e.prototype.decode_integer=function(e){var t=parseInt(e.substring(1));return t<=32||\"f64\"==e?this.buffer.consume_value(e):this.decode_bigint(t,e.startsWith(\"i\"))},e.prototype.decode_bigint=function(e,t){void 0===t&&(t=!1);var r=e/8,i=new Uint8Array(this.buffer.consume_bytes(r)),n=i.reduceRight((function(e,t){return e+t.toString(16).padStart(2,\"0\")}),\"\");return t&&i[r-1]?BigInt.asIntN(e,BigInt(\"0x\".concat(n))):BigInt(\"0x\".concat(n))},e.prototype.decode_string=function(){var e=this.decode_integer(\"u32\"),t=new Uint8Array(this.buffer.consume_bytes(e));return String.fromCharCode.apply(null,t)},e.prototype.decode_boolean=function(){return this.buffer.consume_value(\"u8\")>0},e.prototype.decode_option=function(e){var t=this.buffer.consume_value(\"u8\");if(1===t)return this.decode_value(e.option);if(0!==t)throw new Error(\"Invalid option \".concat(t));return null},e.prototype.decode_enum=function(e){var t,r=this.buffer.consume_value(\"u8\");if(r>e.enum.length)throw new Error(\"Enum option \".concat(r,\" is not available\"));var i=e.enum[r].struct,n=Object.keys(i)[0];return(t={})[n]=this.decode_value(i[n]),t},e.prototype.decode_array=function(e){for(var t=[],r=e.array.len?e.array.len:this.decode_integer(\"u32\"),i=0;i<r;++i)t.push(this.decode_value(e.array.type));return t},e.prototype.decode_set=function(e){for(var t=this.decode_integer(\"u32\"),r=new Set,i=0;i<t;++i)r.add(this.decode_value(e.set));return r},e.prototype.decode_map=function(e){for(var t=this.decode_integer(\"u32\"),r=new Map,i=0;i<t;++i){var n=this.decode_value(e.map.key),s=this.decode_value(e.map.value);r.set(n,s)}return r},e.prototype.decode_struct=function(e){var t={};for(var r in e.struct)t[r]=this.decode_value(e.struct[r]);return t},e}();function b(e,t,r){return void 0===r&&(r=!0),r&&l(e),new d(r).encode(t,e)}class g{constructor(e){this.tag=1,this.record=e.record,this.content=e.content}serialize(){return b(g.schema,this)}getInstruction(t,r,i,n,s,o,a,u){const c=Buffer.from(this.serialize());let h=[];return h.push({pubkey:r,isSigner:!1,isWritable:!1}),h.push({pubkey:i,isSigner:!1,isWritable:!1}),h.push({pubkey:n,isSigner:!0,isWritable:!0}),h.push({pubkey:s,isSigner:!1,isWritable:!0}),h.push({pubkey:o,isSigner:!1,isWritable:!0}),h.push({pubkey:a,isSigner:!0,isWritable:!0}),h.push({pubkey:u,isSigner:!1,isWritable:!1}),new e({keys:h,programId:t,data:c})}}g.schema={struct:{tag:\"u8\",record:\"string\",content:{array:{type:\"u8\"}}}};class _{constructor(e){this.tag=4,this.validation=e.validation,this.signature=e.signature,this.expectedPubkey=e.expectedPubkey}serialize(){return b(_.schema,this)}getInstruction(t,r,i,n,s,o,a,u){const c=Buffer.from(this.serialize());let h=[];return h.push({pubkey:r,isSigner:!1,isWritable:!1}),h.push({pubkey:i,isSigner:!1,isWritable:!1}),h.push({pubkey:n,isSigner:!0,isWritable:!0}),h.push({pubkey:s,isSigner:!1,isWritable:!0}),h.push({pubkey:o,isSigner:!1,isWritable:!0}),h.push({pubkey:a,isSigner:!0,isWritable:!0}),h.push({pubkey:u,isSigner:!1,isWritable:!1}),new e({keys:h,programId:t,data:c})}}_.schema={struct:{tag:\"u8\",validation:\"u8\",signature:{array:{type:\"u8\"}},expectedPubkey:{array:{type:\"u8\"}}}};class v{constructor(e){this.tag=0,this.contentLength=e.contentLength,this.record=e.record}serialize(){return b(v.schema,this)}getInstruction(t,r,i,n,s,o,a,u){const c=Buffer.from(this.serialize());let h=[];return h.push({pubkey:r,isSigner:!1,isWritable:!1}),h.push({pubkey:i,isSigner:!1,isWritable:!1}),h.push({pubkey:n,isSigner:!0,isWritable:!0}),h.push({pubkey:s,isSigner:!1,isWritable:!0}),h.push({pubkey:o,isSigner:!1,isWritable:!0}),h.push({pubkey:a,isSigner:!0,isWritable:!0}),h.push({pubkey:u,isSigner:!1,isWritable:!1}),new e({keys:h,programId:t,data:c})}}v.schema={struct:{tag:\"u8\",contentLength:\"u32\",record:\"string\"}};class m{constructor(e){this.tag=3,this.staleness=e.staleness}serialize(){return b(m.schema,this)}getInstruction(t,r,i,n,s,o,a,u,c){const h=Buffer.from(this.serialize());let f=[];return f.push({pubkey:r,isSigner:!1,isWritable:!1}),f.push({pubkey:i,isSigner:!1,isWritable:!1}),f.push({pubkey:n,isSigner:!0,isWritable:!0}),f.push({pubkey:s,isSigner:!1,isWritable:!0}),f.push({pubkey:o,isSigner:!1,isWritable:!0}),f.push({pubkey:a,isSigner:!1,isWritable:!0}),f.push({pubkey:u,isSigner:!1,isWritable:!1}),f.push({pubkey:c,isSigner:!0,isWritable:!0}),new e({keys:f,programId:t,data:h})}}m.schema={struct:{tag:\"u8\",staleness:\"bool\"}};class w{constructor(e){this.tag=2,this.record=e.record,this.content=e.content}serialize(){return b(w.schema,this)}getInstruction(t,r,i,n,s,o,a,u){const c=Buffer.from(this.serialize());let h=[];return h.push({pubkey:r,isSigner:!1,isWritable:!1}),h.push({pubkey:i,isSigner:!1,isWritable:!1}),h.push({pubkey:n,isSigner:!0,isWritable:!0}),h.push({pubkey:s,isSigner:!1,isWritable:!0}),h.push({pubkey:o,isSigner:!1,isWritable:!0}),h.push({pubkey:a,isSigner:!0,isWritable:!0}),h.push({pubkey:u,isSigner:!1,isWritable:!1}),new e({keys:h,programId:t,data:c})}}w.schema={struct:{tag:\"u8\",record:\"string\",content:{array:{type:\"u8\"}}}};class k{constructor(){this.tag=5}serialize(){return b(k.schema,this)}getInstruction(t,r,i,n,s,o,a,u){const c=Buffer.from(this.serialize());let h=[];return h.push({pubkey:r,isSigner:!1,isWritable:!1}),h.push({pubkey:i,isSigner:!1,isWritable:!1}),h.push({pubkey:n,isSigner:!0,isWritable:!0}),h.push({pubkey:s,isSigner:!1,isWritable:!0}),h.push({pubkey:o,isSigner:!1,isWritable:!0}),h.push({pubkey:a,isSigner:!0,isWritable:!0}),h.push({pubkey:u,isSigner:!1,isWritable:!1}),new e({keys:h,programId:t,data:c})}}k.schema={struct:{tag:\"u8\"}};class S{constructor(e){this.tag=6,this.roaId=e.roaId}serialize(){return b(S.schema,this)}getInstruction(t,r,i,n,s,o,a,u){const c=Buffer.from(this.serialize());let h=[];return h.push({pubkey:r,isSigner:!1,isWritable:!1}),h.push({pubkey:i,isSigner:!1,isWritable:!1}),h.push({pubkey:n,isSigner:!0,isWritable:!0}),h.push({pubkey:s,isSigner:!1,isWritable:!0}),h.push({pubkey:o,isSigner:!1,isWritable:!0}),h.push({pubkey:a,isSigner:!0,isWritable:!0}),h.push({pubkey:u,isSigner:!1,isWritable:!1}),new e({keys:h,programId:t,data:c})}}S.schema={struct:{tag:\"u8\",roaId:{array:{type:\"u8\"}}}};class I{constructor(){this.tag=7}serialize(){return b(I.schema,this)}getInstruction(t,r,i,n,s,o,a,u){const c=Buffer.from(this.serialize());let h=[];return h.push({pubkey:r,isSigner:!1,isWritable:!1}),h.push({pubkey:i,isSigner:!1,isWritable:!1}),h.push({pubkey:n,isSigner:!0,isWritable:!0}),h.push({pubkey:s,isSigner:!1,isWritable:!0}),h.push({pubkey:o,isSigner:!1,isWritable:!0}),h.push({pubkey:a,isSigner:!1,isWritable:!1}),h.push({pubkey:u,isSigner:!0,isWritable:!0}),new e({keys:h,programId:t,data:c})}}I.schema={struct:{tag:\"u8\"}};const W=new t(\"HP3D4D1ZCmohQGFVms2SS4LCANgJyksBf5s1F77FuFjZ\"),[A]=t.findProgramAddressSync([W.toBuffer()],W),j=(e,t,i,n,s,o,a,u)=>new g({record:o,content:Array.from(a)}).getInstruction(u,r.programId,s,e,t,i,n,A),z=(e,t,i,n,s,o,a,u)=>new v({contentLength:a,record:o}).getInstruction(u,r.programId,s,e,t,i,n,A),E=(e,t,i,n,s,o)=>(new k).getInstruction(o,r.programId,s,e,n,t,i,A),P=(e,t,i,n,s,o,a,u)=>new w({record:o,content:Array.from(a)}).getInstruction(u,r.programId,s,e,t,i,n,A),B=(e,t,i,n,s,o,a,u,c)=>new _({validation:o,signature:Array.from(a),expectedPubkey:Array.from(u)}).getInstruction(c,r.programId,s,e,t,i,n,A),O=(e,t,i,n,s,o,a,u)=>new m({staleness:a}).getInstruction(u,r.programId,o,e,t,i,n,A,s),U=(e,t,i,n,s,o,a)=>new S({roaId:Array.from(o.toBuffer())}).getInstruction(a,r.programId,t,e,i,n,s,A),x=(e,t,i,n,s,o)=>(new I).getInstruction(o,r.programId,t,e,i,n,A,s),L=96;var V;!function(e){e[e.None=0]=\"None\",e[e.Solana=1]=\"Solana\",e[e.Ethereum=2]=\"Ethereum\",e[e.UnverifiedSolana=3]=\"UnverifiedSolana\"}(V||(V={}));const N=e=>{switch(e){case V.None:return 0;case V.Ethereum:return 20;case V.Solana:case V.UnverifiedSolana:return 32;default:throw new Error(\"Invalid validation enum\")}};class T{constructor(e){this.stalenessValidation=e.stalenessValidation,this.rightOfAssociationValidation=e.rightOfAssociationValidation,this.contentLength=e.contentLength}static deserialize(e){return new T((t=this.schema,r=e,void 0===(i=!0)&&(i=!0),i&&l(t),new y(r).decode(t)));var t,r,i}static async retrieve(e,t){const r=await e.getAccountInfo(t);if(!r||!r.data)throw new Error(\"Record header account not found\");return this.deserialize(r.data.slice(96,96+this.LEN))}}T.LEN=8,T.schema={struct:{stalenessValidation:\"u16\",rightOfAssociationValidation:\"u16\",contentLength:\"u32\"}};class C{constructor(e,t){this.data=t,this.header=e}static deserialize(e){const t=T.deserialize(e.slice(96,96+T.LEN)),r=e.slice(96+T.LEN);return new C(t,r)}static async retrieve(e,t){const r=await e.getAccountInfo(t);if(!r||!r.data)throw new Error(\"Record header account not found\");return this.deserialize(r.data)}static async retrieveBatch(e,t){return(await e.getMultipleAccountsInfo(t)).map((e=>{if(null==e?void 0:e.data)return this.deserialize(e.data)}))}getContent(){let e=N(this.header.stalenessValidation)+N(this.header.rightOfAssociationValidation);return this.data.slice(e)}getStalenessId(){let e=N(this.header.stalenessValidation);return this.data.slice(0,e)}getRoAId(){let e=N(this.header.stalenessValidation),t=e+N(this.header.rightOfAssociationValidation);return this.data.slice(e,t)}}export{A as CENTRAL_STATE_SNS_RECORDS,L as NAME_REGISTRY_LEN,C as Record,T as RecordHeader,W as SNS_RECORDS_ID,V as Validation,j as allocateAndPostRecord,g as allocateAndPostRecordInstruction,z as allocateRecord,v as allocateRecordInstruction,E as deleteRecord,k as deleteRecordInstruction,P as editRecord,w as editRecordInstruction,N as getValidationLength,x as unverifyRoa,I as unverifyRoaInstruction,B as validateEthSignature,_ as validateEthereumSignatureInstruction,O as validateSolanaSignature,m as validateSolanaSignatureInstruction,U as writeRoa,S as writeRoaInstruction};\n//# sourceMappingURL=index.mjs.map\n"],"names":["n"],"mappings":"gDAAWA,EAAW,CAAC,KAAM,MAAO,MAAO,MAAO,OAAQ,KAAM,MAAO,MAAO,MAAO,OAAQ,MAAO","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/@noble/curves/esm/abstract/curve.cjs

@@ -0,0 +1,4 @@
+"use strict";var e=require("./modular.cjs"),t=require("./utils.cjs");
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const n=BigInt(0),i=BigInt(1);exports.validateBasic=function(n){return e.validateField(n.Fp),t.validateObject(n,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...e.nLength(n.n,n.nBitLength),...n,p:n.Fp.ORDER})},exports.wNAF=function(e,t){const r=(e,t)=>{const n=t.negate();return e?n:t},o=e=>({windows:Math.ceil(t/e)+1,windowSize:2**(e-1)});return{constTimeNegate:r,unsafeLadder(t,r){let o=e.ZERO,s=t;for(;r>n;)r&i&&(o=o.add(s)),s=s.double(),r>>=i;return o},precomputeWindow(e,t){const{windows:n,windowSize:i}=o(t),r=[];let s=e,d=s;for(let e=0;e<n;e++){d=s,r.push(d);for(let e=1;e<i;e++)d=d.add(s),r.push(d);s=d.double()}return r},wNAF(t,n,s){const{windows:d,windowSize:a}=o(t);let c=e.ZERO,u=e.BASE;const l=BigInt(2**t-1),w=2**t,g=BigInt(t);for(let e=0;e<d;e++){const t=e*a;let o=Number(s&l);s>>=g,o>a&&(o-=w,s+=i);const d=t,f=t+Math.abs(o)-1,h=e%2!=0,p=o<0;0===o?u=u.add(r(h,n[d])):c=c.add(r(p,n[f]))}return{p:c,f:u}},wNAFCached(e,t,n,i){const r=e._WINDOW_SIZE||1;let o=t.get(e);return o||(o=this.precomputeWindow(e,r),1!==r&&t.set(e,i(o))),this.wNAF(r,o,n)}}};
+//# sourceMappingURL=curve.cjs.map

package/dist/cjs/node_modules/@noble/curves/esm/abstract/curve.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"curve.cjs","sources":["../../../../../../../node_modules/@noble/curves/esm/abstract/curve.js"],"sourcesContent":["/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Abelian group utilities\nimport { validateField, nLength } from './modular.js';\nimport { validateObject } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\n// Elliptic curve multiplication of Point by scalar. Fragile.\n// Scalars should always be less than curve order: this should be checked inside of a curve itself.\n// Creates precomputation tables for fast multiplication:\n// - private scalar is split by fixed size windows of W bits\n// - every window point is collected from window's table & added to accumulator\n// - since windows are different, same point inside tables won't be accessed more than once per calc\n// - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)\n// - +1 window is neccessary for wNAF\n// - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n// TODO: Research returning 2d JS array of windows, instead of a single window. This would allow\n// windows to be in different memory locations\nexport function wNAF(c, bits) {\n    const constTimeNegate = (condition, item) => {\n        const neg = item.negate();\n        return condition ? neg : item;\n    };\n    const opts = (W) => {\n        const windows = Math.ceil(bits / W) + 1; // +1, because\n        const windowSize = 2 ** (W - 1); // -1 because we skip zero\n        return { windows, windowSize };\n    };\n    return {\n        constTimeNegate,\n        // non-const time multiplication ladder\n        unsafeLadder(elm, n) {\n            let p = c.ZERO;\n            let d = elm;\n            while (n > _0n) {\n                if (n & _1n)\n                    p = p.add(d);\n                d = d.double();\n                n >>= _1n;\n            }\n            return p;\n        },\n        /**\n         * Creates a wNAF precomputation window. Used for caching.\n         * Default window size is set by `utils.precompute()` and is equal to 8.\n         * Number of precomputed points depends on the curve size:\n         * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:\n         * - 𝑊 is the window size\n         * - 𝑛 is the bitlength of the curve order.\n         * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n         * @returns precomputed point tables flattened to a single array\n         */\n        precomputeWindow(elm, W) {\n            const { windows, windowSize } = opts(W);\n            const points = [];\n            let p = elm;\n            let base = p;\n            for (let window = 0; window < windows; window++) {\n                base = p;\n                points.push(base);\n                // =1, because we skip zero\n                for (let i = 1; i < windowSize; i++) {\n                    base = base.add(p);\n                    points.push(base);\n                }\n                p = base.double();\n            }\n            return points;\n        },\n        /**\n         * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n         * @param W window size\n         * @param precomputes precomputed tables\n         * @param n scalar (we don't check here, but should be less than curve order)\n         * @returns real and fake (for const-time) points\n         */\n        wNAF(W, precomputes, n) {\n            // TODO: maybe check that scalar is less than group order? wNAF behavious is undefined otherwise\n            // But need to carefully remove other checks before wNAF. ORDER == bits here\n            const { windows, windowSize } = opts(W);\n            let p = c.ZERO;\n            let f = c.BASE;\n            const mask = BigInt(2 ** W - 1); // Create mask with W ones: 0b1111 for W=4 etc.\n            const maxNumber = 2 ** W;\n            const shiftBy = BigInt(W);\n            for (let window = 0; window < windows; window++) {\n                const offset = window * windowSize;\n                // Extract W bits.\n                let wbits = Number(n & mask);\n                // Shift number by W bits.\n                n >>= shiftBy;\n                // If the bits are bigger than max size, we'll split those.\n                // +224 => 256 - 32\n                if (wbits > windowSize) {\n                    wbits -= maxNumber;\n                    n += _1n;\n                }\n                // This code was first written with assumption that 'f' and 'p' will never be infinity point:\n                // since each addition is multiplied by 2 ** W, it cannot cancel each other. However,\n                // there is negate now: it is possible that negated element from low value\n                // would be the same as high element, which will create carry into next window.\n                // It's not obvious how this can fail, but still worth investigating later.\n                // Check if we're onto Zero point.\n                // Add random point inside current window to f.\n                const offset1 = offset;\n                const offset2 = offset + Math.abs(wbits) - 1; // -1 because we skip zero\n                const cond1 = window % 2 !== 0;\n                const cond2 = wbits < 0;\n                if (wbits === 0) {\n                    // The most important part for const-time getPublicKey\n                    f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n                }\n                else {\n                    p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n                }\n            }\n            // JIT-compiler should not eliminate f here, since it will later be used in normalizeZ()\n            // Even if the variable is still unused, there are some checks which will\n            // throw an exception, so compiler needs to prove they won't happen, which is hard.\n            // At this point there is a way to F be infinity-point even if p is not,\n            // which makes it less const-time: around 1 bigint multiply.\n            return { p, f };\n        },\n        wNAFCached(P, precomputesMap, n, transform) {\n            // @ts-ignore\n            const W = P._WINDOW_SIZE || 1;\n            // Calculate precomputes on a first run, reuse them after\n            let comp = precomputesMap.get(P);\n            if (!comp) {\n                comp = this.precomputeWindow(P, W);\n                if (W !== 1) {\n                    precomputesMap.set(P, transform(comp));\n                }\n            }\n            return this.wNAF(W, comp, n);\n        },\n    };\n}\nexport function validateBasic(curve) {\n    validateField(curve.Fp);\n    validateObject(curve, {\n        n: 'bigint',\n        h: 'bigint',\n        Gx: 'field',\n        Gy: 'field',\n    }, {\n        nBitLength: 'isSafeInteger',\n        nByteLength: 'isSafeInteger',\n    });\n    // Set defaults\n    return Object.freeze({\n        ...nLength(curve.n, curve.nBitLength),\n        ...curve,\n        ...{ p: curve.Fp.ORDER },\n    });\n}\n//# sourceMappingURL=curve.js.map"],"names":["_0n","BigInt","_1n","curve","validateField","Fp","validateObject","n","h","Gx","Gy","nBitLength","nByteLength","Object","freeze","nLength","p","ORDER","c","bits","constTimeNegate","condition","item","neg","negate","opts","W","windows","Math","ceil","windowSize","unsafeLadder","elm","ZERO","d","add","double","precomputeWindow","points","base","window","push","i","wNAF","precomputes","f","BASE","mask","maxNumber","shiftBy","offset","wbits","Number","offset1","offset2","abs","cond1","cond2","wNAFCached","P","precomputesMap","transform","_WINDOW_SIZE","comp","get","this","set"],"mappings":";;AAIA,MAAMA,EAAMC,OAAO,GACbC,EAAMD,OAAO,yBAgLb,SAA+BE,GAgBnC,OAfAC,gBAAcD,EAAME,IACpBC,EAAAA,eACEH,EACA,CACEI,EAAG,SACHC,EAAG,SACHC,GAAI,QACJC,GAAI,SAEN,CACEC,WAAY,gBACZC,YAAa,kBAIVC,OAAOC,OAAO,IAChBC,EAAOA,QAACZ,EAAMI,EAAGJ,EAAMQ,eACvBR,EACEa,EAAGb,EAAME,GAAGY,OAErB,eApKM,SAAmCC,EAAwBC,GAC/D,MAAMC,EAAkBA,CAACC,EAAoBC,KAC3C,MAAMC,EAAMD,EAAKE,SACjB,OAAOH,EAAYE,EAAMD,CAAI,EAEzBG,EAAQC,IAGL,CAAEC,QAFOC,KAAKC,KAAKV,EAAOO,GAAK,EAEpBI,WADC,IAAMJ,EAAI,KAG/B,MAAO,CACLN,kBAEAW,YAAAA,CAAaC,EAAQzB,GACnB,IAAIS,EAAIE,EAAEe,KACNC,EAAOF,EACX,KAAOzB,EAAIP,GACLO,EAAIL,IAAKc,EAAIA,EAAEmB,IAAID,IACvBA,EAAIA,EAAEE,SACN7B,IAAML,EAER,OAAOc,CACR,EAYDqB,gBAAAA,CAAiBL,EAAQN,GACvB,MAAMC,QAAEA,EAAOG,WAAEA,GAAeL,EAAKC,GAC/BY,EAAc,GACpB,IAAItB,EAAOgB,EACPO,EAAOvB,EACX,IAAK,IAAIwB,EAAS,EAAGA,EAASb,EAASa,IAAU,CAC/CD,EAAOvB,EACPsB,EAAOG,KAAKF,GAEZ,IAAK,IAAIG,EAAI,EAAGA,EAAIZ,EAAYY,IAC9BH,EAAOA,EAAKJ,IAAInB,GAChBsB,EAAOG,KAAKF,GAEdvB,EAAIuB,EAAKH,QACX,CACA,OAAOE,CACR,EASDK,IAAAA,CAAKjB,EAAWkB,EAAkBrC,GAGhC,MAAMoB,QAAEA,EAAOG,WAAEA,GAAeL,EAAKC,GAErC,IAAIV,EAAIE,EAAEe,KACNY,EAAI3B,EAAE4B,KAEV,MAAMC,EAAO9C,OAAO,GAAKyB,EAAI,GACvBsB,EAAY,GAAKtB,EACjBuB,EAAUhD,OAAOyB,GAEvB,IAAK,IAAIc,EAAS,EAAGA,EAASb,EAASa,IAAU,CAC/C,MAAMU,EAASV,EAASV,EAExB,IAAIqB,EAAQC,OAAO7C,EAAIwC,GAGvBxC,IAAM0C,EAIFE,EAAQrB,IACVqB,GAASH,EACTzC,GAAKL,GAWP,MAAMmD,EAAUH,EACVI,EAAUJ,EAAStB,KAAK2B,IAAIJ,GAAS,EACrCK,EAAQhB,EAAS,GAAM,EACvBiB,EAAQN,EAAQ,EACR,IAAVA,EAEFN,EAAIA,EAAEV,IAAIf,EAAgBoC,EAAOZ,EAAYS,KAE7CrC,EAAIA,EAAEmB,IAAIf,EAAgBqC,EAAOb,EAAYU,IAEjD,CAMA,MAAO,CAAEtC,IAAG6B,IACb,EAEDa,UAAAA,CAAWC,EAAMC,EAA6BrD,EAAWsD,GAEvD,MAAMnC,EAAYiC,EAAEG,cAAgB,EAEpC,IAAIC,EAAOH,EAAeI,IAAIL,GAO9B,OANKI,IACHA,EAAOE,KAAK5B,iBAAiBsB,EAAGjC,GACtB,IAANA,GACFkC,EAAeM,IAAIP,EAAGE,EAAUE,KAG7BE,KAAKtB,KAAKjB,EAAGqC,EAAMxD,EAC5B,EAEJ","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/@noble/curves/esm/abstract/edwards.cjs

@@ -0,0 +1,4 @@
+"use strict";var t=require("./modular.cjs"),e=require("./utils.cjs"),n=require("./curve.cjs");
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const r=BigInt(0),i=BigInt(1),s=BigInt(2),o=BigInt(8),a={zip215:!0};exports.twistedEdwards=function(u){const c=function(t){const r=n.validateBasic(t);return e.validateObject(t,{hash:"function",a:"bigint",d:"bigint",randomBytes:"function"},{adjustScalarBytes:"function",domain:"function",uvRatio:"function",mapToCurve:"function"}),Object.freeze({...r})}(u),{Fp:f,n:l,prehash:h,hash:y,randomBytes:d,nByteLength:w,h:p}=c,x=s<<BigInt(8*w)-i,B=f.create,m=c.uvRatio||((t,e)=>{try{return{isValid:!0,value:f.sqrt(t*f.inv(e))}}catch(t){return{isValid:!1,value:r}}}),E=c.adjustScalarBytes||(t=>t),g=c.domain||((t,e,n)=>{if(e.length||n)throw new Error("Contexts/pre-hash are not supported");return t}),b=t=>"bigint"==typeof t&&r<t,v=(t,e)=>b(t)&&b(e)&&t<e,z=t=>t===r||v(t,x);function A(t,e){if(v(t,e))return t;throw new Error(`Expected valid scalar < ${e}, got ${typeof t} ${t}`)}function R(t){return t===r?t:A(t,l)}const S=new Map;function q(t){if(!(t instanceof T))throw new Error("ExtendedPoint expected")}class T{constructor(t,e,n,r){if(this.ex=t,this.ey=e,this.ez=n,this.et=r,!z(t))throw new Error("x required");if(!z(e))throw new Error("y required");if(!z(n))throw new Error("z required");if(!z(r))throw new Error("t required")}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static fromAffine(t){if(t instanceof T)throw new Error("extended point not allowed");const{x:e,y:n}=t||{};if(!z(e)||!z(n))throw new Error("invalid affine point");return new T(e,n,i,B(e*n))}static normalizeZ(t){const e=f.invertBatch(t.map((t=>t.ez)));return t.map(((t,n)=>t.toAffine(e[n]))).map(T.fromAffine)}_setWindowSize(t){this._WINDOW_SIZE=t,S.delete(this)}assertValidity(){const{a:t,d:e}=c;if(this.is0())throw new Error("bad point: ZERO");const{ex:n,ey:r,ez:i,et:s}=this,o=B(n*n),a=B(r*r),u=B(i*i),f=B(u*u),l=B(o*t);if(B(u*B(l+a))!==B(f+B(e*B(o*a))))throw new Error("bad point: equation left != right (1)");if(B(n*r)!==B(i*s))throw new Error("bad point: equation left != right (2)")}equals(t){q(t);const{ex:e,ey:n,ez:r}=this,{ex:i,ey:s,ez:o}=t,a=B(e*o),u=B(i*r),c=B(n*o),f=B(s*r);return a===u&&c===f}is0(){return this.equals(T.ZERO)}negate(){return new T(B(-this.ex),this.ey,this.ez,B(-this.et))}double(){const{a:t}=c,{ex:e,ey:n,ez:r}=this,i=B(e*e),o=B(n*n),a=B(s*B(r*r)),u=B(t*i),f=e+n,l=B(B(f*f)-i-o),h=u+o,y=h-a,d=u-o,w=B(l*y),p=B(h*d),x=B(l*d),m=B(y*h);return new T(w,p,m,x)}add(t){q(t);const{a:e,d:n}=c,{ex:i,ey:o,ez:a,et:u}=this,{ex:f,ey:l,ez:h,et:y}=t;if(e===BigInt(-1)){const t=B((o-i)*(l+f)),e=B((o+i)*(l-f)),n=B(e-t);if(n===r)return this.double();const c=B(a*s*y),d=B(u*s*h),w=d+c,p=e+t,x=d-c,m=B(w*n),E=B(p*x),g=B(w*x),b=B(n*p);return new T(m,E,b,g)}const d=B(i*f),w=B(o*l),p=B(u*n*y),x=B(a*h),m=B((i+o)*(f+l)-d-w),E=x-p,g=x+p,b=B(w-e*d),v=B(m*E),z=B(g*b),A=B(m*b),R=B(E*g);return new T(v,z,R,A)}subtract(t){return this.add(t.negate())}wNAF(t){return I.wNAFCached(this,S,t,T.normalizeZ)}multiply(t){const{p:e,f:n}=this.wNAF(A(t,l));return T.normalizeZ([e,n])[0]}multiplyUnsafe(t){let e=R(t);return e===r?Z:this.equals(Z)||e===i?this:this.equals(O)?this.wNAF(e).p:I.unsafeLadder(this,e)}isSmallOrder(){return this.multiplyUnsafe(p).is0()}isTorsionFree(){return I.unsafeLadder(this,l).is0()}toAffine(t){const{ex:e,ey:n,ez:s}=this,a=this.is0();null==t&&(t=a?o:f.inv(s));const u=B(e*t),c=B(n*t),l=B(s*t);if(a)return{x:r,y:i};if(l!==i)throw new Error("invZ was invalid");return{x:u,y:c}}clearCofactor(){const{h:t}=c;return t===i?this:this.multiplyUnsafe(t)}static fromHex(t,n=!1){const{d:s,a:o}=c,a=f.BYTES,u=(t=e.ensureBytes("pointHex",t,a)).slice(),l=t[a-1];u[a-1]=-129&l;const h=e.bytesToNumberLE(u);h===r||A(h,n?x:f.ORDER);const y=B(h*h),d=B(y-i),w=B(s*y-o);let{isValid:p,value:E}=m(d,w);if(!p)throw new Error("Point.fromHex: invalid y coordinate");const g=(E&i)===i,b=0!=(128&l);if(!n&&E===r&&b)throw new Error("Point.fromHex: x=0 and x_0=1");return b!==g&&(E=B(-E)),T.fromAffine({x:E,y:h})}static fromPrivateKey(t){return L(t).point}toRawBytes(){const{x:t,y:n}=this.toAffine(),r=e.numberToBytesLE(n,f.BYTES);return r[r.length-1]|=t&i?128:0,r}toHex(){return e.bytesToHex(this.toRawBytes())}}T.BASE=new T(c.Gx,c.Gy,i,B(c.Gx*c.Gy)),T.ZERO=new T(r,i,i,r);const{BASE:O,ZERO:Z}=T,I=n.wNAF(T,8*w);function N(e){return t.mod(e,l)}function H(t){return N(e.bytesToNumberLE(t))}function L(t){const n=w;t=e.ensureBytes("private key",t,n);const r=e.ensureBytes("hashed private key",y(t),2*n),i=E(r.slice(0,n)),s=r.slice(n,2*n),o=H(i),a=O.multiply(o),u=a.toRawBytes();return{head:i,prefix:s,scalar:o,point:a,pointBytes:u}}function P(t=new Uint8Array,...n){const r=e.concatBytes(...n);return H(y(g(r,e.ensureBytes("context",t),!!h)))}const j=a;return O._setWindowSize(8),{CURVE:c,getPublicKey:function(t){return L(t).pointBytes},sign:function(t,n,r={}){t=e.ensureBytes("message",t),h&&(t=h(t));const{prefix:i,scalar:s,pointBytes:o}=L(n),a=P(r.context,i,t),u=O.multiply(a).toRawBytes(),c=N(a+P(r.context,u,o,t)*s);R(c);const l=e.concatBytes(u,e.numberToBytesLE(c,f.BYTES));return e.ensureBytes("result",l,2*w)},verify:function(t,n,r,i=j){const{context:s,zip215:o}=i,a=f.BYTES;t=e.ensureBytes("signature",t,2*a),n=e.ensureBytes("message",n),h&&(n=h(n));const u=e.bytesToNumberLE(t.slice(a,2*a));let c,l,y;try{c=T.fromHex(r,o),l=T.fromHex(t.slice(0,a),o),y=O.multiplyUnsafe(u)}catch(t){return!1}if(!o&&c.isSmallOrder())return!1;const d=P(s,l.toRawBytes(),c.toRawBytes(),n);return l.add(c.multiplyUnsafe(d)).subtract(y).clearCofactor().equals(T.ZERO)},ExtendedPoint:T,utils:{getExtendedPublicKey:L,randomPrivateKey:()=>d(f.BYTES),precompute:(t=8,e=T.BASE)=>(e._setWindowSize(t),e.multiply(BigInt(3)),e)}}};
+//# sourceMappingURL=edwards.cjs.map

package/dist/cjs/node_modules/@noble/curves/esm/abstract/edwards.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"edwards.cjs","sources":["../../../../../../../node_modules/@noble/curves/esm/abstract/edwards.js"],"sourcesContent":["/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Twisted Edwards curve. The formula is: ax² + y² = 1 + dx²y²\nimport { mod } from './modular.js';\nimport * as ut from './utils.js';\nimport { ensureBytes } from './utils.js';\nimport { wNAF, validateBasic } from './curve.js';\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _8n = BigInt(8);\n// verification rule is either zip215 or rfc8032 / nist186-5. Consult fromHex:\nconst VERIFY_DEFAULT = { zip215: true };\nfunction validateOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(curve, {\n        hash: 'function',\n        a: 'bigint',\n        d: 'bigint',\n        randomBytes: 'function',\n    }, {\n        adjustScalarBytes: 'function',\n        domain: 'function',\n        uvRatio: 'function',\n        mapToCurve: 'function',\n    });\n    // Set defaults\n    return Object.freeze({ ...opts });\n}\n// It is not generic twisted curve for now, but ed25519/ed448 generic implementation\nexport function twistedEdwards(curveDef) {\n    const CURVE = validateOpts(curveDef);\n    const { Fp, n: CURVE_ORDER, prehash: prehash, hash: cHash, randomBytes, nByteLength, h: cofactor, } = CURVE;\n    const MASK = _2n << (BigInt(nByteLength * 8) - _1n);\n    const modP = Fp.create; // Function overrides\n    // sqrt(u/v)\n    const uvRatio = CURVE.uvRatio ||\n        ((u, v) => {\n            try {\n                return { isValid: true, value: Fp.sqrt(u * Fp.inv(v)) };\n            }\n            catch (e) {\n                return { isValid: false, value: _0n };\n            }\n        });\n    const adjustScalarBytes = CURVE.adjustScalarBytes || ((bytes) => bytes); // NOOP\n    const domain = CURVE.domain ||\n        ((data, ctx, phflag) => {\n            if (ctx.length || phflag)\n                throw new Error('Contexts/pre-hash are not supported');\n            return data;\n        }); // NOOP\n    const inBig = (n) => typeof n === 'bigint' && _0n < n; // n in [1..]\n    const inRange = (n, max) => inBig(n) && inBig(max) && n < max; // n in [1..max-1]\n    const in0MaskRange = (n) => n === _0n || inRange(n, MASK); // n in [0..MASK-1]\n    function assertInRange(n, max) {\n        // n in [1..max-1]\n        if (inRange(n, max))\n            return n;\n        throw new Error(`Expected valid scalar < ${max}, got ${typeof n} ${n}`);\n    }\n    function assertGE0(n) {\n        // n in [0..CURVE_ORDER-1]\n        return n === _0n ? n : assertInRange(n, CURVE_ORDER); // GE = prime subgroup, not full group\n    }\n    const pointPrecomputes = new Map();\n    function isPoint(other) {\n        if (!(other instanceof Point))\n            throw new Error('ExtendedPoint expected');\n    }\n    // Extended Point works in extended coordinates: (x, y, z, t) ∋ (x=x/z, y=y/z, t=xy).\n    // https://en.wikipedia.org/wiki/Twisted_Edwards_curve#Extended_coordinates\n    class Point {\n        constructor(ex, ey, ez, et) {\n            this.ex = ex;\n            this.ey = ey;\n            this.ez = ez;\n            this.et = et;\n            if (!in0MaskRange(ex))\n                throw new Error('x required');\n            if (!in0MaskRange(ey))\n                throw new Error('y required');\n            if (!in0MaskRange(ez))\n                throw new Error('z required');\n            if (!in0MaskRange(et))\n                throw new Error('t required');\n        }\n        get x() {\n            return this.toAffine().x;\n        }\n        get y() {\n            return this.toAffine().y;\n        }\n        static fromAffine(p) {\n            if (p instanceof Point)\n                throw new Error('extended point not allowed');\n            const { x, y } = p || {};\n            if (!in0MaskRange(x) || !in0MaskRange(y))\n                throw new Error('invalid affine point');\n            return new Point(x, y, _1n, modP(x * y));\n        }\n        static normalizeZ(points) {\n            const toInv = Fp.invertBatch(points.map((p) => p.ez));\n            return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n        }\n        // \"Private method\", don't use it directly\n        _setWindowSize(windowSize) {\n            this._WINDOW_SIZE = windowSize;\n            pointPrecomputes.delete(this);\n        }\n        // Not required for fromHex(), which always creates valid points.\n        // Could be useful for fromAffine().\n        assertValidity() {\n            const { a, d } = CURVE;\n            if (this.is0())\n                throw new Error('bad point: ZERO'); // TODO: optimize, with vars below?\n            // Equation in affine coordinates: ax² + y² = 1 + dx²y²\n            // Equation in projective coordinates (X/Z, Y/Z, Z):  (aX² + Y²)Z² = Z⁴ + dX²Y²\n            const { ex: X, ey: Y, ez: Z, et: T } = this;\n            const X2 = modP(X * X); // X²\n            const Y2 = modP(Y * Y); // Y²\n            const Z2 = modP(Z * Z); // Z²\n            const Z4 = modP(Z2 * Z2); // Z⁴\n            const aX2 = modP(X2 * a); // aX²\n            const left = modP(Z2 * modP(aX2 + Y2)); // (aX² + Y²)Z²\n            const right = modP(Z4 + modP(d * modP(X2 * Y2))); // Z⁴ + dX²Y²\n            if (left !== right)\n                throw new Error('bad point: equation left != right (1)');\n            // In Extended coordinates we also have T, which is x*y=T/Z: check X*Y == Z*T\n            const XY = modP(X * Y);\n            const ZT = modP(Z * T);\n            if (XY !== ZT)\n                throw new Error('bad point: equation left != right (2)');\n        }\n        // Compare one point to another.\n        equals(other) {\n            isPoint(other);\n            const { ex: X1, ey: Y1, ez: Z1 } = this;\n            const { ex: X2, ey: Y2, ez: Z2 } = other;\n            const X1Z2 = modP(X1 * Z2);\n            const X2Z1 = modP(X2 * Z1);\n            const Y1Z2 = modP(Y1 * Z2);\n            const Y2Z1 = modP(Y2 * Z1);\n            return X1Z2 === X2Z1 && Y1Z2 === Y2Z1;\n        }\n        is0() {\n            return this.equals(Point.ZERO);\n        }\n        negate() {\n            // Flips point sign to a negative one (-x, y in affine coords)\n            return new Point(modP(-this.ex), this.ey, this.ez, modP(-this.et));\n        }\n        // Fast algo for doubling Extended Point.\n        // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd\n        // Cost: 4M + 4S + 1*a + 6add + 1*2.\n        double() {\n            const { a } = CURVE;\n            const { ex: X1, ey: Y1, ez: Z1 } = this;\n            const A = modP(X1 * X1); // A = X12\n            const B = modP(Y1 * Y1); // B = Y12\n            const C = modP(_2n * modP(Z1 * Z1)); // C = 2*Z12\n            const D = modP(a * A); // D = a*A\n            const x1y1 = X1 + Y1;\n            const E = modP(modP(x1y1 * x1y1) - A - B); // E = (X1+Y1)2-A-B\n            const G = D + B; // G = D+B\n            const F = G - C; // F = G-C\n            const H = D - B; // H = D-B\n            const X3 = modP(E * F); // X3 = E*F\n            const Y3 = modP(G * H); // Y3 = G*H\n            const T3 = modP(E * H); // T3 = E*H\n            const Z3 = modP(F * G); // Z3 = F*G\n            return new Point(X3, Y3, Z3, T3);\n        }\n        // Fast algo for adding 2 Extended Points.\n        // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#addition-add-2008-hwcd\n        // Cost: 9M + 1*a + 1*d + 7add.\n        add(other) {\n            isPoint(other);\n            const { a, d } = CURVE;\n            const { ex: X1, ey: Y1, ez: Z1, et: T1 } = this;\n            const { ex: X2, ey: Y2, ez: Z2, et: T2 } = other;\n            // Faster algo for adding 2 Extended Points when curve's a=-1.\n            // http://hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html#addition-add-2008-hwcd-4\n            // Cost: 8M + 8add + 2*2.\n            // Note: It does not check whether the `other` point is valid.\n            if (a === BigInt(-1)) {\n                const A = modP((Y1 - X1) * (Y2 + X2));\n                const B = modP((Y1 + X1) * (Y2 - X2));\n                const F = modP(B - A);\n                if (F === _0n)\n                    return this.double(); // Same point. Tests say it doesn't affect timing\n                const C = modP(Z1 * _2n * T2);\n                const D = modP(T1 * _2n * Z2);\n                const E = D + C;\n                const G = B + A;\n                const H = D - C;\n                const X3 = modP(E * F);\n                const Y3 = modP(G * H);\n                const T3 = modP(E * H);\n                const Z3 = modP(F * G);\n                return new Point(X3, Y3, Z3, T3);\n            }\n            const A = modP(X1 * X2); // A = X1*X2\n            const B = modP(Y1 * Y2); // B = Y1*Y2\n            const C = modP(T1 * d * T2); // C = T1*d*T2\n            const D = modP(Z1 * Z2); // D = Z1*Z2\n            const E = modP((X1 + Y1) * (X2 + Y2) - A - B); // E = (X1+Y1)*(X2+Y2)-A-B\n            const F = D - C; // F = D-C\n            const G = D + C; // G = D+C\n            const H = modP(B - a * A); // H = B-a*A\n            const X3 = modP(E * F); // X3 = E*F\n            const Y3 = modP(G * H); // Y3 = G*H\n            const T3 = modP(E * H); // T3 = E*H\n            const Z3 = modP(F * G); // Z3 = F*G\n            return new Point(X3, Y3, Z3, T3);\n        }\n        subtract(other) {\n            return this.add(other.negate());\n        }\n        wNAF(n) {\n            return wnaf.wNAFCached(this, pointPrecomputes, n, Point.normalizeZ);\n        }\n        // Constant-time multiplication.\n        multiply(scalar) {\n            const { p, f } = this.wNAF(assertInRange(scalar, CURVE_ORDER));\n            return Point.normalizeZ([p, f])[0];\n        }\n        // Non-constant-time multiplication. Uses double-and-add algorithm.\n        // It's faster, but should only be used when you don't care about\n        // an exposed private key e.g. sig verification.\n        // Does NOT allow scalars higher than CURVE.n.\n        multiplyUnsafe(scalar) {\n            let n = assertGE0(scalar); // 0 <= scalar < CURVE.n\n            if (n === _0n)\n                return I;\n            if (this.equals(I) || n === _1n)\n                return this;\n            if (this.equals(G))\n                return this.wNAF(n).p;\n            return wnaf.unsafeLadder(this, n);\n        }\n        // Checks if point is of small order.\n        // If you add something to small order point, you will have \"dirty\"\n        // point with torsion component.\n        // Multiplies point by cofactor and checks if the result is 0.\n        isSmallOrder() {\n            return this.multiplyUnsafe(cofactor).is0();\n        }\n        // Multiplies point by curve order and checks if the result is 0.\n        // Returns `false` is the point is dirty.\n        isTorsionFree() {\n            return wnaf.unsafeLadder(this, CURVE_ORDER).is0();\n        }\n        // Converts Extended point to default (x, y) coordinates.\n        // Can accept precomputed Z^-1 - for example, from invertBatch.\n        toAffine(iz) {\n            const { ex: x, ey: y, ez: z } = this;\n            const is0 = this.is0();\n            if (iz == null)\n                iz = is0 ? _8n : Fp.inv(z); // 8 was chosen arbitrarily\n            const ax = modP(x * iz);\n            const ay = modP(y * iz);\n            const zz = modP(z * iz);\n            if (is0)\n                return { x: _0n, y: _1n };\n            if (zz !== _1n)\n                throw new Error('invZ was invalid');\n            return { x: ax, y: ay };\n        }\n        clearCofactor() {\n            const { h: cofactor } = CURVE;\n            if (cofactor === _1n)\n                return this;\n            return this.multiplyUnsafe(cofactor);\n        }\n        // Converts hash string or Uint8Array to Point.\n        // Uses algo from RFC8032 5.1.3.\n        static fromHex(hex, zip215 = false) {\n            const { d, a } = CURVE;\n            const len = Fp.BYTES;\n            hex = ensureBytes('pointHex', hex, len); // copy hex to a new array\n            const normed = hex.slice(); // copy again, we'll manipulate it\n            const lastByte = hex[len - 1]; // select last byte\n            normed[len - 1] = lastByte & ~0x80; // clear last bit\n            const y = ut.bytesToNumberLE(normed);\n            if (y === _0n) {\n                // y=0 is allowed\n            }\n            else {\n                // RFC8032 prohibits >= p, but ZIP215 doesn't\n                if (zip215)\n                    assertInRange(y, MASK); // zip215=true [1..P-1] (2^255-19-1 for ed25519)\n                else\n                    assertInRange(y, Fp.ORDER); // zip215=false [1..MASK-1] (2^256-1 for ed25519)\n            }\n            // Ed25519: x² = (y²-1)/(dy²+1) mod p. Ed448: x² = (y²-1)/(dy²-1) mod p. Generic case:\n            // ax²+y²=1+dx²y² => y²-1=dx²y²-ax² => y²-1=x²(dy²-a) => x²=(y²-1)/(dy²-a)\n            const y2 = modP(y * y); // denominator is always non-0 mod p.\n            const u = modP(y2 - _1n); // u = y² - 1\n            const v = modP(d * y2 - a); // v = d y² + 1.\n            let { isValid, value: x } = uvRatio(u, v); // √(u/v)\n            if (!isValid)\n                throw new Error('Point.fromHex: invalid y coordinate');\n            const isXOdd = (x & _1n) === _1n; // There are 2 square roots. Use x_0 bit to select proper\n            const isLastByteOdd = (lastByte & 0x80) !== 0; // x_0, last bit\n            if (!zip215 && x === _0n && isLastByteOdd)\n                // if x=0 and x_0 = 1, fail\n                throw new Error('Point.fromHex: x=0 and x_0=1');\n            if (isLastByteOdd !== isXOdd)\n                x = modP(-x); // if x_0 != x mod 2, set x = p-x\n            return Point.fromAffine({ x, y });\n        }\n        static fromPrivateKey(privKey) {\n            return getExtendedPublicKey(privKey).point;\n        }\n        toRawBytes() {\n            const { x, y } = this.toAffine();\n            const bytes = ut.numberToBytesLE(y, Fp.BYTES); // each y has 2 x values (x, -y)\n            bytes[bytes.length - 1] |= x & _1n ? 0x80 : 0; // when compressing, it's enough to store y\n            return bytes; // and use the last byte to encode sign of x\n        }\n        toHex() {\n            return ut.bytesToHex(this.toRawBytes()); // Same as toRawBytes, but returns string.\n        }\n    }\n    Point.BASE = new Point(CURVE.Gx, CURVE.Gy, _1n, modP(CURVE.Gx * CURVE.Gy));\n    Point.ZERO = new Point(_0n, _1n, _1n, _0n); // 0, 1, 1, 0\n    const { BASE: G, ZERO: I } = Point;\n    const wnaf = wNAF(Point, nByteLength * 8);\n    function modN(a) {\n        return mod(a, CURVE_ORDER);\n    }\n    // Little-endian SHA512 with modulo n\n    function modN_LE(hash) {\n        return modN(ut.bytesToNumberLE(hash));\n    }\n    /** Convenience method that creates public key and other stuff. RFC8032 5.1.5 */\n    function getExtendedPublicKey(key) {\n        const len = nByteLength;\n        key = ensureBytes('private key', key, len);\n        // Hash private key with curve's hash function to produce uniformingly random input\n        // Check byte lengths: ensure(64, h(ensure(32, key)))\n        const hashed = ensureBytes('hashed private key', cHash(key), 2 * len);\n        const head = adjustScalarBytes(hashed.slice(0, len)); // clear first half bits, produce FE\n        const prefix = hashed.slice(len, 2 * len); // second half is called key prefix (5.1.6)\n        const scalar = modN_LE(head); // The actual private scalar\n        const point = G.multiply(scalar); // Point on Edwards curve aka public key\n        const pointBytes = point.toRawBytes(); // Uint8Array representation\n        return { head, prefix, scalar, point, pointBytes };\n    }\n    // Calculates EdDSA pub key. RFC8032 5.1.5. Privkey is hashed. Use first half with 3 bits cleared\n    function getPublicKey(privKey) {\n        return getExtendedPublicKey(privKey).pointBytes;\n    }\n    // int('LE', SHA512(dom2(F, C) || msgs)) mod N\n    function hashDomainToScalar(context = new Uint8Array(), ...msgs) {\n        const msg = ut.concatBytes(...msgs);\n        return modN_LE(cHash(domain(msg, ensureBytes('context', context), !!prehash)));\n    }\n    /** Signs message with privateKey. RFC8032 5.1.6 */\n    function sign(msg, privKey, options = {}) {\n        msg = ensureBytes('message', msg);\n        if (prehash)\n            msg = prehash(msg); // for ed25519ph etc.\n        const { prefix, scalar, pointBytes } = getExtendedPublicKey(privKey);\n        const r = hashDomainToScalar(options.context, prefix, msg); // r = dom2(F, C) || prefix || PH(M)\n        const R = G.multiply(r).toRawBytes(); // R = rG\n        const k = hashDomainToScalar(options.context, R, pointBytes, msg); // R || A || PH(M)\n        const s = modN(r + k * scalar); // S = (r + k * s) mod L\n        assertGE0(s); // 0 <= s < l\n        const res = ut.concatBytes(R, ut.numberToBytesLE(s, Fp.BYTES));\n        return ensureBytes('result', res, nByteLength * 2); // 64-byte signature\n    }\n    const verifyOpts = VERIFY_DEFAULT;\n    function verify(sig, msg, publicKey, options = verifyOpts) {\n        const { context, zip215 } = options;\n        const len = Fp.BYTES; // Verifies EdDSA signature against message and public key. RFC8032 5.1.7.\n        sig = ensureBytes('signature', sig, 2 * len); // An extended group equation is checked.\n        msg = ensureBytes('message', msg);\n        if (prehash)\n            msg = prehash(msg); // for ed25519ph, etc\n        const s = ut.bytesToNumberLE(sig.slice(len, 2 * len));\n        // zip215: true is good for consensus-critical apps and allows points < 2^256\n        // zip215: false follows RFC8032 / NIST186-5 and restricts points to CURVE.p\n        let A, R, SB;\n        try {\n            A = Point.fromHex(publicKey, zip215);\n            R = Point.fromHex(sig.slice(0, len), zip215);\n            SB = G.multiplyUnsafe(s); // 0 <= s < l is done inside\n        }\n        catch (error) {\n            return false;\n        }\n        if (!zip215 && A.isSmallOrder())\n            return false;\n        const k = hashDomainToScalar(context, R.toRawBytes(), A.toRawBytes(), msg);\n        const RkA = R.add(A.multiplyUnsafe(k));\n        // [8][S]B = [8]R + [8][k]A'\n        return RkA.subtract(SB).clearCofactor().equals(Point.ZERO);\n    }\n    G._setWindowSize(8); // Enable precomputes. Slows down first publicKey computation by 20ms.\n    const utils = {\n        getExtendedPublicKey,\n        // ed25519 private keys are uniform 32b. No need to check for modulo bias, like in secp256k1.\n        randomPrivateKey: () => randomBytes(Fp.BYTES),\n        /**\n         * We're doing scalar multiplication (used in getPublicKey etc) with precomputed BASE_POINT\n         * values. This slows down first getPublicKey() by milliseconds (see Speed section),\n         * but allows to speed-up subsequent getPublicKey() calls up to 20x.\n         * @param windowSize 2, 4, 8, 16\n         */\n        precompute(windowSize = 8, point = Point.BASE) {\n            point._setWindowSize(windowSize);\n            point.multiply(BigInt(3));\n            return point;\n        },\n    };\n    return {\n        CURVE,\n        getPublicKey,\n        sign,\n        verify,\n        ExtendedPoint: Point,\n        utils,\n    };\n}\n//# sourceMappingURL=edwards.js.map"],"names":["_0n","BigInt","_1n","_2n","_8n","VERIFY_DEFAULT","zip215","curveDef","CURVE","curve","opts","validateBasic","ut","hash","a","d","randomBytes","adjustScalarBytes","domain","uvRatio","mapToCurve","Object","freeze","validateOpts","Fp","n","CURVE_ORDER","prehash","cHash","nByteLength","h","cofactor","MASK","modP","create","u","v","isValid","value","sqrt","inv","e","bytes","data","ctx","phflag","length","Error","inBig","inRange","max","in0MaskRange","assertInRange","assertGE0","pointPrecomputes","Map","isPoint","other","Point","constructor","ex","ey","ez","et","this","x","toAffine","y","fromAffine","p","normalizeZ","points","toInv","invertBatch","map","i","_setWindowSize","windowSize","_WINDOW_SIZE","delete","assertValidity","is0","X","Y","Z","T","X2","Y2","Z2","Z4","aX2","equals","X1","Y1","Z1","X1Z2","X2Z1","Y1Z2","Y2Z1","ZERO","negate","double","A","B","C","D","x1y1","E","G","F","H","X3","Y3","T3","Z3","add","T1","T2","subtract","wNAF","wnaf","wNAFCached","multiply","scalar","f","multiplyUnsafe","I","unsafeLadder","isSmallOrder","isTorsionFree","iz","z","ax","ay","zz","clearCofactor","fromHex","hex","len","BYTES","normed","ensureBytes","slice","lastByte","ORDER","y2","isXOdd","isLastByteOdd","fromPrivateKey","privKey","getExtendedPublicKey","point","toRawBytes","numberToBytesLE","toHex","BASE","Gx","Gy","modN","mod","modN_LE","key","hashed","head","prefix","pointBytes","hashDomainToScalar","context","Uint8Array","msgs","msg","verifyOpts","getPublicKey","sign","options","r","R","s","res","concatBytes","verify","sig","publicKey","bytesToNumberLE","SB","error","k","ExtendedPoint","utils","randomPrivateKey","precompute"],"mappings":";;AASA,MAAMA,EAAMC,OAAO,GAAIC,EAAMD,OAAO,GAAIE,EAAMF,OAAO,GAAIG,EAAMH,OAAO,GAgBhEI,EAAiB,CAAEC,QAAQ,0BAyE3B,SAAyBC,GAC7B,MAAMC,EAxER,SAAsBC,GACpB,MAAMC,EAAOC,gBAAcF,GAiB3B,OAhBAG,EAAAA,eACEH,EACA,CACEI,KAAM,WACNC,EAAG,SACHC,EAAG,SACHC,YAAa,YAEf,CACEC,kBAAmB,WACnBC,OAAQ,WACRC,QAAS,WACTC,WAAY,aAITC,OAAOC,OAAO,IAAKZ,GAC5B,CAqDgBa,CAAahB,IACrBiB,GACJA,EACAC,EAAGC,EACHC,QAASA,EACTd,KAAMe,EAAKZ,YACXA,EAAWa,YACXA,EACAC,EAAGC,GACDvB,EACEwB,EAAO7B,GAAQF,OAAqB,EAAd4B,GAAmB3B,EACzC+B,EAAOT,EAAGU,OAGVf,EACJX,EAAMW,SAAO,EACXgB,EAAWC,KACX,IACE,MAAO,CAAEC,SAAS,EAAMC,MAAOd,EAAGe,KAAKJ,EAAIX,EAAGgB,IAAIJ,IACnD,CAAC,MAAOK,GACP,MAAO,CAAEJ,SAAS,EAAOC,MAAOtC,EAClC,CACD,GACGiB,EAAoBT,EAAMS,mBAAiB,CAAMyB,GAAsBA,GACvExB,EACJV,EAAMU,QACL,EAACyB,EAAkBC,EAAiBC,KACnC,GAAID,EAAIE,QAAUD,EAAQ,MAAM,IAAIE,MAAM,uCAC1C,OAAOJ,CACR,GACGK,EAASvB,GAA2B,iBAANA,GAAkBzB,EAAMyB,EACtDwB,EAAUA,CAACxB,EAAWyB,IAAgBF,EAAMvB,IAAMuB,EAAME,IAAQzB,EAAIyB,EACpEC,EAAgB1B,GAAcA,IAAMzB,GAAOiD,EAAQxB,EAAGO,GAC5D,SAASoB,EAAc3B,EAAWyB,GAEhC,GAAID,EAAQxB,EAAGyB,GAAM,OAAOzB,EAC5B,MAAM,IAAIsB,MAAM,2BAA2BG,iBAAmBzB,KAAKA,IACrE,CACA,SAAS4B,EAAU5B,GAEjB,OAAOA,IAAMzB,EAAMyB,EAAI2B,EAAc3B,EAAGC,EAC1C,CACA,MAAM4B,EAAmB,IAAIC,IAC7B,SAASC,EAAQC,GACf,KAAMA,aAAiBC,GAAQ,MAAM,IAAIX,MAAM,yBACjD,CAGA,MAAMW,EAIJC,WAAAA,CACWC,EACAC,EACAC,EACAC,GAET,GALSC,KAAAJ,GAAAA,EACAI,KAAAH,GAAAA,EACAG,KAAAF,GAAAA,EACAE,KAAAD,GAAAA,GAEJZ,EAAaS,GAAK,MAAM,IAAIb,MAAM,cACvC,IAAKI,EAAaU,GAAK,MAAM,IAAId,MAAM,cACvC,IAAKI,EAAaW,GAAK,MAAM,IAAIf,MAAM,cACvC,IAAKI,EAAaY,GAAK,MAAM,IAAIhB,MAAM,aACzC,CAEA,KAAIkB,GACF,OAAOD,KAAKE,WAAWD,CACzB,CACA,KAAIE,GACF,OAAOH,KAAKE,WAAWC,CACzB,CAEA,iBAAOC,CAAWC,GAChB,GAAIA,aAAaX,EAAO,MAAM,IAAIX,MAAM,8BACxC,MAAMkB,EAAEA,EAACE,EAAEA,GAAME,GAAK,CAAA,EACtB,IAAKlB,EAAac,KAAOd,EAAagB,GAAI,MAAM,IAAIpB,MAAM,wBAC1D,OAAO,IAAIW,EAAMO,EAAGE,EAAGjE,EAAK+B,EAAKgC,EAAIE,GACvC,CACA,iBAAOG,CAAWC,GAChB,MAAMC,EAAQhD,EAAGiD,YAAYF,EAAOG,KAAKL,GAAMA,EAAEP,MACjD,OAAOS,EAAOG,KAAI,CAACL,EAAGM,IAAMN,EAAEH,SAASM,EAAMG,MAAKD,IAAIhB,EAAMU,WAC9D,CAQAQ,cAAAA,CAAeC,GACbb,KAAKc,aAAeD,EACpBvB,EAAiByB,OAAOf,KAC1B,CAGAgB,cAAAA,GACE,MAAMlE,EAAEA,EAACC,EAAEA,GAAMP,EACjB,GAAIwD,KAAKiB,MAAO,MAAM,IAAIlC,MAAM,mBAGhC,MAAQa,GAAIsB,EAAGrB,GAAIsB,EAAGrB,GAAIsB,EAAGrB,GAAIsB,GAAMrB,KACjCsB,EAAKrD,EAAKiD,EAAIA,GACdK,EAAKtD,EAAKkD,EAAIA,GACdK,EAAKvD,EAAKmD,EAAIA,GACdK,EAAKxD,EAAKuD,EAAKA,GACfE,EAAMzD,EAAKqD,EAAKxE,GAGtB,GAFamB,EAAKuD,EAAKvD,EAAKyD,EAAMH,MACpBtD,EAAKwD,EAAKxD,EAAKlB,EAAIkB,EAAKqD,EAAKC,KACvB,MAAM,IAAIxC,MAAM,yCAIpC,GAFWd,EAAKiD,EAAIC,KACTlD,EAAKmD,EAAIC,GACL,MAAM,IAAItC,MAAM,wCACjC,CAGA4C,MAAAA,CAAOlC,GACLD,EAAQC,GACR,MAAQG,GAAIgC,EAAI/B,GAAIgC,EAAI/B,GAAIgC,GAAO9B,MAC3BJ,GAAI0B,EAAIzB,GAAI0B,EAAIzB,GAAI0B,GAAO/B,EAC7BsC,EAAO9D,EAAK2D,EAAKJ,GACjBQ,EAAO/D,EAAKqD,EAAKQ,GACjBG,EAAOhE,EAAK4D,EAAKL,GACjBU,EAAOjE,EAAKsD,EAAKO,GACvB,OAAOC,IAASC,GAAQC,IAASC,CACnC,CAEUjB,GAAAA,GACR,OAAOjB,KAAK2B,OAAOjC,EAAMyC,KAC3B,CAEAC,MAAAA,GAEE,OAAO,IAAI1C,EAAMzB,GAAM+B,KAAKJ,IAAKI,KAAKH,GAAIG,KAAKF,GAAI7B,GAAM+B,KAAKD,IAChE,CAKAsC,MAAAA,GACE,MAAMvF,EAAEA,GAAMN,GACNoD,GAAIgC,EAAI/B,GAAIgC,EAAI/B,GAAIgC,GAAO9B,KAC7BsC,EAAIrE,EAAK2D,EAAKA,GACdW,EAAItE,EAAK4D,EAAKA,GACdW,EAAIvE,EAAK9B,EAAM8B,EAAK6D,EAAKA,IACzBW,EAAIxE,EAAKnB,EAAIwF,GACbI,EAAOd,EAAKC,EACZc,EAAI1E,EAAKA,EAAKyE,EAAOA,GAAQJ,EAAIC,GACjCK,EAAIH,EAAIF,EACRM,EAAID,EAAIJ,EACRM,EAAIL,EAAIF,EACRQ,EAAK9E,EAAK0E,EAAIE,GACdG,EAAK/E,EAAK2E,EAAIE,GACdG,EAAKhF,EAAK0E,EAAIG,GACdI,EAAKjF,EAAK4E,EAAID,GACpB,OAAO,IAAIlD,EAAMqD,EAAIC,EAAIE,EAAID,EAC/B,CAKAE,GAAAA,CAAI1D,GACFD,EAAQC,GACR,MAAM3C,EAAEA,EAACC,EAAEA,GAAMP,GACToD,GAAIgC,EAAI/B,GAAIgC,EAAI/B,GAAIgC,EAAI/B,GAAIqD,GAAOpD,MACnCJ,GAAI0B,EAAIzB,GAAI0B,EAAIzB,GAAI0B,EAAIzB,GAAIsD,GAAO5D,EAK3C,GAAI3C,IAAMb,QAAQ,GAAI,CACpB,MAAMqG,EAAIrE,GAAM4D,EAAKD,IAAOL,EAAKD,IAC3BiB,EAAItE,GAAM4D,EAAKD,IAAOL,EAAKD,IAC3BuB,EAAI5E,EAAKsE,EAAID,GACnB,GAAIO,IAAM7G,EAAK,OAAOgE,KAAKqC,SAC3B,MAAMG,EAAIvE,EAAK6D,EAAK3F,EAAMkH,GACpBZ,EAAIxE,EAAKmF,EAAKjH,EAAMqF,GACpBmB,EAAIF,EAAID,EACRI,EAAIL,EAAID,EACRQ,EAAIL,EAAID,EACRO,EAAK9E,EAAK0E,EAAIE,GACdG,EAAK/E,EAAK2E,EAAIE,GACdG,EAAKhF,EAAK0E,EAAIG,GACdI,EAAKjF,EAAK4E,EAAID,GACpB,OAAO,IAAIlD,EAAMqD,EAAIC,EAAIE,EAAID,EAC/B,CACA,MAAMX,EAAIrE,EAAK2D,EAAKN,GACdiB,EAAItE,EAAK4D,EAAKN,GACdiB,EAAIvE,EAAKmF,EAAKrG,EAAIsG,GAClBZ,EAAIxE,EAAK6D,EAAKN,GACdmB,EAAI1E,GAAM2D,EAAKC,IAAOP,EAAKC,GAAMe,EAAIC,GACrCM,EAAIJ,EAAID,EACRI,EAAIH,EAAID,EACRM,EAAI7E,EAAKsE,EAAIzF,EAAIwF,GACjBS,EAAK9E,EAAK0E,EAAIE,GACdG,EAAK/E,EAAK2E,EAAIE,GACdG,EAAKhF,EAAK0E,EAAIG,GACdI,EAAKjF,EAAK4E,EAAID,GAEpB,OAAO,IAAIlD,EAAMqD,EAAIC,EAAIE,EAAID,EAC/B,CAEAK,QAAAA,CAAS7D,GACP,OAAOO,KAAKmD,IAAI1D,EAAM2C,SACxB,CAEQmB,IAAAA,CAAK9F,GACX,OAAO+F,EAAKC,WAAWzD,KAAMV,EAAkB7B,EAAGiC,EAAMY,WAC1D,CAGAoD,QAAAA,CAASC,GACP,MAAMtD,EAAEA,EAACuD,EAAEA,GAAM5D,KAAKuD,KAAKnE,EAAcuE,EAAQjG,IACjD,OAAOgC,EAAMY,WAAW,CAACD,EAAGuD,IAAI,EAClC,CAMAC,cAAAA,CAAeF,GACb,IAAIlG,EAAI4B,EAAUsE,GAClB,OAAIlG,IAAMzB,EAAY8H,EAClB9D,KAAK2B,OAAOmC,IAAMrG,IAAMvB,EAAY8D,KACpCA,KAAK2B,OAAOiB,GAAW5C,KAAKuD,KAAK9F,GAAG4C,EACjCmD,EAAKO,aAAa/D,KAAMvC,EACjC,CAMAuG,YAAAA,GACE,OAAOhE,KAAK6D,eAAe9F,GAAUkD,KACvC,CAIAgD,aAAAA,GACE,OAAOT,EAAKO,aAAa/D,KAAMtC,GAAauD,KAC9C,CAIAf,QAAAA,CAASgE,GACP,MAAQtE,GAAIK,EAAGJ,GAAIM,EAAGL,GAAIqE,GAAMnE,KAC1BiB,EAAMjB,KAAKiB,MACP,MAANiD,IAAYA,EAAKjD,EAAM7E,EAAOoB,EAAGgB,IAAI2F,IACzC,MAAMC,EAAKnG,EAAKgC,EAAIiE,GACdG,EAAKpG,EAAKkC,EAAI+D,GACdI,EAAKrG,EAAKkG,EAAID,GACpB,GAAIjD,EAAK,MAAO,CAAEhB,EAAGjE,EAAKmE,EAAGjE,GAC7B,GAAIoI,IAAOpI,EAAK,MAAM,IAAI6C,MAAM,oBAChC,MAAO,CAAEkB,EAAGmE,EAAIjE,EAAGkE,EACrB,CAEAE,aAAAA,GACE,MAAQzG,EAAGC,GAAavB,EACxB,OAAIuB,IAAa7B,EAAY8D,KACtBA,KAAK6D,eAAe9F,EAC7B,CAIA,cAAOyG,CAAQC,EAAUnI,GAAS,GAChC,MAAMS,EAAEA,EAACD,EAAEA,GAAMN,EACXkI,EAAMlH,EAAGmH,MAETC,GADNH,EAAMI,EAAAA,YAAY,WAAYJ,EAAKC,IAChBI,QACbC,EAAWN,EAAIC,EAAM,GAC3BE,EAAOF,EAAM,IAAgB,IAAXK,EAClB,MAAM5E,EAAIvD,kBAAmBgI,GACzBzE,IAAMnE,GAIIoD,EAAce,EAAtB7D,EAAyB0B,EACPR,EAAGwH,OAK3B,MAAMC,EAAKhH,EAAKkC,EAAIA,GACdhC,EAAIF,EAAKgH,EAAK/I,GACdkC,EAAIH,EAAKlB,EAAIkI,EAAKnI,GACxB,IAAIuB,QAAEA,EAASC,MAAO2B,GAAM9C,EAAQgB,EAAGC,GACvC,IAAKC,EAAS,MAAM,IAAIU,MAAM,uCAC9B,MAAMmG,GAAUjF,EAAI/D,KAASA,EACvBiJ,EAAsC,IAAV,IAAXJ,GACvB,IAAKzI,GAAU2D,IAAMjE,GAAOmJ,EAE1B,MAAM,IAAIpG,MAAM,gCAElB,OADIoG,IAAkBD,IAAQjF,EAAIhC,GAAMgC,IACjCP,EAAMU,WAAW,CAAEH,IAAGE,KAC/B,CACA,qBAAOiF,CAAeC,GACpB,OAAOC,EAAqBD,GAASE,KACvC,CACAC,UAAAA,GACE,MAAMvF,EAAEA,EAACE,EAAEA,GAAMH,KAAKE,WAChBxB,EAAQ9B,EAAkB6I,gBAACtF,EAAG3C,EAAGmH,OAEvC,OADAjG,EAAMA,EAAMI,OAAS,IAAMmB,EAAI/D,EAAM,IAAO,EACrCwC,CACT,CACAgH,KAAAA,GACE,OAAO9I,aAAcoD,KAAKwF,aAC5B,EAhQgB9F,EAAAiG,KAAO,IAAIjG,EAAMlD,EAAMoJ,GAAIpJ,EAAMqJ,GAAI3J,EAAK+B,EAAKzB,EAAMoJ,GAAKpJ,EAAMqJ,KAChEnG,EAAAyC,KAAO,IAAIzC,EAAM1D,EAAKE,EAAKA,EAAKF,GAiQlD,MAAQ2J,KAAM/C,EAAGT,KAAM2B,GAAMpE,EACvB8D,EAAOD,EAAIA,KAAC7D,EAAqB,EAAd7B,GAEzB,SAASiI,EAAKhJ,GACZ,OAAOiJ,EAAGA,IAACjJ,EAAGY,EAChB,CAEA,SAASsI,EAAQnJ,GACf,OAAOiJ,EAAKlJ,EAAAA,gBAAmBC,GACjC,CAGA,SAASyI,EAAqBW,GAC5B,MAAMvB,EAAM7G,EACZoI,EAAMpB,EAAAA,YAAY,cAAeoB,EAAKvB,GAGtC,MAAMwB,EAASrB,EAAWA,YAAC,qBAAsBjH,EAAMqI,GAAM,EAAIvB,GAC3DyB,EAAOlJ,EAAkBiJ,EAAOpB,MAAM,EAAGJ,IACzC0B,EAASF,EAAOpB,MAAMJ,EAAK,EAAIA,GAC/Bf,EAASqC,EAAQG,GACjBZ,EAAQ3C,EAAEc,SAASC,GACnB0C,EAAad,EAAMC,aACzB,MAAO,CAAEW,OAAMC,SAAQzC,SAAQ4B,QAAOc,aACxC,CAQA,SAASC,EAAmBC,EAAe,IAAIC,cAAiBC,GAC9D,MAAMC,EAAM9J,EAAAA,eAAkB6J,GAC9B,OAAOT,EAAQpI,EAAMV,EAAOwJ,EAAK7B,EAAWA,YAAC,UAAW0B,KAAY5I,IACtE,CAgBA,MAAMgJ,EAAkDtK,EA+CxD,OApBAuG,EAAEhC,eAAe,GAoBV,CACLpE,QACAoK,aAzEF,SAAsBvB,GACpB,OAAOC,EAAqBD,GAASgB,UACvC,EAwEEQ,KA/DF,SAAcH,EAAUrB,EAAcyB,EAA6B,CAAA,GACjEJ,EAAM7B,EAAWA,YAAC,UAAW6B,GACzB/I,IAAS+I,EAAM/I,EAAQ+I,IAC3B,MAAMN,OAAEA,EAAMzC,OAAEA,EAAM0C,WAAEA,GAAef,EAAqBD,GACtD0B,EAAIT,EAAmBQ,EAAQP,QAASH,EAAQM,GAChDM,EAAIpE,EAAEc,SAASqD,GAAGvB,aAElByB,EAAInB,EAAKiB,EADLT,EAAmBQ,EAAQP,QAASS,EAAGX,EAAYK,GACtC/C,GACvBtE,EAAU4H,GACV,MAAMC,EAAMtK,EAAcuK,YAACH,EAAGpK,EAAAA,gBAAmBqK,EAAGzJ,EAAGmH,QACvD,OAAOE,EAAWA,YAAC,SAAUqC,EAAmB,EAAdrJ,EACpC,EAqDEuJ,OAlDF,SAAgBC,EAAUX,EAAUY,EAAgBR,EAAUH,GAC5D,MAAMJ,QAAEA,EAAOjK,OAAEA,GAAWwK,EACtBpC,EAAMlH,EAAGmH,MACf0C,EAAMxC,EAAWA,YAAC,YAAawC,EAAK,EAAI3C,GACxCgC,EAAM7B,EAAWA,YAAC,UAAW6B,GACzB/I,IAAS+I,EAAM/I,EAAQ+I,IAE3B,MAAMO,EAAIrK,EAAkB2K,gBAACF,EAAIvC,MAAMJ,EAAK,EAAIA,IAGhD,IAAIpC,EAAG0E,EAAGQ,EACV,IACElF,EAAI5C,EAAM8E,QAAQ8C,EAAWhL,GAC7B0K,EAAItH,EAAM8E,QAAQ6C,EAAIvC,MAAM,EAAGJ,GAAMpI,GACrCkL,EAAK5E,EAAEiB,eAAeoD,EACvB,CAAC,MAAOQ,GACP,OAAO,CACT,CACA,IAAKnL,GAAUgG,EAAE0B,eAAgB,OAAO,EAExC,MAAM0D,EAAIpB,EAAmBC,EAASS,EAAExB,aAAclD,EAAEkD,aAAckB,GAGtE,OAFYM,EAAE7D,IAAIb,EAAEuB,eAAe6D,IAExBpE,SAASkE,GAAIjD,gBAAgB5C,OAAOjC,EAAMyC,KACvD,EA2BEwF,cAAejI,EACfkI,MAxBY,CACZtC,uBAEAuC,iBAAkBA,IAAkB7K,EAAYQ,EAAGmH,OAQnDmD,WAAUA,CAACjH,EAAa,EAAG0E,EAAQ7F,EAAMiG,QACvCJ,EAAM3E,eAAeC,GACrB0E,EAAM7B,SAASzH,OAAO,IACfsJ,IAYb","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/@noble/curves/esm/abstract/modular.cjs

@@ -0,0 +1,3 @@
+"use strict";var t=require("./utils.cjs");
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const r=BigInt(0),e=BigInt(1),n=BigInt(2),o=BigInt(3),i=BigInt(4),s=BigInt(5),u=BigInt(8);function f(t,e){const n=t%e;return n>=r?n:e+n}function c(t,n,o){if(o<=r||n<r)throw new Error("Expected power/modulo > 0");if(o===e)return r;let i=e;for(;n>r;)n&e&&(i=i*t%o),t=t*t%o,n>>=e;return i}function l(t,n){if(t===r||n<=r)throw new Error(`invert: expected positive integers, got n=${t} mod=${n}`);let o=f(t,n),i=n,s=r,u=e;for(;o!==r;){const t=i%o,r=s-u*(i/o);i=o,o=t,s=u,u=r}if(i!==e)throw new Error("invert: does not exist");return f(s,n)}function d(t){const o=(t-e)/n;let s,u,f;for(s=t-e,u=0;s%n===r;s/=n,u++);for(f=n;f<t&&c(f,o,t)!==t-e;f++);if(1===u){const r=(t+e)/i;return function(t,e){const n=t.pow(e,r);if(!t.eql(t.sqr(n),e))throw new Error("Cannot find square root");return n}}const l=(s+e)/n;return function(t,r){if(t.pow(r,o)===t.neg(t.ONE))throw new Error("Cannot find square root");let n=u,i=t.pow(t.mul(t.ONE,f),s),c=t.pow(r,l),d=t.pow(r,s);for(;!t.eql(d,t.ONE);){if(t.eql(d,t.ZERO))return t.ZERO;let r=1;for(let e=t.sqr(d);r<n&&!t.eql(e,t.ONE);r++)e=t.sqr(e);const o=t.pow(i,e<<BigInt(n-r-1));i=t.sqr(o),c=t.mul(c,o),d=t.mul(d,i),n=r}return c}}function p(t){if(t%i===o){const r=(t+e)/i;return function(t,e){const n=t.pow(e,r);if(!t.eql(t.sqr(n),e))throw new Error("Cannot find square root");return n}}if(t%u===s){const r=(t-s)/u;return function(t,e){const o=t.mul(e,n),i=t.pow(o,r),s=t.mul(e,i),u=t.mul(t.mul(s,n),i),f=t.mul(s,t.sub(u,t.ONE));if(!t.eql(t.sqr(f),e))throw new Error("Cannot find square root");return f}}return d(t)}BigInt(9),BigInt(16);const w=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function E(t,n,o){if(o<r)throw new Error("Expected power > 0");if(o===r)return t.ONE;if(o===e)return n;let i=t.ONE,s=n;for(;o>r;)o&e&&(i=t.mul(i,s)),s=t.sqr(s),o>>=e;return i}function g(t,r){const e=new Array(r.length),n=r.reduce(((r,n,o)=>t.is0(n)?r:(e[o]=r,t.mul(r,n))),t.ONE),o=t.inv(n);return r.reduceRight(((r,n,o)=>t.is0(n)?r:(e[o]=t.mul(r,e[o]),t.mul(r,n))),o),e}function a(t,r){const e=void 0!==r?r:t.toString(2).length;return{nBitLength:e,nByteLength:Math.ceil(e/8)}}exports.Field=function(n,o,i=!1,s={}){if(n<=r)throw new Error(`Expected Field ORDER > 0, got ${n}`);const{nBitLength:u,nByteLength:c}=a(n,o);if(c>2048)throw new Error("Field lengths over 2048 bytes are not supported");const d=p(n),w=Object.freeze({ORDER:n,BITS:u,BYTES:c,MASK:t.bitMask(u),ZERO:r,ONE:e,create:t=>f(t,n),isValid:t=>{if("bigint"!=typeof t)throw new Error("Invalid field element: expected bigint, got "+typeof t);return r<=t&&t<n},is0:t=>t===r,isOdd:t=>(t&e)===e,neg:t=>f(-t,n),eql:(t,r)=>t===r,sqr:t=>f(t*t,n),add:(t,r)=>f(t+r,n),sub:(t,r)=>f(t-r,n),mul:(t,r)=>f(t*r,n),pow:(t,r)=>E(w,t,r),div:(t,r)=>f(t*l(r,n),n),sqrN:t=>t*t,addN:(t,r)=>t+r,subN:(t,r)=>t-r,mulN:(t,r)=>t*r,inv:t=>l(t,n),sqrt:s.sqrt||(t=>d(w,t)),invertBatch:t=>g(w,t),cmov:(t,r,e)=>e?r:t,toBytes:r=>i?t.numberToBytesLE(r,c):t.numberToBytesBE(r,c),fromBytes:r=>{if(r.length!==c)throw new Error(`Fp.fromBytes: expected ${c}, got ${r.length}`);return i?t.bytesToNumberLE(r):t.bytesToNumberBE(r)}});return Object.freeze(w)},exports.FpInvertBatch=g,exports.FpPow=E,exports.FpSqrt=p,exports.FpSqrtEven=function(t,r){if(!t.isOdd)throw new Error("Field doesn't have isOdd");const e=t.sqrt(r);return t.isOdd(e)?t.neg(e):e},exports.invert=l,exports.isNegativeLE=(t,r)=>(f(t,r)&e)===e,exports.mod=f,exports.nLength=a,exports.pow=c,exports.pow2=function(t,e,n){let o=t;for(;e-- >r;)o*=o,o%=n;return o},exports.tonelliShanks=d,exports.validateField=function(r){const e=w.reduce(((t,r)=>(t[r]="function",t)),{ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"});return t.validateObject(r,e)};
+//# sourceMappingURL=modular.cjs.map

package/dist/cjs/node_modules/@noble/curves/esm/abstract/modular.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"modular.cjs","sources":["../../../../../../../node_modules/@noble/curves/esm/abstract/modular.js"],"sourcesContent":["/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\nimport { bitMask, numberToBytesBE, numberToBytesLE, bytesToNumberBE, bytesToNumberLE, ensureBytes, validateObject, } from './utils.js';\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _4n = BigInt(4), _5n = BigInt(5), _8n = BigInt(8);\n// prettier-ignore\nconst _9n = BigInt(9), _16n = BigInt(16);\n// Calculates a modulo b\nexport function mod(a, b) {\n    const result = a % b;\n    return result >= _0n ? result : b + result;\n}\n/**\n * Efficiently raise num to power and do modular division.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\n// TODO: use field version && remove\nexport function pow(num, power, modulo) {\n    if (modulo <= _0n || power < _0n)\n        throw new Error('Expected power/modulo > 0');\n    if (modulo === _1n)\n        return _0n;\n    let res = _1n;\n    while (power > _0n) {\n        if (power & _1n)\n            res = (res * num) % modulo;\n        num = (num * num) % modulo;\n        power >>= _1n;\n    }\n    return res;\n}\n// Does x ^ (2 ^ power) mod p. pow2(30, 4) == 30 ^ (2 ^ 4)\nexport function pow2(x, power, modulo) {\n    let res = x;\n    while (power-- > _0n) {\n        res *= res;\n        res %= modulo;\n    }\n    return res;\n}\n// Inverses number over modulo\nexport function invert(number, modulo) {\n    if (number === _0n || modulo <= _0n) {\n        throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n    }\n    // Euclidean GCD https://brilliant.org/wiki/extended-euclidean-algorithm/\n    // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n    let a = mod(number, modulo);\n    let b = modulo;\n    // prettier-ignore\n    let x = _0n, y = _1n, u = _1n, v = _0n;\n    while (a !== _0n) {\n        // JIT applies optimization if those two lines follow each other\n        const q = b / a;\n        const r = b % a;\n        const m = x - u * q;\n        const n = y - v * q;\n        // prettier-ignore\n        b = a, a = r, x = u, y = v, u = m, v = n;\n    }\n    const gcd = b;\n    if (gcd !== _1n)\n        throw new Error('invert: does not exist');\n    return mod(x, modulo);\n}\n/**\n * Tonelli-Shanks square root search algorithm.\n * 1. https://eprint.iacr.org/2012/685.pdf (page 12)\n * 2. Square Roots from 1; 24, 51, 10 to Dan Shanks\n * Will start an infinite loop if field order P is not prime.\n * @param P field order\n * @returns function that takes field Fp (created from P) and number n\n */\nexport function tonelliShanks(P) {\n    // Legendre constant: used to calculate Legendre symbol (a | p),\n    // which denotes the value of a^((p-1)/2) (mod p).\n    // (a | p) ≡ 1    if a is a square (mod p)\n    // (a | p) ≡ -1   if a is not a square (mod p)\n    // (a | p) ≡ 0    if a ≡ 0 (mod p)\n    const legendreC = (P - _1n) / _2n;\n    let Q, S, Z;\n    // Step 1: By factoring out powers of 2 from p - 1,\n    // find q and s such that p - 1 = q*(2^s) with q odd\n    for (Q = P - _1n, S = 0; Q % _2n === _0n; Q /= _2n, S++)\n        ;\n    // Step 2: Select a non-square z such that (z | p) ≡ -1 and set c ≡ zq\n    for (Z = _2n; Z < P && pow(Z, legendreC, P) !== P - _1n; Z++)\n        ;\n    // Fast-path\n    if (S === 1) {\n        const p1div4 = (P + _1n) / _4n;\n        return function tonelliFast(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Slow-path\n    const Q1div2 = (Q + _1n) / _2n;\n    return function tonelliSlow(Fp, n) {\n        // Step 0: Check that n is indeed a square: (n | p) should not be ≡ -1\n        if (Fp.pow(n, legendreC) === Fp.neg(Fp.ONE))\n            throw new Error('Cannot find square root');\n        let r = S;\n        // TODO: will fail at Fp2/etc\n        let g = Fp.pow(Fp.mul(Fp.ONE, Z), Q); // will update both x and b\n        let x = Fp.pow(n, Q1div2); // first guess at the square root\n        let b = Fp.pow(n, Q); // first guess at the fudge factor\n        while (!Fp.eql(b, Fp.ONE)) {\n            if (Fp.eql(b, Fp.ZERO))\n                return Fp.ZERO; // https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm (4. If t = 0, return r = 0)\n            // Find m such b^(2^m)==1\n            let m = 1;\n            for (let t2 = Fp.sqr(b); m < r; m++) {\n                if (Fp.eql(t2, Fp.ONE))\n                    break;\n                t2 = Fp.sqr(t2); // t2 *= t2\n            }\n            // NOTE: r-m-1 can be bigger than 32, need to convert to bigint before shift, otherwise there will be overflow\n            const ge = Fp.pow(g, _1n << BigInt(r - m - 1)); // ge = 2^(r-m-1)\n            g = Fp.sqr(ge); // g = ge * ge\n            x = Fp.mul(x, ge); // x *= ge\n            b = Fp.mul(b, g); // b *= g\n            r = m;\n        }\n        return x;\n    };\n}\nexport function FpSqrt(P) {\n    // NOTE: different algorithms can give different roots, it is up to user to decide which one they want.\n    // For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).\n    // P ≡ 3 (mod 4)\n    // √n = n^((P+1)/4)\n    if (P % _4n === _3n) {\n        // Not all roots possible!\n        // const ORDER =\n        //   0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn;\n        // const NUM = 72057594037927816n;\n        const p1div4 = (P + _1n) / _4n;\n        return function sqrt3mod4(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            // Throw if root**2 != n\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Atkin algorithm for q ≡ 5 (mod 8), https://eprint.iacr.org/2012/685.pdf (page 10)\n    if (P % _8n === _5n) {\n        const c1 = (P - _5n) / _8n;\n        return function sqrt5mod8(Fp, n) {\n            const n2 = Fp.mul(n, _2n);\n            const v = Fp.pow(n2, c1);\n            const nv = Fp.mul(n, v);\n            const i = Fp.mul(Fp.mul(nv, _2n), v);\n            const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // P ≡ 9 (mod 16)\n    if (P % _16n === _9n) {\n        // NOTE: tonelli is too slow for bls-Fp2 calculations even on start\n        // Means we cannot use sqrt for constants at all!\n        //\n        // const c1 = Fp.sqrt(Fp.negate(Fp.ONE)); //  1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n        // const c2 = Fp.sqrt(c1);                //  2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n        // const c3 = Fp.sqrt(Fp.negate(c1));     //  3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F\n        // const c4 = (P + _7n) / _16n;           //  4. c4 = (q + 7) / 16        # Integer arithmetic\n        // sqrt = (x) => {\n        //   let tv1 = Fp.pow(x, c4);             //  1. tv1 = x^c4\n        //   let tv2 = Fp.mul(c1, tv1);           //  2. tv2 = c1 * tv1\n        //   const tv3 = Fp.mul(c2, tv1);         //  3. tv3 = c2 * tv1\n        //   let tv4 = Fp.mul(c3, tv1);           //  4. tv4 = c3 * tv1\n        //   const e1 = Fp.equals(Fp.square(tv2), x); //  5.  e1 = (tv2^2) == x\n        //   const e2 = Fp.equals(Fp.square(tv3), x); //  6.  e2 = (tv3^2) == x\n        //   tv1 = Fp.cmov(tv1, tv2, e1); //  7. tv1 = CMOV(tv1, tv2, e1)  # Select tv2 if (tv2^2) == x\n        //   tv2 = Fp.cmov(tv4, tv3, e2); //  8. tv2 = CMOV(tv4, tv3, e2)  # Select tv3 if (tv3^2) == x\n        //   const e3 = Fp.equals(Fp.square(tv2), x); //  9.  e3 = (tv2^2) == x\n        //   return Fp.cmov(tv1, tv2, e3); //  10.  z = CMOV(tv1, tv2, e3)  # Select the sqrt from tv1 and tv2\n        // }\n    }\n    // Other cases: Tonelli-Shanks algorithm\n    return tonelliShanks(P);\n}\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num, modulo) => (mod(num, modulo) & _1n) === _1n;\n// prettier-ignore\nconst FIELD_FIELDS = [\n    'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n    'eql', 'add', 'sub', 'mul', 'pow', 'div',\n    'addN', 'subN', 'mulN', 'sqrN'\n];\nexport function validateField(field) {\n    const initial = {\n        ORDER: 'bigint',\n        MASK: 'bigint',\n        BYTES: 'isSafeInteger',\n        BITS: 'isSafeInteger',\n    };\n    const opts = FIELD_FIELDS.reduce((map, val) => {\n        map[val] = 'function';\n        return map;\n    }, initial);\n    return validateObject(field, opts);\n}\n// Generic field functions\n/**\n * Same as `pow` but for Fp: non-constant-time.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n */\nexport function FpPow(f, num, power) {\n    // Should have same speed as pow for bigints\n    // TODO: benchmark!\n    if (power < _0n)\n        throw new Error('Expected power > 0');\n    if (power === _0n)\n        return f.ONE;\n    if (power === _1n)\n        return num;\n    let p = f.ONE;\n    let d = num;\n    while (power > _0n) {\n        if (power & _1n)\n            p = f.mul(p, d);\n        d = f.sqr(d);\n        power >>= _1n;\n    }\n    return p;\n}\n/**\n * Efficiently invert an array of Field elements.\n * `inv(0)` will return `undefined` here: make sure to throw an error.\n */\nexport function FpInvertBatch(f, nums) {\n    const tmp = new Array(nums.length);\n    // Walk from first to last, multiply them by each other MOD p\n    const lastMultiplied = nums.reduce((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = acc;\n        return f.mul(acc, num);\n    }, f.ONE);\n    // Invert last element\n    const inverted = f.inv(lastMultiplied);\n    // Walk from last to first, multiply them by inverted each other MOD p\n    nums.reduceRight((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = f.mul(acc, tmp[i]);\n        return f.mul(acc, num);\n    }, inverted);\n    return tmp;\n}\nexport function FpDiv(f, lhs, rhs) {\n    return f.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, f.ORDER) : f.inv(rhs));\n}\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare(f) {\n    const legendreConst = (f.ORDER - _1n) / _2n; // Integer arithmetic\n    return (x) => {\n        const p = f.pow(x, legendreConst);\n        return f.eql(p, f.ZERO) || f.eql(p, f.ONE);\n    };\n}\n// CURVE.n lengths\nexport function nLength(n, nBitLength) {\n    // Bit size, byte size of CURVE.n\n    const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n    const nByteLength = Math.ceil(_nBitLength / 8);\n    return { nBitLength: _nBitLength, nByteLength };\n}\n/**\n * Initializes a finite field over prime. **Non-primes are not supported.**\n * Do not init in loop: slow. Very fragile: always run a benchmark on a change.\n * Major performance optimizations:\n * * a) denormalized operations like mulN instead of mul\n * * b) same object shape: never add or remove keys\n * * c) Object.freeze\n * @param ORDER prime positive bigint\n * @param bitLen how many bits the field consumes\n * @param isLE (def: false) if encoding / decoding should be in little-endian\n * @param redef optional faster redefinitions of sqrt and other methods\n */\nexport function Field(ORDER, bitLen, isLE = false, redef = {}) {\n    if (ORDER <= _0n)\n        throw new Error(`Expected Field ORDER > 0, got ${ORDER}`);\n    const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n    if (BYTES > 2048)\n        throw new Error('Field lengths over 2048 bytes are not supported');\n    const sqrtP = FpSqrt(ORDER);\n    const f = Object.freeze({\n        ORDER,\n        BITS,\n        BYTES,\n        MASK: bitMask(BITS),\n        ZERO: _0n,\n        ONE: _1n,\n        create: (num) => mod(num, ORDER),\n        isValid: (num) => {\n            if (typeof num !== 'bigint')\n                throw new Error(`Invalid field element: expected bigint, got ${typeof num}`);\n            return _0n <= num && num < ORDER; // 0 is valid element, but it's not invertible\n        },\n        is0: (num) => num === _0n,\n        isOdd: (num) => (num & _1n) === _1n,\n        neg: (num) => mod(-num, ORDER),\n        eql: (lhs, rhs) => lhs === rhs,\n        sqr: (num) => mod(num * num, ORDER),\n        add: (lhs, rhs) => mod(lhs + rhs, ORDER),\n        sub: (lhs, rhs) => mod(lhs - rhs, ORDER),\n        mul: (lhs, rhs) => mod(lhs * rhs, ORDER),\n        pow: (num, power) => FpPow(f, num, power),\n        div: (lhs, rhs) => mod(lhs * invert(rhs, ORDER), ORDER),\n        // Same as above, but doesn't normalize\n        sqrN: (num) => num * num,\n        addN: (lhs, rhs) => lhs + rhs,\n        subN: (lhs, rhs) => lhs - rhs,\n        mulN: (lhs, rhs) => lhs * rhs,\n        inv: (num) => invert(num, ORDER),\n        sqrt: redef.sqrt || ((n) => sqrtP(f, n)),\n        invertBatch: (lst) => FpInvertBatch(f, lst),\n        // TODO: do we really need constant cmov?\n        // We don't have const-time bigints anyway, so probably will be not very useful\n        cmov: (a, b, c) => (c ? b : a),\n        toBytes: (num) => (isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES)),\n        fromBytes: (bytes) => {\n            if (bytes.length !== BYTES)\n                throw new Error(`Fp.fromBytes: expected ${BYTES}, got ${bytes.length}`);\n            return isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n        },\n    });\n    return Object.freeze(f);\n}\nexport function FpSqrtOdd(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(`Field doesn't have isOdd`);\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? root : Fp.neg(root);\n}\nexport function FpSqrtEven(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(`Field doesn't have isOdd`);\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Same as mapKeyToField, but accepts less bytes (40 instead of 48 for 32-byte field).\n * Which makes it slightly more biased, less secure.\n * @deprecated use mapKeyToField instead\n */\nexport function hashToPrivateScalar(hash, groupOrder, isLE = false) {\n    hash = ensureBytes('privateHash', hash);\n    const hashLen = hash.length;\n    const minLen = nLength(groupOrder).nByteLength + 8;\n    if (minLen < 24 || hashLen < minLen || hashLen > 1024)\n        throw new Error(`hashToPrivateScalar: expected ${minLen}-1024 bytes of input, got ${hashLen}`);\n    const num = isLE ? bytesToNumberLE(hash) : bytesToNumberBE(hash);\n    return mod(num, groupOrder - _1n) + _1n;\n}\n/**\n * Returns total number of bytes consumed by the field element.\n * For example, 32 bytes for usual 256-bit weierstrass curve.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of field\n */\nexport function getFieldBytesLength(fieldOrder) {\n    if (typeof fieldOrder !== 'bigint')\n        throw new Error('field order must be bigint');\n    const bitLength = fieldOrder.toString(2).length;\n    return Math.ceil(bitLength / 8);\n}\n/**\n * Returns minimal amount of bytes that can be safely reduced\n * by field order.\n * Should be 2^-128 for 128-bit curve such as P256.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of target hash\n */\nexport function getMinHashLength(fieldOrder) {\n    const length = getFieldBytesLength(fieldOrder);\n    return length + Math.ceil(length / 2);\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 48 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * FIPS 186-5, A.2 https://csrc.nist.gov/publications/detail/fips/186/5/final\n * RFC 9380, https://www.rfc-editor.org/rfc/rfc9380#section-5\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. secp256k1.CURVE.n)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function mapHashToField(key, fieldOrder, isLE = false) {\n    const len = key.length;\n    const fieldLen = getFieldBytesLength(fieldOrder);\n    const minLen = getMinHashLength(fieldOrder);\n    // No small numbers: need to understand bias story. No huge numbers: easier to detect JS timings.\n    if (len < 16 || len < minLen || len > 1024)\n        throw new Error(`expected ${minLen}-1024 bytes of input, got ${len}`);\n    const num = isLE ? bytesToNumberBE(key) : bytesToNumberLE(key);\n    // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n    const reduced = mod(num, fieldOrder - _1n) + _1n;\n    return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);\n}\n//# sourceMappingURL=modular.js.map"],"names":["_0n","BigInt","_1n","_2n","_3n","_4n","_5n","_8n","mod","a","b","result","pow","num","power","modulo","Error","res","invert","number","x","u","r","m","tonelliShanks","P","legendreC","Q","S","Z","p1div4","Fp","n","root","eql","sqr","Q1div2","neg","ONE","g","mul","ZERO","t2","ge","FpSqrt","c1","n2","v","nv","i","sub","FIELD_FIELDS","FpPow","f","p","d","FpInvertBatch","nums","tmp","Array","length","lastMultiplied","reduce","acc","is0","inverted","inv","reduceRight","nLength","nBitLength","_nBitLength","undefined","toString","nByteLength","Math","ceil","ORDER","bitLen","isLE","redef","BITS","BYTES","sqrtP","Object","freeze","MASK","bitMask","create","isValid","isOdd","lhs","rhs","add","div","sqrN","addN","subN","mulN","sqrt","invertBatch","lst","cmov","c","toBytes","numberToBytesLE","numberToBytesBE","fromBytes","bytes","bytesToNumberLE","bytesToNumberBE","elm","isNegativeLE","field","opts","map","val","validateObject"],"mappings":";sEAYA,MAAMA,EAAMC,OAAO,GAAIC,EAAMD,OAAO,GAAIE,EAAMF,OAAO,GAAIG,EAAMH,OAAO,GAEhEI,EAAMJ,OAAO,GAAIK,EAAML,OAAO,GAAIM,EAAMN,OAAO,GAK/C,SAAUO,EAAIC,EAAWC,GAC7B,MAAMC,EAASF,EAAIC,EACnB,OAAOC,GAAUX,EAAMW,EAASD,EAAIC,CACtC,CAQM,SAAUC,EAAIC,EAAaC,EAAeC,GAC9C,GAAIA,GAAUf,GAAOc,EAAQd,EAAK,MAAM,IAAIgB,MAAM,6BAClD,GAAID,IAAWb,EAAK,OAAOF,EAC3B,IAAIiB,EAAMf,EACV,KAAOY,EAAQd,GACTc,EAAQZ,IAAKe,EAAOA,EAAMJ,EAAOE,GACrCF,EAAOA,EAAMA,EAAOE,EACpBD,IAAUZ,EAEZ,OAAOe,CACT,CAaM,SAAUC,EAAOC,EAAgBJ,GACrC,GAAII,IAAWnB,GAAOe,GAAUf,EAC9B,MAAM,IAAIgB,MAAM,6CAA6CG,SAAcJ,KAI7E,IAAIN,EAAID,EAAIW,EAAQJ,GAChBL,EAAIK,EAEJK,EAAIpB,EAAcqB,EAAInB,EAC1B,KAAOO,IAAMT,GAAK,CAEhB,MACMsB,EAAIZ,EAAID,EACRc,EAAIH,EAAIC,GAFJX,EAAID,GAKdC,EAAID,EAAGA,EAAIa,EAAGF,EAAIC,EAAUA,EAAIE,CAClC,CAEA,GADYb,IACAR,EAAK,MAAM,IAAIc,MAAM,0BACjC,OAAOR,EAAIY,EAAGL,EAChB,CAUM,SAAUS,EAAcC,GAM5B,MAAMC,GAAaD,EAAIvB,GAAOC,EAE9B,IAAIwB,EAAWC,EAAWC,EAG1B,IAAKF,EAAIF,EAAIvB,EAAK0B,EAAI,EAAGD,EAAIxB,IAAQH,EAAK2B,GAAKxB,EAAKyB,KAGpD,IAAKC,EAAI1B,EAAK0B,EAAIJ,GAAKb,EAAIiB,EAAGH,EAAWD,KAAOA,EAAIvB,EAAK2B,KAGzD,GAAU,IAAND,EAAS,CACX,MAAME,GAAUL,EAAIvB,GAAOG,EAC3B,OAAO,SAAwB0B,EAAeC,GAC5C,MAAMC,EAAOF,EAAGnB,IAAIoB,EAAGF,GACvB,IAAKC,EAAGG,IAAIH,EAAGI,IAAIF,GAAOD,GAAI,MAAM,IAAIhB,MAAM,2BAC9C,OAAOiB,EAEX,CAGA,MAAMG,GAAUT,EAAIzB,GAAOC,EAC3B,OAAO,SAAwB4B,EAAeC,GAE5C,GAAID,EAAGnB,IAAIoB,EAAGN,KAAeK,EAAGM,IAAIN,EAAGO,KAAM,MAAM,IAAItB,MAAM,2BAC7D,IAAIM,EAAIM,EAEJW,EAAIR,EAAGnB,IAAImB,EAAGS,IAAIT,EAAGO,IAAKT,GAAIF,GAC9BP,EAAIW,EAAGnB,IAAIoB,EAAGI,GACd1B,EAAIqB,EAAGnB,IAAIoB,EAAGL,GAElB,MAAQI,EAAGG,IAAIxB,EAAGqB,EAAGO,MAAM,CACzB,GAAIP,EAAGG,IAAIxB,EAAGqB,EAAGU,MAAO,OAAOV,EAAGU,KAElC,IAAIlB,EAAI,EACR,IAAK,IAAImB,EAAKX,EAAGI,IAAIzB,GAAIa,EAAID,IACvBS,EAAGG,IAAIQ,EAAIX,EAAGO,KADYf,IAE9BmB,EAAKX,EAAGI,IAAIO,GAGd,MAAMC,EAAKZ,EAAGnB,IAAI2B,EAAGrC,GAAOD,OAAOqB,EAAIC,EAAI,IAC3CgB,EAAIR,EAAGI,IAAIQ,GACXvB,EAAIW,EAAGS,IAAIpB,EAAGuB,GACdjC,EAAIqB,EAAGS,IAAI9B,EAAG6B,GACdjB,EAAIC,CACN,CACA,OAAOH,EAEX,CAEM,SAAUwB,EAAOnB,GAMrB,GAAIA,EAAIpB,IAAQD,EAAK,CAKnB,MAAM0B,GAAUL,EAAIvB,GAAOG,EAC3B,OAAO,SAAsB0B,EAAeC,GAC1C,MAAMC,EAAOF,EAAGnB,IAAIoB,EAAGF,GAEvB,IAAKC,EAAGG,IAAIH,EAAGI,IAAIF,GAAOD,GAAI,MAAM,IAAIhB,MAAM,2BAC9C,OAAOiB,EAEX,CAGA,GAAIR,EAAIlB,IAAQD,EAAK,CACnB,MAAMuC,GAAMpB,EAAInB,GAAOC,EACvB,OAAO,SAAsBwB,EAAeC,GAC1C,MAAMc,EAAKf,EAAGS,IAAIR,EAAG7B,GACf4C,EAAIhB,EAAGnB,IAAIkC,EAAID,GACfG,EAAKjB,EAAGS,IAAIR,EAAGe,GACfE,EAAIlB,EAAGS,IAAIT,EAAGS,IAAIQ,EAAI7C,GAAM4C,GAC5Bd,EAAOF,EAAGS,IAAIQ,EAAIjB,EAAGmB,IAAID,EAAGlB,EAAGO,MACrC,IAAKP,EAAGG,IAAIH,EAAGI,IAAIF,GAAOD,GAAI,MAAM,IAAIhB,MAAM,2BAC9C,OAAOiB,EAEX,CA0BA,OAAOT,EAAcC,EACvB,CAxLYxB,OAAO,GAAWA,OAAO,UAwO/BkD,EAAe,CACnB,SAAU,UAAW,MAAO,MAAO,MAAO,OAAQ,MAClD,MAAO,MAAO,MAAO,MAAO,MAAO,MACnC,OAAQ,OAAQ,OAAQ,QAsBpB,SAAUC,EAASC,EAAcxC,EAAQC,GAG7C,GAAIA,EAAQd,EAAK,MAAM,IAAIgB,MAAM,sBACjC,GAAIF,IAAUd,EAAK,OAAOqD,EAAEf,IAC5B,GAAIxB,IAAUZ,EAAK,OAAOW,EAC1B,IAAIyC,EAAID,EAAEf,IACNiB,EAAI1C,EACR,KAAOC,EAAQd,GACTc,EAAQZ,IAAKoD,EAAID,EAAEb,IAAIc,EAAGC,IAC9BA,EAAIF,EAAElB,IAAIoB,GACVzC,IAAUZ,EAEZ,OAAOoD,CACT,CAMM,SAAUE,EAAiBH,EAAcI,GAC7C,MAAMC,EAAM,IAAIC,MAAMF,EAAKG,QAErBC,EAAiBJ,EAAKK,QAAO,CAACC,EAAKlD,EAAKoC,IACxCI,EAAEW,IAAInD,GAAakD,GACvBL,EAAIT,GAAKc,EACFV,EAAEb,IAAIuB,EAAKlD,KACjBwC,EAAEf,KAEC2B,EAAWZ,EAAEa,IAAIL,GAOvB,OALAJ,EAAKU,aAAY,CAACJ,EAAKlD,EAAKoC,IACtBI,EAAEW,IAAInD,GAAakD,GACvBL,EAAIT,GAAKI,EAAEb,IAAIuB,EAAKL,EAAIT,IACjBI,EAAEb,IAAIuB,EAAKlD,KACjBoD,GACIP,CACT,CAgBM,SAAUU,EAAQpC,EAAWqC,GAEjC,MAAMC,OAA6BC,IAAfF,EAA2BA,EAAarC,EAAEwC,SAAS,GAAGZ,OAE1E,MAAO,CAAES,WAAYC,EAAaG,YADdC,KAAKC,KAAKL,EAAc,GAE9C,eAeM,SACJM,EACAC,EACAC,GAAO,EACPC,EAAiC,IAEjC,GAAIH,GAAS5E,EAAK,MAAM,IAAIgB,MAAM,iCAAiC4D,KACnE,MAAQP,WAAYW,EAAMP,YAAaQ,GAAUb,EAAQQ,EAAOC,GAChE,GAAII,EAAQ,KAAM,MAAM,IAAIjE,MAAM,mDAClC,MAAMkE,EAAQtC,EAAOgC,GACfvB,EAAuB8B,OAAOC,OAAO,CACzCR,QACAI,OACAC,QACAI,KAAMC,EAAOA,QAACN,GACdvC,KAAMzC,EACNsC,IAAKpC,EACLqF,OAAS1E,GAAQL,EAAIK,EAAK+D,GAC1BY,QAAU3E,IACR,GAAmB,iBAARA,EACT,MAAM,IAAIG,MAAM,sDAAsDH,GACxE,OAAOb,GAAOa,GAAOA,EAAM+D,CAAK,EAElCZ,IAAMnD,GAAQA,IAAQb,EACtByF,MAAQ5E,IAASA,EAAMX,KAASA,EAChCmC,IAAMxB,GAAQL,GAAKK,EAAK+D,GACxB1C,IAAKA,CAACwD,EAAKC,IAAQD,IAAQC,EAE3BxD,IAAMtB,GAAQL,EAAIK,EAAMA,EAAK+D,GAC7BgB,IAAKA,CAACF,EAAKC,IAAQnF,EAAIkF,EAAMC,EAAKf,GAClC1B,IAAKA,CAACwC,EAAKC,IAAQnF,EAAIkF,EAAMC,EAAKf,GAClCpC,IAAKA,CAACkD,EAAKC,IAAQnF,EAAIkF,EAAMC,EAAKf,GAClChE,IAAKA,CAACC,EAAKC,IAAUsC,EAAMC,EAAGxC,EAAKC,GACnC+E,IAAKA,CAACH,EAAKC,IAAQnF,EAAIkF,EAAMxE,EAAOyE,EAAKf,GAAQA,GAGjDkB,KAAOjF,GAAQA,EAAMA,EACrBkF,KAAMA,CAACL,EAAKC,IAAQD,EAAMC,EAC1BK,KAAMA,CAACN,EAAKC,IAAQD,EAAMC,EAC1BM,KAAMA,CAACP,EAAKC,IAAQD,EAAMC,EAE1BzB,IAAMrD,GAAQK,EAAOL,EAAK+D,GAC1BsB,KAAMnB,EAAMmB,MAAUlE,CAAAA,GAAMkD,EAAM7B,EAAGrB,IACrCmE,YAAcC,GAAQ5C,EAAcH,EAAG+C,GAGvCC,KAAMA,CAAC5F,EAAGC,EAAG4F,IAAOA,EAAI5F,EAAID,EAC5B8F,QAAU1F,GAASiE,EAAO0B,kBAAgB3F,EAAKoE,GAASwB,EAAAA,gBAAgB5F,EAAKoE,GAC7EyB,UAAYC,IACV,GAAIA,EAAM/C,SAAWqB,EACnB,MAAM,IAAIjE,MAAM,0BAA0BiE,UAAc0B,EAAM/C,UAChE,OAAOkB,EAAO8B,EAAAA,gBAAgBD,GAASE,EAAeA,gBAACF,EAAM,IAGjE,OAAOxB,OAAOC,OAAO/B,EACvB,8EAQM,SAAwBtB,EAAe+E,GAC3C,IAAK/E,EAAG0D,MAAO,MAAM,IAAIzE,MAAM,4BAC/B,MAAMiB,EAAOF,EAAGmE,KAAKY,GACrB,OAAO/E,EAAG0D,MAAMxD,GAAQF,EAAGM,IAAIJ,GAAQA,CACzC,wCAlN4B8E,CAAClG,EAAaE,KAAoBP,EAAIK,EAAKE,GAAUb,KAASA,6DAhKpF,SAAekB,EAAWN,EAAeC,GAC7C,IAAIE,EAAMG,EACV,KAAON,KAAUd,GACfiB,GAAOA,EACPA,GAAOF,EAET,OAAOE,CACT,gDA2MM,SAA2B+F,GAC/B,MAMMC,EAAO9D,EAAaW,QAAO,CAACoD,EAAKC,KACrCD,EAAIC,GAAO,WACJD,IARO,CACdtC,MAAO,SACPS,KAAM,SACNJ,MAAO,gBACPD,KAAM,kBAMR,OAAOoC,EAAcA,eAACJ,EAAOC,EAC/B","x_google_ignoreList":[0]}