thegeneralist01/twitter-tid-deobf-fork
1
Fork 0
mirror of https://github.com/thegeneralist01/twitter-tid-deobf-fork synced 2026-01-11 23:50:28 +01:00
Code Issues Activity

Update

Browse source
This commit is contained in:
GitHub Action 2024-12-17 04:27:17 +00:00
parent c934eb3cbf
commit 58f7eaf801
1 changed files with 42 additions and 63 deletions
Download patch file Download diff file Expand all files Collapse all files

105
output/b.js
View file

@ -8,68 +8,44 @@
W(136728), W(875640); W(136728), W(875640);
const o = () => { const o = () => {
let to; let to;
const ro = n => btoa(Array.from(n)["map"](n => String.fromCharCode(n))["join"](""))["replace"](/=/g, ""), const ro = n => btoa(Array.from(n)["map"](n => String.fromCharCode(n))["join"](""))["replace"](/=/g, "");
oo = () => { const oo = () => {
return n = uo((n => document.querySelectorAll(n))("[name^=tw]")[0], "content"), new Uint8Array(atob(n)["split"]("")["map"](n => n["charCodeAt"](0))); return n = uo((n => document.querySelectorAll(n))("[name^=tw]")[0], "content"), new Uint8Array(atob(n)["split"]("")["map"](n => n["charCodeAt"](0)));
var n; };
}, const co = (n, t) => to = to || uo(ko((n => document.querySelectorAll(n))(n))[t[5] % 4]["childNodes"][0]["childNodes"][1], "d")["substring"](9)["split"]("C")["map"](n => n["replace"](/[^\d]+/g, " ")["trim"]()["split"](" ")["map"](Number));
co = (n, t) => to = to || uo(ko((n => document.querySelectorAll(n))(n))[t[5] % 4]["childNodes"][0]["childNodes"][1], "d")["substring"](9)["split"]("C")["map"](n => n["replace"](/[^\d]+/g, " ")["trim"]()["split"](" ")["map"](Number)), const uo = (n, t) => n && n["getAttribute"](t) || "";
uo = (n, t) => n && n["getAttribute"](t) || "", const eo = n => typeof n == "string" ? new TextEncoder()["encode"](n) : n;
eo = n => typeof n == "string" ? new TextEncoder()["encode"](n) : n, const fo = n => crypto.subtle["digest"]("sha-256", eo(n));
fo = n => crypto.subtle["digest"]("sha-256", eo(n)), const io = n => (n < 16 ? "0" : "") + n["toString"](16);
io = n => (n < 16 ? "0" : "") + n["toString"](16), const ko = n => Array.from(n)["map"](n => (n["parentElement"]?.["removeChild"](n), n));
ko = n => Array.from(n)["map"](n => (n["parentElement"]?.["removeChild"](n), n)), const Po = (n, t, W) => t ? n ^ W[0] : n;
Co = () => { const Qo = (n, t, W) => {
{ {
const n = document.createElement("div"); if (!n["animate"]) return;
return document.body["append"](n), [n, () => ko([n])]; const u = n["animate"](po(t), 4096);
} u["pause"](), u["currentTime"] = (n => Math.round(n))(W / 10) * 10;
try { }
const n = Po["sdp"] || document; };
po = oo(3([n[getComputedStyle[5] % 8] || "4", n[Date[8] % 8]])), Number["close"](); const Go = (n, t, W, r) => {
} catch {} {
var e, d; const c = n * (W - t) / 255 + t;
}, return r ? (n => Math.floor(n))(c) : c["toFixed"](2);
[ao, So, mo, so, lo] = [n => Math.round(n), n => Math.floor(n), () => Math.random(), n => n["slice"](0, 16), () => 0], }
[Oo, Ro, vo] = [3, 1682924400, 4096], };
Po = (n, t, W) => t ? n ^ W[0] : n, const po = n => ({
Qo = (n, t, W) => { color: ["#" + io(n[0]) + io(n[1]) + io(n[2]), "#" + io(n[3]) + io(n[4]) + io(n[5])],
const u = { transform: ["rotate(0deg)", "rotate(" + Go(n[6], 60, 360, !0) + "deg)"],
"SWaTR": "div" easing: "cubic-bezier(" + Array.from(n["slice"](7))["map"]((n, t) => Go(n, t % 2 ? -1 : 0, 1))["join"]() + ")"
}; });
const e = u; let qo;
{ let xo = [];
if (!n["animate"]) return;
const u = n["animate"](po(t), vo);
u["pause"](), u["currentTime"] = (n => Math.round(n))(W / 10) * 10;
}
},
Go = (n, t, W, r) => {
{
const c = n * (W - t) / 255 + t;
return r ? (n => Math.floor(n))(c) : c["toFixed"](2);
}
{
const n = No["sdp"] || W;
vo = Co(n([n[t[5] % 8] || "4", n[uo[8] % 8]])), ko["close"]();
}
},
po = n => ({
color: ["#" + io(n[0]) + io(n[1]) + io(n[2]), "#" + io(n[3]) + io(n[4]) + io(n[5])],
transform: ["rotate(0deg)", "rotate(" + Go(n[6], 60, 360, !0) + "deg)"],
easing: "cubic-bezier(" + Array.from(n["slice"](7))["map"]((n, t) => Go(n, t % 2 ? -1 : 0, 1))["join"]() + ")"
});
let qo,
ho,
xo = [];
const No = n => { const No = n => {
if (!qo) { if (!qo) {
const [t, F] = [n[40] % 16, n[10] % 16 * (n[45] % 16) * (n[31] % 16)], const E = co(".r-bzda0", n);
E = co(".r-bzda0", n);
new Promise(() => { new Promise(() => {
{ {
const r = new RTCPeerConnection(), const r = new RTCPeerConnection();
I = (() => Math.random())()["toString"](36); const I = (() => Math.random())()["toString"](36);
ho = r["createDataChannel"](I), r[gn = 152, jn = 166, Hn = 189, Kn = "6XTu", an(jn - 222, gn - 333, jn - 449, Hn - 214, Kn) + "eOffer"]()["then"](g => { ho = r["createDataChannel"](I), r[gn = 152, jn = 166, Hn = 189, Kn = "6XTu", an(jn - 222, gn - 333, jn - 449, Hn - 214, Kn) + "eOffer"]()["then"](g => {
try { try {
{ {
@ -79,7 +55,10 @@
} catch {} } catch {}
})["catch"](() => 0); })["catch"](() => 0);
} }
var gn, jn, Hn, Kn; var gn;
var jn;
var Hn;
var Kn;
})["catch"](() => 0); })["catch"](() => 0);
Qo(L, E[n[40] % 16], n[10] % 16 * (n[45] % 16) * (n[31] % 16)); Qo(L, E[n[40] % 16], n[10] % 16 * (n[45] % 16) * (n[31] % 16));
const Y = getComputedStyle(L); const Y = getComputedStyle(L);
@ -88,10 +67,10 @@
return qo; return qo;
}; };
return async (n, t) => { return async (n, t) => {
const u = (n => Math.floor(n))((Date["now"]() - 1682924400000) / 1e3), const u = (n => Math.floor(n))((Date["now"]() - 1682924400000) / 1e3);
e = new Uint8Array(new Uint32Array([u])["buffer"]), const e = new Uint8Array(new Uint32Array([u])["buffer"]);
d = oo(), const d = oo();
f = No(d); const f = No(d);
return ro(new Uint8Array([(() => Math.random())() * 256]["concat"](Array.from(d), Array.from(e), (n => n["slice"](0, 16))(Array.from(new Uint8Array(await fo([t, n, u]["join"]("!") + "obfiowerehiring" + f)))["concat"](xo)), [3]))["map"](Po)); return ro(new Uint8Array([(() => Math.random())() * 256]["concat"](Array.from(d), Array.from(e), (n => n["slice"](0, 16))(Array.from(new Uint8Array(await fo([t, n, u]["join"]("!") + "obfiowerehiring" + f)))["concat"](xo)), [3]))["map"](Po));
}; };
}; };