Bitcoin address: bc1qt4wrqgr3hvpgld7vhaymct7eaf0n2ql4wah66u

SHOWING: First 60

transfer100.pizza#71,355,717brc-20Inscription #65511768#65,511,768svgInscription #11712847#11,712,847svg// Copyright (c) 2009 Satoshi Nakamoto // Distributed under the MIT/X11 software license, see the accompanying // file license.txt or http://www.opensource.org/licenses/mit-license.php. // // Why base-58 instead of standard base-64 encoding? // - Don't want 0OIl characters that look the same in some fonts and // could be used to create visually identical looking account numbers. // - A string with non-alphanumeric characters is not as easily accepted as an account number. // - E-mail usually won't line-break if there's no punctuation to break at. // - Doubleclicking selects the whole number as one word if it's all alphanumeric. // static const char* pszBase58 = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"; inline string EncodeBase58(const unsigned char* pbegin, const unsigned char* pend) { CAutoBN_CTX pctx; CBigNum bn58 = 58; CBigNum bn0 = 0; // Convert big endian data to little endian // Extra zero at the end make sure bignum will interpret as a positive number vector<unsigned char> vchTmp(pend-pbegin+1, 0); reverse_copy(pbegin, pend, vchTmp.begin()); // Convert little endian data to bignum CBigNum bn; bn.setvch(vchTmp); // Convert bignum to string string str; str.reserve((pend - pbegin) * 138 / 100 + 1); CBigNum dv; CBigNum rem; while (bn > bn0) { if (!BN_div(&dv, &rem, &bn, &bn58, pctx)) throw bignum_error("EncodeBase58 : BN_div failed"); bn = dv; unsigned int c = rem.getulong(); str += pszBase58[c]; } // Leading zeroes encoded as base58 zeros for (const unsigned char* p = pbegin; p < pend && *p == 0; p++) str += pszBase58[0]; // Convert little endian string to big endian reverse(str.begin(), str.end()); return str; } inline string EncodeBase58(const vector<unsigned char>& vch) { return EncodeBase58(&vch[0], &vch[0] + vch.size()); } inline bool DecodeBase58(const char* psz, vector<unsigned char>& vchRet) { CAutoBN_CTX pctx; vchRet.clear(); CBigNum bn58 = 58; CBigNum bn = 0; CBigNum bnChar; while (isspace(*psz)) psz++; // Convert big endian string to bignum for (const char* p = psz; *p; p++) { const char* p1 = strchr(pszBase58, *p); if (p1 == NULL) { while (isspace(*p)) p++; if (*p != '\0') return false; break; } bnChar.setulong(p1 - pszBase58); if (!BN_mul(&bn, &bn, &bn58, pctx)) throw bignum_error("DecodeBase58 : BN_mul failed"); bn += bnChar; } // Get bignum as little endian data vector<unsigned char> vchTmp = bn.getvch(); // Trim off sign byte if present if (vchTmp.size() >= 2 && vchTmp.end()[-1] == 0 && vchTmp.end()[-2] >= 0x80) vchTmp.erase(vchTmp.end()-1); // Restore leading zeros int nLeadingZeros = 0; for (const char* p = psz; *p == pszBase58[0]; p++) nLeadingZeros++; vchRet.assign(nLeadingZeros + vchTmp.size(), 0); // Convert little endian data to big endian reverse_copy(vchTmp.begin(), vchTmp.end(), vchRet.end() - vchTmp.size()); return true; } inline bool DecodeBase58(const string& str, vector<unsigned char>& vchRet) { return DecodeBase58(str.c_str(), vchRet); } inline string EncodeBase58Check(const vector<unsigned char>& vchIn) { // add 4-byte hash check to the end vector<unsigned char> vch(vchIn); uint256 hash = Hash(vch.begin(), vch.end()); vch.insert(vch.end(), (unsigned char*)&hash, (unsigned char*)&hash + 4); return EncodeBase58(vch); } inline bool DecodeBase58Check(const char* psz, vector<unsigned char>& vchRet) { if (!DecodeBase58(psz, vchRet)) return false; if (vchRet.size() < 4) { vchRet.clear(); return false; } uint256 hash = Hash(vchRet.begin(), vchRet.end()-4); if (memcmp(&hash, &vchRet.end()[-4], 4) != 0) { vchRet.clear(); return false; } vchRet.resize(vchRet.size()-4); return true; } inline bool DecodeBase58Check(const string& str, vector<unsigned char>& vchRet) { return DecodeBase58Check(str.c_str(), vchRet); } static const unsigned char ADDRESSVERSION = 0; inline string Hash160ToAddress(uint160 hash160) { // add 1-byte version number to the front vector<unsigned char> vch(1, ADDRESSVERSION); vch.insert(vch.end(), UBEGIN(hash160), UEND(hash160)); return EncodeBase58Check(vch); } inline bool AddressToHash160(const char* psz, uint160& hash160Ret) { vector<unsigned char> vch; if (!DecodeBase58Check(psz, vch)) return false; if (vch.empty()) return false; unsigned char nVersion = vch[0]; if (vch.size() != sizeof(hash160Ret) + 1) return false; memcpy(&hash160Ret, &vch[1], sizeof(hash160Ret)); return (nVersion <= ADDRESSVERSION); } inline bool AddressToHash160(const string& str, uint160& hash160Ret) { return AddressToHash160(str.c_str(), hash160Ret); } inline bool IsValidBitcoinAddress(const char* psz) { uint160 hash160; return AddressToHash160(psz, hash160); } inline bool IsValidBitcoinAddress(const string& str) { return IsValidBitcoinAddress(str.c_str()); } inline string PubKeyToAddress(const vector<unsigned char>& vchPubKey) { return Hash160ToAddress(Hash160(vchPubKey)); }#11,702,101text#include <string.h> #include <linux/sched.h> #include <linux/kernel.h> #include <linux/mm.h> #include <asm/system.h> struct m_inode inode_table[NR_INODE]={{0,},}; static void read_inode(struct m_inode * inode); static void write_inode(struct m_inode * inode); static inline void wait_on_inode(struct m_inode * inode) { cli(); while (inode->i_lock) sleep_on(&inode->i_wait); sti(); } static inline void lock_inode(struct m_inode * inode) { cli(); while (inode->i_lock) sleep_on(&inode->i_wait); inode->i_lock=1; sti(); } static inline void unlock_inode(struct m_inode * inode) { inode->i_lock=0; wake_up(&inode->i_wait); } void sync_inodes(void) { int i; struct m_inode * inode; inode = 0+inode_table; for(i=0 ; i<NR_INODE ; i++,inode++) { wait_on_inode(inode); if (inode->i_dirt && !inode->i_pipe) write_inode(inode); } } static int _bmap(struct m_inode * inode,int block,int create) { struct buffer_head * bh; int i; if (block<0) panic("_bmap: block<0"); if (block >= 7+512+512*512) panic("_bmap: block>big"); if (block<7) { if (create && !inode->i_zone[block]) if (inode->i_zone[block]=new_block(inode->i_dev)) { inode->i_ctime=CURRENT_TIME; inode->i_dirt=1; } return inode->i_zone[block]; } block -= 7; if (block<512) { if (create && !inode->i_zone[7]) if (inode->i_zone[7]=new_block(inode->i_dev)) { inode->i_dirt=1; inode->i_ctime=CURRENT_TIME; } if (!inode->i_zone[7]) return 0; if (!(bh = bread(inode->i_dev,inode->i_zone[7]))) return 0; i = ((unsigned short *) (bh->b_data))[block]; if (create && !i) if (i=new_block(inode->i_dev)) { ((unsigned short *) (bh->b_data))[block]=i; bh->b_dirt=1; } brelse(bh); return i; } block -= 512; if (create && !inode->i_zone[8]) if (inode->i_zone[8]=new_block(inode->i_dev)) { inode->i_dirt=1; inode->i_ctime=CURRENT_TIME; } if (!inode->i_zone[8]) return 0; if (!(bh=bread(inode->i_dev,inode->i_zone[8]))) return 0; i = ((unsigned short *)bh->b_data)[block>>9]; if (create && !i) if (i=new_block(inode->i_dev)) { ((unsigned short *) (bh->b_data))[block>>9]=i; bh->b_dirt=1; } brelse(bh); if (!i) return 0; if (!(bh=bread(inode->i_dev,i))) return 0; i = ((unsigned short *)bh->b_data)[block&511]; if (create && !i) if (i=new_block(inode->i_dev)) { ((unsigned short *) (bh->b_data))[block&511]=i; bh->b_dirt=1; } brelse(bh); return i; } int bmap(struct m_inode * inode,int block) { return _bmap(inode,block,0); } int create_block(struct m_inode * inode, int block) { return _bmap(inode,block,1); } void iput(struct m_inode * inode) { if (!inode) return; wait_on_inode(inode); if (!inode->i_count) panic("iput: trying to free free inode"); if (inode->i_pipe) { wake_up(&inode->i_wait); if (--inode->i_count) return; free_page(inode->i_size); inode->i_count=0; inode->i_dirt=0; inode->i_pipe=0; return; } if (!inode->i_dev || inode->i_count>1) { inode->i_count--; return; } repeat: if (!inode->i_nlinks) { truncate(inode); free_inode(inode); return; } if (inode->i_dirt) { write_inode(inode); /* we can sleep - so do again */ wait_on_inode(inode); goto repeat; } inode->i_count--; return; } static volatile int last_allocated_inode = 0; struct m_inode * get_empty_inode(void) { struct m_inode * inode; int inr; while (1) { inode = NULL; inr = last_allocated_inode; do { if (!inode_table[inr].i_count) { inode = inr + inode_table; break; } inr++; if (inr>=NR_INODE) inr=0; } while (inr != last_allocated_inode); if (!inode) { for (inr=0 ; inr<NR_INODE ; inr++) printk("%04x: %6d\t",inode_table[inr].i_dev, inode_table[inr].i_num); panic("No free inodes in mem"); } last_allocated_inode = inr; wait_on_inode(inode); while (inode->i_dirt) { write_inode(inode); wait_on_inode(inode); } if (!inode->i_count) break; } memset(inode,0,sizeof(*inode)); inode->i_count = 1; return inode; } struct m_inode * get_pipe_inode(void) { struct m_inode * inode; if (!(inode = get_empty_inode())) return NULL; if (!(inode->i_size=get_free_page())) { inode->i_count = 0; return NULL; } inode->i_count = 2; /* sum of readers/writers */ PIPE_HEAD(*inode) = PIPE_TAIL(*inode) = 0; inode->i_pipe = 1; return inode; } struct m_inode * iget(int dev,int nr) { struct m_inode * inode, * empty; if (!dev) panic("iget with dev==0"); empty = get_empty_inode(); inode = inode_table; while (inode < NR_INODE+inode_table) { if (inode->i_dev != dev || inode->i_num != nr) { inode++; continue; } wait_on_inode(inode); if (inode->i_dev != dev || inode->i_num != nr) { inode = inode_table; continue; } inode->i_count++; if (empty) iput(empty); return inode; } if (!empty) return (NULL); inode=empty; inode->i_dev = dev; inode->i_num = nr; read_inode(inode); return inode; } static void read_inode(struct m_inode * inode) { struct super_block * sb; struct buffer_head * bh; int block; lock_inode(inode); sb=get_super(inode->i_dev); block = 2 + sb->s_imap_blocks + sb->s_zmap_blocks + (inode->i_num-1)/INODES_PER_BLOCK; if (!(bh=bread(inode->i_dev,block))) panic("unable to read i-node block"); *(struct d_inode *)inode = ((struct d_inode *)bh->b_data) [(inode->i_num-1)%INODES_PER_BLOCK]; brelse(bh); unlock_inode(inode); } static void write_inode(struct m_inode * inode) { struct super_block * sb; struct buffer_head * bh; int block; lock_inode(inode); sb=get_super(inode->i_dev); block = 2 + sb->s_imap_blocks + sb->s_zmap_blocks + (inode->i_num-1)/INODES_PER_BLOCK; if (!(bh=bread(inode->i_dev,block))) panic("unable to read i-node block"); ((struct d_inode *)bh->b_data) [(inode->i_num-1)%INODES_PER_BLOCK] = *(struct d_inode *)inode; bh->b_dirt=1; inode->i_dirt=0; brelse(bh); unlock_inode(inode); }#11,700,926textInscription #11666726#11,666,726svgInscription #11438286#11,438,286webpInscription #10080951#10,080,951pngInscription #10080610#10,080,610pngregsatoshispirit.sats#9,102,575snsmint1,000.mesh#8,361,988brc-20mint1,000.mesh#8,361,986brc-20mint1,000.mesh#8,361,984brc-20mint1,000.mesh#8,361,983brc-20mint1,000.mesh#8,361,980brc-20mint1,000.mesh#8,361,966brc-20mint1,000.mesh#8,361,962brc-20mint1,000.mesh#8,361,959brc-20mint1,000.mesh#8,361,957brc-20mint1,000.mesh#8,361,956brc-20mint1,000.mesh#8,361,950brc-20mint1,000.mesh#8,361,949brc-20mint1,000.mesh#8,361,946brc-20mint1,000.mesh#8,361,930brc-20mint1,000.mesh#8,361,915brc-20mint1,000.mesh#8,361,913brc-20mint1,000.mesh#8,361,903brc-20mint1,000.mesh#8,361,894brc-20mint1,000.mesh#8,361,889brc-20mint1,000.mesh#8,361,875brc-20mint1,000.mesh#8,361,874brc-20mint1,000.mesh#8,361,865brc-20mint1,000.mesh#8,361,863brc-20mint1,000.mesh#8,361,862brc-20mint1,000.bffy#6,323,218brc-20mint1,000.bffy#6,323,217brc-20mint1,000.bffy#6,323,216brc-20mint1,000.bffy#6,323,215brc-20mint1,000.bffy#6,323,214brc-20mint1,000.bffy#6,323,213brc-20mint1,000.bffy#6,323,212brc-20mint1,000.bffy#6,323,211brc-20mint1,000.bffy#6,323,210brc-20mint1,000.bffy#6,323,209brc-20mint1,000.bffy#6,323,208brc-20mint1,000.bffy#6,323,207brc-20mint1,000.bffy#6,323,206brc-20mint1,000.bffy#6,323,205brc-20mint1,000.bffy#6,323,204brc-20mint1,000.bffy#6,323,203brc-20mint1,000.bffy#6,323,202brc-20mint1,000.bffy#6,323,201brc-20mint1,000.bffy#6,323,200brc-20mint1,000.bffy#6,323,199brc-20mint1,000.bffy#6,323,198brc-20mint1,000.bffy#6,323,197brc-20mint1,000.bffy#6,323,196brc-20mint1,000.bffy#6,323,195brc-20mint1,000.palm#5,414,648brc-20mint1,000.palm#5,414,646brc-20