阅读视图

friend_tech 第一笔交易只能买 1 个key?

2023年9月19日 15:36

<h2 id="背景"><a href="#背景" class="headerlink" title="背景"></a>背景</h2>群里有人说friend tech 第一笔交易只能自己购买1笔？我当时就反驳了他,毕竟我也算看过 friend tech 合约代码的人,合约没有限制只能买 1 笔啊<h2 id="废话少说，直接看代码"><a href="#废话少说，直接看代码" class="headerlink" title="废话少说，直接看代码"></a>废话少说，直接看代码</h2><figure class="highlight js"><table><tr><td class="gutter"><pre>1 2 3 4 5 6 7 8 9 10 11 12 13 14 </pre></td><td class="code"><pre>function buyShares(address sharesSubject, uint256 amount) public payable { uint256 supply = sharesSupply[sharesSubject]; require(supply > 0 || sharesSubject == msg.sender, "Only the shares' subject can buy the first share"); uint256 price = getPrice(supply, amount); uint256 protocolFee = price * protocolFeePercent / 1 ether; uint256 subjectFee = price * subjectFeePercent / 1 ether; require(msg.value >= price + protocolFee + subjectFee, "Insufficient payment"); sharesBalance[sharesSubject][msg.sender] = sharesBalance[sharesSubject][msg.sender] + amount; sharesSupply[sharesSubject] = supply + amount; emit Trade(msg.sender, sharesSubject, true, amount, price, protocolFee, subjectFee, supply + amount); (bool success1,) = protocolFeeDestination.call{value: protocolFee}(""); (bool success2,) = sharesSubject.call{value: subjectFee}(""); require(success1 && success2, "Unable to send funds"); } </pre></td></tr></table></figure>一看代码很简单，唯一限制的就这一句<code>require(supply > 0 || sharesSubject == msg.sender, "Only the shares' subject can buy the first share");</code>这句话的意思新注册用户，只能自己买入第一笔. 也没有限制买多少key啊…<h2 id="没那么简单"><a href="#没那么简单" class="headerlink" title="没那么简单"></a>没那么简单</h2>那别人为啥还言之凿凿说确实只能买 1 个key 呢？严谨一点直接用forge模拟买买看就知道了.<figure class="highlight js"><table><tr><td class="gutter"><pre>1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 </pre></td><td class="code"><pre>import {TestHarness} from "../../TestHarness.sol"; interface iFriendtech { function buyShares(address sharesSubject, uint256 amount) external payable; } contract fuck_friend_tech is TestHarness { iFriendtech friendtech = iFriendtech(0xCF205808Ed36593aa40a44F10c7f7C2F67d4A4d4); function setUp() external { cheat.createSelectFork("base", 4_119_770); cheat.deal(address(this), 100 ether); } function test_attack() external { friendtech.buyShares{value: 100 ether}(address(this), 2); } receive() external payable {} } </pre></td></tr></table></figure>你别说,还真失败了…报错为 <code>[FAIL. Reason: Arithmetic over/underflow] test_attack() (gas: 3252)</code>显示溢出报错.肯定是哪里做运算出错了再回头看<code>buyShares</code>的代码，唯一有疑点的地方就是<code>getPrice</code><figure class="highlight js"><table><tr><td class="gutter"><pre>1 2 3 4 5 6 7 8 9 </pre></td><td class="code"><pre>function getPrice(uint256 supply, uint256 amount) public view returns (uint256) { uint256 sum1 = supply == 0 ? 0 : (supply - 1) * (supply) * (2 * (supply - 1) + 1) / 6; uint256 sum2 = supply == 0 && amount == 1 ? 0 : (supply - 1 + amount) * (supply + amount) * (2 * (supply - 1 + amount) + 1) / 6; uint256 summation = sum2 - sum1; return summation * 1 ether / 16_000; } </pre></td></tr></table></figure>出现问题在sum2… supply-1+amount这边就出错了…毕竟 solidity 语言有点傻,0-1=-1就直接溢出了…好吧,原来不能第一次买多个的原因是团队写 bug 了…改正也很简单,先+后-就可以了,这也算 solidity 开发常见的问题了,要先加后减，先乘后除<code>(supply - 1 + amount) * (supply + amount) * (2 * (supply - 1 + amount) + 1) / 6;</code> <code>(supply + amount - 1) * (supply + amount) * (2 * (supply + amount - 1) + 1) / 6;</code><h2 id="getPrice-分析"><a href="#getPrice-分析" class="headerlink" title="getPrice 分析"></a>getPrice 分析</h2>再回头看getPrice的代码. 估计第一眼看过去的都会比较迷糊，这到底是干啥了…当然数学大神一下就能看出来这是平方和公式我们可以借助 ChatGPT<figure class="highlight plaintext"><table><tr><td class="gutter"><pre>1 2 3 4 5 6 7 8 9 10 11 12 13 </pre></td><td class="code"><pre>Q: (supply - 1) * (supply) * (2 * (supply - 1) + 1) / 6 这是什么公式？ A: 这个公式是用来计算一个整数变量（通常表示为"supply"）的平方和平方和的一种表示方式。公式的具体步骤如下： 1. 先将"supply"的值减去1，即"(supply - 1)"。 2. 然后将该值与"supply"相乘，即"(supply - 1) * supply"。 3. 接下来，将2乘以"(supply - 1)"，即"2 * (supply - 1)"。 4. 将上一步骤的结果加1，即"2 * (supply - 1) + 1"。 5. 最后，将前三步骤的结果相乘，并将其除以6，即"(supply - 1) * supply * (2 * (supply - 1) + 1) / 6"。 这个公式可以用来计算一系列连续整数的平方和，其中"supply"代表整数的上限。这种形式的平方和通常在数学和统计学中有多种应用，比如计算方差、概率分布等。 </pre></td></tr></table></figure>知道这是平方求和公式就简单了,这段代码就很好理解了 <code>((supply-1+amount)的平方和 - (supply-1)的平方和) / 16000</code> 本文作者：高金 本文地址： <a href="https://igaojin.me/2023/09/19/friend-tech-%E7%AC%AC%E4%B8%80%E7%AC%94%E4%BA%A4%E6%98%93%E5%8F%AA%E8%83%BD%E4%B9%B0-1-%E4%B8%AAkey/">https://igaojin.me/2023/09/19/friend-tech-第一笔交易只能买-1-个key/</a> 版权声明：转载请注明出处！<div id="gitalk-container"></div><script src="https://cdn.bootcss.com/blueimp-md5/2.12.0/js/md5.min.js"></script><link rel="stylesheet" href="https://unpkg.com/gitalk/dist/gitalk.css"><script src="https://unpkg.com/gitalk/dist/gitalk.min.js"></script><script>var gitalkConfig = {"clientID":"935e92a5333436856348","clientSecret":"e655566eaf920d216ec6283978d67874bf0850a6","repo":"jin10086.github.io","owner":"jin10086","admin":["jin10086"],"distractionFreeMode":false,"id":"page.date","createIssueManually":false}; gitalkConfig.id = md5(location.pathname);var gitalk = new Gitalk(gitalkConfig); gitalk.render("gitalk-container"); </script>

friend_tech 套利到底有多卷

高金的博客

Gao JIn

2023年9月18日 23:24

<h2 id="背景"><a href="#背景" class="headerlink" title="背景"></a>背景</h2>最近有准备搞一下friend tech的套利…就写个 sql看看目前有多少人盈利.这个数据不会基于没有卖出去的key<a href="https://dune.com/queries/3032730/5041320">数据在这friend tech top profit</a>按照盈利金额排序<img src="/2023/09/18/friend-tech-%E5%A5%97%E5%88%A9%E5%88%B0%E5%BA%95%E6%9C%89%E5%A4%9A%E5%8D%B7/friend_tech_top_profit1.png" class="" title="friend tech top profit">按照亏损金额排序<img src="/2023/09/18/friend-tech-%E5%A5%97%E5%88%A9%E5%88%B0%E5%BA%95%E6%9C%89%E5%A4%9A%E5%8D%B7/friend_tech_top_profit2.png" class="" title="friend tech top profit">头几个盈利的肯定是机器人账号.就看看他们的数据,这一看就发现了一些问题.<h2 id="数据分析"><a href="#数据分析" class="headerlink" title="数据分析"></a>数据分析</h2>所有的数据基于block <a href="https://basescan.org/txs?block=4119771&p=10">411977</a>,真实用户<a href="https://basescan.org/address/0xda68eee4c5b10d8a574b9ec072335c583b1c67a2">0xda</a>, <a href="https://basescan.org/tx/0x0c499027221fe9195f2b0b0f9038b97e0317b19cae9e55774ceb85767bd07d56">购买 tx</a><h3 id="数据长这样"><a href="#数据长这样" class="headerlink" title="数据长这样"></a>数据长这样</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre>1 2 3 4 5 6 7 8 9 10 11 12 </pre></td><td class="code"><pre> fromnoncetotransactionIndexgasPricegasFeestatusnew_status 00xa3afA500e3d88CAfA41AA7B95a8dEF7d2CBce92b941660xfF231524719dB94a0Ef08A88fC4e6939134EadE811254698872434951723127900 10x135557B95fc164cB152e853568b25880Ba06F94A94870x4Ff30D7222B852c67A66Dc8E8d56A8cf92B8411c21254698872394616413986700 20x8ac85761268B9Ac3fDe06d381611b64B232CEa97662930x4Ff30D7222B852c67A66Dc8E8d56A8cf92B8411c31254698872397503555135900 30x1BA4C73e7831b8099377c0583acfF4DBE488dFc6166260x4C99B25DdD0887D88b6C1364E3Df63a3bE76A5c341254698872428797029923900 40xa92a6331d0174c0eDC463B097E8564a492D451FA936090xfF231524719dB94a0Ef08A88fC4e6939134EadE851254698872434951723127900 50x9a34845CCBeA93925B15F5af6d9F4aFae4EC590a937550xfF231524719dB94a0Ef08A88fC4e6939134EadE861254698872434951723127900 60x5ED1222A1c0BdBA479B61201231f539ac131DD69641310x4C99B25DdD0887D88b6C1364E3Df63a3bE76A5c371254698872428797029923900 70xe8C5433d6E8Fc7a2b38eF0391FabA7470c9576e451420x4C99B25DdD0887D88b6C1364E3Df63a3bE76A5c381254698872428797029923900 80x38Cd1a8474A948a5a3e4d4b06c4069F2116DD184855740x4Ff30D7222B852c67A66Dc8E8d56A8cf92B8411c91254698872406164978583500 90x3c2c170296446e241dE2eE39d7036254d55Df9E4936020xfF231524719dB94a0Ef08A88fC4e6939134EadE8101254698872426290299680300 </pre></td></tr></table></figure><h3 id="交易数量"><a href="#交易数量" class="headerlink" title="交易数量"></a>交易数量</h3><figure class="highlight python"><table><tr><td class="gutter"><pre>1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 </pre></td><td class="code"><pre>import json import pandas as pd from hexbytes import HexBytes with open('4119771_da681.json') as f: txs = json.loads(f.read()) def filter_da68(txs): flashruntxs = [] for tx in txs: _input = tx["input"] if "da68ee" in _input: flashruntxs.append( { "from": tx["from"], "nonce": tx["nonce"], "to": tx["to"], "transactionIndex": tx["transactionIndex"], "gasPrice": tx["gasPrice"], "gasFee": tx["gasFee"], "status": tx["status"], } ) return flashruntxs da68 = filter_da68(txs) len(da68),len(txs) (506, 517) </pre></td></tr></table></figure>可以看到整个区块交易517 条,其中和da68相关的 506. 就非常离谱，97.87%的用户都是来抢跑的.<h3 id="一共有多少机器人？"><a href="#一共有多少机器人？" class="headerlink" title="一共有多少机器人？"></a>一共有多少机器人？</h3>我们这边按照合约地址分一下类. 可以看到有几个头部机器人. 前3 占了大部分交易.<figure class="highlight python"><table><tr><td class="gutter"><pre>1 2 3 4 5 6 7 8 9 10 11 </pre></td><td class="code"><pre>to_count = df['to'].value_counts() to_count 0x4C99B25DdD0887D88b6C1364E3Df63a3bE76A5c3 184 0xfF231524719dB94a0Ef08A88fC4e6939134EadE8 161 0x4Ff30D7222B852c67A66Dc8E8d56A8cf92B8411c 123 0xCF205808Ed36593aa40a44F10c7f7C2F67d4A4d4 19 0xe27ddadbC8779D01fC539Bf5BA8529D728418625 9 0x27E8A5B043d3f58dde1c7ab96d2E3cF07558A1f1 8 0xAfE6795A9097BbCE00fe61462d22CCeeF706a3e8 2 Name: to, dtype: int64 </pre></td></tr></table></figure>看看这几个机器人花了多少gas费,没想到发送 184 条交易才花 7.69刀.<figure class="highlight python"><table><tr><td class="gutter"><pre>1 2 3 4 5 6 7 8 9 10 11 12 13 </pre></td><td class="code"><pre>ethprice = 1640 for to in to_count.index: tteth = sum(df[df.to==to].gasFee)/1e18 ttusd = tteth*ethprice print(tteth,ttusd) 0.004690181471662096 7.691897613525838 0.004104812550636566 6.731892583043968 0.003097893590529322 5.080545488468088 0.000457215606189089 0.749833594150106 0.000226412037571068 0.3713157416165515 0.00017632952477182 0.2891804206257848 5.0244385725274e-05 0.08240079258944936 </pre></td></tr></table></figure>再看看这些机器人有多少小号 有发现几个菜鸟机器人…<figure class="highlight python"><table><tr><td class="gutter"><pre>1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 </pre></td><td class="code"><pre>for to in to_count.index: print('to:',to) print(df[df.to==to]['from'].value_counts()) print() print('#'*30) to: 0x4C99B25DdD0887D88b6C1364E3Df63a3bE76A5c3 0x5ED1222A1c0BdBA479B61201231f539ac131DD69 27 0x1BA4C73e7831b8099377c0583acfF4DBE488dFc6 26 0xd9E4b9579a5CF5B336E258820CC95cA34411c9D6 26 0x27C2a598Db389b5276c0156f14B4dE75E490712F 26 0xe8C5433d6E8Fc7a2b38eF0391FabA7470c9576e4 24 0xDd2B7694259a83753918BF5b6dC6961fabd2FDbC 24 0xC81a00ee6839EE0dFbF465d3C08E5F0b0291b71A 20 0x3Ee2183b706cf381e7e4586b8063a779f1E7b7dA 11 Name: from, dtype: int64 ############################## to: 0xfF231524719dB94a0Ef08A88fC4e6939134EadE8 0xa3afA500e3d88CAfA41AA7B95a8dEF7d2CBce92b 9 0xa92a6331d0174c0eDC463B097E8564a492D451FA 9 0x2bE3973950D0F1951E12C21bC7bB8e2428101Fdd 9 0x63cEe818600f91C4473CD14cDfD9C10d918B587b 9 0x92c21dB4a7cC0302ccCb71d444aE674Ec3980c93 9 0xCb44B9062eB0Cd22c4C0701385e6482BF4a77759 9 0x57ae46a097751124f8c35A86f64B4c38d2C62675 9 0x8eE3847cAE34e6e0292dc3DF8DD3C0C69a266b97 9 0x807db242cD37b5E2B53697842197611f51693C06 9 0xDb6f56639AaeA09FfEA6080D31A32851524128d4 9 0x9D94BdAf42d7906b3D3c011053ed2cBF42A1cA3f 9 0x244Fb415A8765812B9bc5B52cA14fd83C9d7E0e5 9 0xF689ac0322786Ac2D7245Fcd665fe120ff1d0408 9 0x895D2d10FB9b92D0e1002c1a1bCdb90Ed42c3588 9 0xF53010525Df586e78b14114C9cd05481E79E6C8C 9 0x3c2c170296446e241dE2eE39d7036254d55Df9E4 9 0x9a34845CCBeA93925B15F5af6d9F4aFae4EC590a 9 0x36da68690F238366156890010c411394FC529cd9 8 Name: from, dtype: int64 ############################## to: 0x4Ff30D7222B852c67A66Dc8E8d56A8cf92B8411c 0x8ac85761268B9Ac3fDe06d381611b64B232CEa97 13 0x135557B95fc164cB152e853568b25880Ba06F94A 12 0x38Cd1a8474A948a5a3e4d4b06c4069F2116DD184 12 0x3547DbcD816bc17D7dE0e7e67a8B8bEE74384ACF 12 0xa9ff99346829E7c578E6d38C2269997a2FCcEEE1 12 0xd65eD99CB8b3b65CE378e3E5CaE545B751f4DAc6 11 0x1F238B47ab9fD915e5852601E83c6c1358297870 11 0x75Ff68BDe78974ab54a642fD294369447bD9Feef 10 0xf1E7E7Ad07C046abb6e488F73c126B897892755c 10 0x76eF08c772Db73E05fa00398746FbA31eFC5804F 10 0x7CfE232Ed8b0acc111ec780b7Cb95C68f3CF7Aa6 10 Name: from, dtype: int64 ############################## to: 0xCF205808Ed36593aa40a44F10c7f7C2F67d4A4d4 0x188eCF8f4290C4e5d641449B88CEf94574174972 15 0xDa68EEe4c5b10D8A574b9ec072335c583B1C67A2 1 0xbEbA981C5697b1CFa7c04fCB523E94bD42F79afB 1 0x40954b9B4bAfC41Ec6387325fD0069C68674a04d 1 0x296D3324Ee4b2316E87f965F4A04F073780f5310 1 Name: from, dtype: int64 ############################## to: 0xe27ddadbC8779D01fC539Bf5BA8529D728418625 0xeFa4b454A64049ff93cC37b54102982ACEdf4Eae 9 Name: from, dtype: int64 ############################## to: 0x27E8A5B043d3f58dde1c7ab96d2E3cF07558A1f1 0x8b113ad5c2b2E3ddb102305e32259c6b23D12aa3 4 0x89B5BB48f016b809EB2eE78416550487334C1331 4 Name: from, dtype: int64 ############################## to: 0xAfE6795A9097BbCE00fe61462d22CCeeF706a3e8 0xC1322133ACbAd823614bf79Ca9eC409fA3A7E39A 2 Name: from, dtype: int64 ############################## </pre></td></tr></table></figure><h3 id="最后总览看看"><a href="#最后总览看看" class="headerlink" title="最后总览看看"></a>最后总览看看</h3>26是用户的交易.可以看到所有的 gasPrice都和用户的一样…<figure class="highlight python"><table><tr><td class="gutter"><pre>1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 </pre></td><td class="code"><pre># 筛选出 transactionIndex 在 16-40 范围内的数据 filtered_df = df[(df['transactionIndex'] >= 16) & (df['transactionIndex'] <= 36)] # 按照 transactionIndex 从小到大排序 sorted_df = filtered_df.sort_values(by='transactionIndex') def highlight_row(row): if row['transactionIndex'] == 26: return ['background-color: yellow'] * len(row) else: return [''] * len(row) highlighted_df = filtered_df.style.apply(highlight_row, axis=1) highlighted_df fromnoncetotransactionIndexgasPricegasFeestatus 150xa9ff99346829E7c578E6d38C2269997a2FCcEEE1730390x4Ff30D7222B852c67A66Dc8E8d56A8cf92B8411c16125469887240616497858350 160x895D2d10FB9b92D0e1002c1a1bCdb90Ed42c3588949870xfF231524719dB94a0Ef08A88fC4e6939134EadE817125469887243495172312790 170xDd2B7694259a83753918BF5b6dC6961fabd2FDbC31800x4C99B25DdD0887D88b6C1364E3Df63a3bE76A5c318125469887242879702992390 180xF689ac0322786Ac2D7245Fcd665fe120ff1d0408943820xfF231524719dB94a0Ef08A88fC4e6939134EadE819125469887243495172312790 190xC81a00ee6839EE0dFbF465d3C08E5F0b0291b71A27080x4C99B25DdD0887D88b6C1364E3Df63a3bE76A5c320125469887242879702992390 200x244Fb415A8765812B9bc5B52cA14fd83C9d7E0e5562030xfF231524719dB94a0Ef08A88fC4e6939134EadE821125469887242340315853110 210x5ED1222A1c0BdBA479B61201231f539ac131DD69641320x4C99B25DdD0887D88b6C1364E3Df63a3bE76A5c322125469887242879702992390 220xeFa4b454A64049ff93cC37b54102982ACEdf4Eae66820xe27ddadbC8779D01fC539Bf5BA8529D72841862523125469887233748113267501 230x1BA4C73e7831b8099377c0583acfF4DBE488dFc6166270x4C99B25DdD0887D88b6C1364E3Df63a3bE76A5c324125469887242013560647630 240xd65eD99CB8b3b65CE378e3E5CaE545B751f4DAc6660630x4Ff30D7222B852c67A66Dc8E8d56A8cf92B8411c25125469887240616497858350 250xDa68EEe4c5b10D8A574b9ec072335c583B1C67A200xCF205808Ed36593aa40a44F10c7f7C2F67d4A4d426125469887288954547350181 260x9D94BdAf42d7906b3D3c011053ed2cBF42A1cA3f557120xfF231524719dB94a0Ef08A88fC4e6939134EadE827125469887336599568461861 270xe8C5433d6E8Fc7a2b38eF0391FabA7470c9576e451430x4C99B25DdD0887D88b6C1364E3Df63a3bE76A5c328125469887255865836296890 280xd9E4b9579a5CF5B336E258820CC95cA34411c9D676560x4C99B25DdD0887D88b6C1364E3Df63a3bE76A5c329125469887255865836296890 290x1F238B47ab9fD915e5852601E83c6c13582978701886260x4Ff30D7222B852c67A66Dc8E8d56A8cf92B8411c30125469887252936386062880 300xDb6f56639AaeA09FfEA6080D31A32851524128d4557420xfF231524719dB94a0Ef08A88fC4e6939134EadE831125469887254748032978540 310x27C2a598Db389b5276c0156f14B4dE75E490712F81120x4C99B25DdD0887D88b6C1364E3Df63a3bE76A5c332125469887255865836296890 320x8ac85761268B9Ac3fDe06d381611b64B232CEa97662940x4Ff30D7222B852c67A66Dc8E8d56A8cf92B8411c33125469887252936386062880 330x75Ff68BDe78974ab54a642fD294369447bD9Feef747960x4Ff30D7222B852c67A66Dc8E8d56A8cf92B8411c34125469887252070243718120 340xDd2B7694259a83753918BF5b6dC6961fabd2FDbC31810x4C99B25DdD0887D88b6C1364E3Df63a3bE76A5c335125469887255865836296890 350x807db242cD37b5E2B53697842197611f51693C06559790xfF231524719dB94a0Ef08A88fC4e6939134EadE836125469887254748032978540 </pre></td></tr></table></figure><h2 id="代码以及相关数据下载"><a href="#代码以及相关数据下载" class="headerlink" title="代码以及相关数据下载"></a>代码以及相关数据下载</h2><a href="https://github.com/jin10086/friend-tech-bot-analyze">https://github.com/jin10086/friend-tech-bot-analyze</a> 本文作者：高金 本文地址： <a href="https://igaojin.me/2023/09/18/friend-tech-%E5%A5%97%E5%88%A9%E5%88%B0%E5%BA%95%E6%9C%89%E5%A4%9A%E5%8D%B7/">https://igaojin.me/2023/09/18/friend-tech-套利到底有多卷/</a> 版权声明：转载请注明出处！<div id="gitalk-container"></div><script src="https://cdn.bootcss.com/blueimp-md5/2.12.0/js/md5.min.js"></script><link rel="stylesheet" href="https://unpkg.com/gitalk/dist/gitalk.css"><script src="https://unpkg.com/gitalk/dist/gitalk.min.js"></script><script>var gitalkConfig = {"clientID":"935e92a5333436856348","clientSecret":"e655566eaf920d216ec6283978d67874bf0850a6","repo":"jin10086.github.io","owner":"jin10086","admin":["jin10086"],"distractionFreeMode":false,"id":"page.date","createIssueManually":false}; gitalkConfig.id = md5(location.pathname);var gitalk = new Gitalk(gitalkConfig); gitalk.render("gitalk-container"); </script>