Skip to content

Instantly share code, notes, and snippets.

View lengyijun's full-sized avatar
🦄

lyj lengyijun

🦄
View GitHub Profile
0x5cC636798b2B15532f6831fC1c4aC40171cA7D38
使用 https://github.com/coinspark/python-OP_RETURN ,git clone
修改 OP_RETURN.py 中OP_RETURN_BITCOIN_PORT,OP_RETURN_BITCOIN_USER,OP_RETURN_BITCOIN_PASSWORD
python send-OP_RETURN.py mmvB5EbevZWoyie1S1PkX7RyTQjmgZsrHY 0.001 "shanggangshiguanjun" 1
0.01是交易费,如果太低没人睬你
1表示testnet,如果在main chain上,去掉这个1
mmvB5EbevZWoyie1S1PkX7RyTQjmgZsrHY 是我自己的地址
在 http://coinsecrets.org/ 查看自己的区块信息
挚爱的sjtu-web在9月30日永远离开了我们,现在大家一起拥抱sjtu吧
ubuntu wifi,点击connect option
点sjtu,edit
wifi-security 栏中,security改成WPA WPA2 enterprise
click no ca certificate is required
save
@lengyijun
lengyijun / gist:fe1766d22993a6bb37228d9e1c69c462
Created October 23, 2017 09:05
PairingForBeginers P52 Weil reciprocity magma脚本
clear;
Fq:=GF(503);
a:=0; b:=1;
E:=EllipticCurve([Fq|a,b]);
P:=E![433,98];
Q:=E![127,258];
R:=E![339,199];
S:=E![124,42];
clear;
q:=11;
Fq:=GF(q);
Fq2<i>:=ExtensionField<Fq,x|x^2+1>;
a:=0;
b:=4;
E:=EllipticCurve([Fq|a,b]);
fac:=Factorization(#E);
fac2:=Factorization(#E(Fq2));
points:=Points(E(Fq2));
@lengyijun
lengyijun / gist.md
Last active January 16, 2019 05:35
  • 公开,让大家看到你的学习进程和学习的结果
  • 希望遇到相同问题的人能搜到这篇文章
  • 方便。如果写在github的repo里面,你添加文章非常费力
  • 支持markdown,可以评论,只要有网就能找到
  • 方便的做版本控制,用gist命令
  • 免费,免翻墙

好处太多了,想到在评论中补充

clear;
Fq:=GF(59);
a:=1; b:=0;
E:=EllipticCurve([Fq|a,b]);
P:=E![25,29];
pi:=FrobeniusMap(E);
pi(P)
@lengyijun
lengyijun / quicksort.asm
Created October 24, 2017 12:20
计算机组成第一个大作业 快速排序 使用栈实现
data segment
arr dw 1D41H, 0AFC8H, 2546H, 5D8CH, 980FH, 7F57H, 0B31H, 741CH, 3D8DH, 9A6CH, 163EH, 820AH, 2DDCH, 6A65H, 66D6H, 2904H, 2971H, 7DB4H, 52B3H, 46BAH, 1D99H, 76A1H, 49B1H, 9981H, 883DH, 0109H, 12C9H, 6B95H, 6337H, 6432H, 03A0H, 94D5H, 8148H, 33FEH, 23D9H, 9E1CH, 4B79H, 0616H, 6C85H, 8AEDH, 5B1DH, 2C23H, 213BH, 568FH, 1767H, 1868H, 648AH, 346BH, 5D56H, 9276H
ends
stack segment
dw 128 dup(0)
ends
code segment
assume cs:code,ds:data,ss:stack
@lengyijun
lengyijun / a.l
Created October 24, 2017 15:25
flex get start!!
%{
#include<stdio.h>
#include<ctype.h>
#ifndef FALSE
#define FALSE
#endif
#ifndef TRUE
#define TRUE
#endif
%}
clear;
q:=19;
Fq:=GF(q);
Fq2<i>:=ExtensionField<Fq,x|x^2+1>;
#Fq2;
for j in Set(Fq2) do
j;