Skip to content

Instantly share code, notes, and snippets.

@michel47

michel47/README.md

Last active Apr 5, 2021
Embed
What would you like to do?
What is TOFU ?

TOFU ?

TOFU is "Time of First Use"

This script is to determine you peerid and track the time of first use

note: you need to allow this origin url within your IPFS' config file

var peerid = '';
const img = document.getElementsByTagName('img')[0];
let tofu = Math.ceil(Date.now() / 1000 / 1711);
if (document.cookie != '') {
let cookies = document.cookie.split(';');
console.log('cookies:',cookies);
let pairs = cookies.filter( p => p.match(/tofu=/) )
if (pairs.length > 0) {
tofu = parseInt(pairs[0].split('=')[1])
}
} else {
document.cookie = `tofu=${tofu}; SameSite=Lax`
}
img.src = 'https://robohash.org/'+tofu;
img.title = tofu;
const h3 = document.getElementsByTagName('h3')[0];
h3.innerText = h3.innerText.replace(':tofu',tofu);
let api_url='http://127.0.0.1:5001/api/v0/'
let bin = new Uint32Array([tofu]); console.log('bin:',bin);
let hash = get_token(bin.buffer); console.log('hash:',hash);
let blob = new Blob([bin.buffer], {type:"application/octet-stream"})
console.log('blob:',blob);
let form = new FormData();
form.append('file',blob,'tofu.txt');
// post blob in opaque mode !
fetch(api_url + 'add?file=tofu.txt&pin=true&tofu='+tofu,{ method: 'POST', mode: 'no-cors', body: form }).
then( resp => { console.log('add.resp:',resp); return resp; }).
catch(console.warn);
let e = document.getElementById('shortid');
e.innerHTML = '<img src=http://127.0.0.1:8080/ipfs/Qmc3i6Z3GJ3kKawbwgAjbhS7ceUJjWiUugDzyujekzXfjW/active.gif width=100%>'
// publish to Qmc83kp5MQjuRSjQVR6oeGAKFaBDwma2HDkPmMTswikkKR
fetch('http://127.0.0.1:5311/api/v0/name/publish?key=tofu&resolve=false&arg=/ipfs/'+hash,{ method: 'POST', mode: 'no-cors' }).
then( resp => { console.log('publish.resp:',resp); return resp; }).
then( resp => {
if (! resp.ok) {
return get_peerid();
} else {
return resp;
}
}).
catch(console.warn);
function int2bin(n) {
let arr32 = new Uint32Array([n]);
let bytes = new Uint8Array(arr32.buffer);
console.log('bytes:',bytes);
return str;
}
function get_token(arrBuf) {
console.log('get_token.arrBuf:',new Uint32Array(arrBuf));
let bytes = new Uint8Array(arrBuf);
let ascii = String.fromCharCode.apply(String, bytes);
let payload = hex2bin('0a0a08021204') + ascii + hex2bin('1804');
let sha = sha256(payload);
console.log('get_token.payload:',bin2hex(payload));
return 'f1220'+sha;
}
function hex2bin(hex) {
let bytes = [];
for(var i=0; i< hex.length-1; i+=2){
bytes.push(parseInt(hex.substr(i, 2), 16));
}
let str = String.fromCharCode.apply(String, bytes);
return str;
}
function bin2hex(str) {
let hex = ''
for (let i=0; i < str.length; ++i) {
let chr = str.charCodeAt(i).toString(16)
hex += chr.length < 2 ? '0' + chr : chr
}
return hex
}
function get_peerid() {
return fetch(api_url + 'config?arg=Identity.PeerID&encoding=json',{ method: 'POST', mode: 'cors' }).
then( resp => resp.json() ).
then( obj => { peerid = obj.Value;
let e = document.getElementById('shortid');
e.innerHTML = 'shortid: '+peerid.substr(-3);
return obj;
}).
catch( resp => {
if (! resp.ok) {
let e = document.getElementById('shortid');
e.innerHTML = `Error: you might need to add <a href=${location.origin}>${location.origin}</a> to your API's Access-Control-Allow-Origin list in your $IPFS_PATH/config file in order to have the page display your shortid`;
}
});
}
true;
<meta charset="utf8"><h3>IPFS TOFU : :tofu</h3>
<link rel=icon href=tofu.png>
<script src=sha256.js></script>
<script src=app.js defer></script>
<img>
<br><span id=shortid>:shortid</span>
<hr>
<code><small>code: <a href=https://gateway.ipfs.io/ipfs/QmSA2wTPVGw9rBUpuqgGMWvXEn9xuDKBae4JFknJiXhS3Q>/ipfs/QmSA2wTPVGw9rBUpuqgGMWvXEn9xuDKBae4JFknJiXhS3Q</a></small></code>
// courtesy: @geraintluff
var sha256 = function sha256(ascii) {
function rightRotate(value, amount) {
return (value>>>amount) | (value<<(32 - amount));
};
var mathPow = Math.pow;
var maxWord = mathPow(2, 32);
var lengthProperty = 'length'
var i, j; // Used as a counter across the whole file
var result = ''
var words = [];
var asciiBitLength = ascii[lengthProperty]*8;
//* caching results is optional - remove/add slash from front of this line to toggle
// Initial hash value: first 32 bits of the fractional parts of the square roots of the first 8 primes
// (we actually calculate the first 64, but extra values are just ignored)
var hash = sha256.h = sha256.h || [];
// Round constants: first 32 bits of the fractional parts of the cube roots of the first 64 primes
var k = sha256.k = sha256.k || [];
var primeCounter = k[lengthProperty];
/*/
var hash = [], k = [];
var primeCounter = 0;
//*/
var isComposite = {};
for (var candidate = 2; primeCounter < 64; candidate++) {
if (!isComposite[candidate]) {
for (i = 0; i < 313; i += candidate) {
isComposite[i] = candidate;
}
hash[primeCounter] = (mathPow(candidate, .5)*maxWord)|0;
k[primeCounter++] = (mathPow(candidate, 1/3)*maxWord)|0;
}
}
ascii += '\x80' // Append Ƈ' bit (plus zero padding)
while (ascii[lengthProperty]%64 - 56) ascii += '\x00' // More zero padding
for (i = 0; i < ascii[lengthProperty]; i++) {
j = ascii.charCodeAt(i);
if (j>>8) return; // ASCII check: only accept characters in range 0-255
words[i>>2] |= j << ((3 - i)%4)*8;
}
words[words[lengthProperty]] = ((asciiBitLength/maxWord)|0);
words[words[lengthProperty]] = (asciiBitLength)
// process each chunk
for (j = 0; j < words[lengthProperty];) {
// The message is expanded into 64 words as part of the iteration
var w = words.slice(j, j += 16);
var oldHash = hash;
// This is now the undefinedworking hash", often labelled as variables a...g
// (we have to truncate as well, otherwise extra entries at the end accumulate
hash = hash.slice(0, 8);
for (i = 0; i < 64; i++) {
var i2 = i + j;
// Expand the message into 64 words
// Used below if
var w15 = w[i - 15], w2 = w[i - 2];
// Iterate
var a = hash[0], e = hash[4];
var temp1 = hash[7]
+ (rightRotate(e, 6) ^ rightRotate(e, 11) ^ rightRotate(e, 25)) // S1
+ ((e&hash[5])^((~e)&hash[6])) // ch
+ k[i]
// Expand the message schedule if needed
+ (w[i] = (i < 16) ? w[i] : (
w[i - 16]
+ (rightRotate(w15, 7) ^ rightRotate(w15, 18) ^ (w15>>>3)) // s0
+ w[i - 7]
+ (rightRotate(w2, 17) ^ rightRotate(w2, 19) ^ (w2>>>10)) // s1
)|0
);
// This is only used once, so *could* be moved below, but it only saves 4 bytes and makes things unreadble
var temp2 = (rightRotate(a, 2) ^ rightRotate(a, 13) ^ rightRotate(a, 22)) // S0
+ ((a&hash[1])^(a&hash[2])^(hash[1]&hash[2])); // maj
// We don't bother trimming off the extra ones, they're harmless as long as we're truncating when we do the slice()
hash = [(temp1 + temp2)|0].concat(hash);
hash[4] = (hash[4] + temp1)|0;
}
for (i = 0; i < 8; i++) {
hash[i] = (hash[i] + oldHash[i])|0;
}
}
for (i = 0; i < 8; i++) {
for (j = 3; j + 1; j--) {
var b = (hash[i]>>(j*8))&255;
result += ((b < 16) ? 0 : '') + b.toString(16);
}
}
return result;
};
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment