No captcha?

Hello,
I am learning programming and just discovered this website. But I am curious, how does it protect its users from spammers (people who post illegal or annoying things) without a reCaptcha? I thought clicking this blue box is required to prove that you are not a robot, can you please share any javascript that you use for this purpose?
Thank you and have a nice day,
Brian

999 buzz=Three Name: Anonymous 2021-01-22 4:27 nextperm=20210122472
🂻 💙 💝 🂺 😍 die +0m #362 fizz=362 inhour=47 inday=93 prime=2441 hofR=71082 😍 🂺 💝 💙 🂻
gcd = 1 = (-129)*999 + 356*362
fib = 1244666864935793005828156005589143096022236302705537193166716344690085611761
e ~ 1957472231827739495902165191 / 720113790753404797929429296 = 2.71828182845904523536028747135266249775724709369995959_2602749

Added the elitists' loglogn Hofstadter recipe https://textboard.org/prog/100 as a processing step >>116 to compute successive R values https://oeis.org/A005228 and attach them to the 362 >>8 "die" posts. https://dis.tinychan.net/read/prog/1582047203 Don't ask me why the math part works, it's magic and you can go ask the elitists. [parsetime, buttonnum, rmslinks, timedelta, count, rmsimages, fizzbuzz, hourdaily, primes, hofr, hearts, gcd, fibonacci, broccoli, nextperm]

posts code in /prog/

(processors => Array.from (document.querySelectorAll ("div.post > div.body")).filter (e => "die" == e.innerText).forEach (e => (elemstate => processors.forEach (p => p (e, elemstate))) ({}))) ([
(e, estate) => (m => { estate['posttime'] = m [0]; estate['day'] = parseInt (m [1], 10); estate['hour'] = parseInt (m [2], 10); estate['min'] = parseInt (m [3], 10); }) (e.parentNode.querySelector ('span.post_time').innerText.match (/^2021-01-(\d+) (\d+):(\d+)$/)),
(e, estate) => (btn => { estate['button'] = btn; estate['buttonnum'] = parseInt (btn.innerText, 10); }) (e.parentNode.querySelector ('button.num')),
(rmsarray => (e, estate) => { e.innerHTML = "<a class='die-link' href='#" + rmsarray [Math.floor (rmsarray.length * Math.random ())].parentNode.getAttribute ("id") + "'>" + e.innerHTML.trim () + "</a>"; }) (Array.from (document.querySelectorAll ("div.post > div.body")).filter (e => /https?:\/\/(www[.])?stallman[.]org\/archives\//.test (e.innerHTML))),
(procstate => (e, estate) => ((t, last) => { if (last >= 0) { ((h, m) => { e.innerHTML += ' +' + (h > 0 ? h + 'h' : '') + m + 'm'; }) ((t - last - (t - last) % 60) / 60, (t - last) % 60); } procstate['last'] = t; }) ((estate['day'] * 24 + estate['hour']) * 60 + estate['min'], procstate['last'])) ({last: -1}),
(procstate => (e, estate) => { e.innerHTML += ' #' + (estate['diecount'] = (++procstate['count'])); }) ({count: 0}),
((makelink, mod) => (e, estate) => { e.innerHTML = e.innerHTML.replace (/ (\S+)$/, makelink (estate['diecount'], mod)); }) ((count, mod) => (match, p1) => [' <a class="image-link" target="_blank" href="https://www.stallman.org/photos/rms-working/pages/', ((count - 1) % mod) + 1, '.html">', p1, '</a>'].join (''), 149),
((cycle, fbval, spec) => ((fb, fbn) => (e, estate) => { e.innerHTML += ' fizz=' + fb.next ().value; estate['button'].innerHTML += ' buzz=' + fbn (estate['buttonnum']); }) (function* () { const gens = spec.map (cycle); for (let k = 1; ; k++) { yield fbval (k, gens.map (g => g.next ().value)); } } (), n => fbval (n, spec.map (([div, s]) => n % div == 0 ? s : "")))) (function* ([n, s]) { for (;;) { for (let k = 1; k < n; k++) { yield ""; } yield s; } }, (n, vals) => { const s = vals.join (""); return s === "" ? n.toString () : s; }, [[3, "Three"], [5, "Five"], [7, "Seven"], [11, "Eleven"]]),
((procstate, spec) => (e, estate) => { e.innerHTML += spec.map (([label, keyfun]) => (key => (count => { procstate[key] = count + 1; return ' ' + label + '=' + (count + 1); }) (procstate[key] ?? 0)) (keyfun (estate))).join (''); }) ({}, [['inhour', estate => 'd' + estate['day'] + 'h' + estate['hour']], ['inday', estate => 'd' + estate['day']]]),
((base, filter, hasmod) => (primes => (e, estate) => { e.innerHTML += ' prime=' + primes.next ().value; }) (function* () { for (let p = base (2), x = p.next ().value; ; p = filter (hasmod (x), p), x = p.next ().value) { yield x; } } ())) (function* (start) { for (let x = start; ; x++) { yield x; } }, function* (pred, iter) { for (let x = iter.next (); !x.done; x = iter.next ()) { if (pred (x.value)) { yield x.value; } } }, div => x => x % div != 0),
(next => (hofr => (e, estate) => { e.innerHTML += ' hofR=' + hofr.next ().value; }) (function* () { yield 1; yield 3; let levels = [], r = 3, s = 4, count = 3; for (;;) { for (let k = 0; k < count; k++) { r += s + k; yield r; } [s, count] = next (levels, 0); } } ())) ((() => { let next = (levels, level) => { if (level < levels.length) { let state = levels [level]; let [start, count, used, S] = state; if (used < count) { let length = start + (used - 1); state [2] = used + 1; state [3] = S + (length + 1); return [S, length]; } else { [start, count] = next (levels, level + 1); let length = start - 1; state [0] = start; state [1] = count; state [2] = 1; state [3] = S + (length + 1); return [S, length]; } } else { levels.push ([4, 3, 2, 13]); return [8, 4]; } }; return next; }) ()),
((chars, n) => (narray => (e, estate) => (pick => { e.innerHTML = pick.join (' ') + ' ' + e.innerHTML + ' ' + pick.reverse ().join (' '); }) (narray.map (k => chars [Math.floor (chars.length * Math.random ())]).map (s => '&#x' + s + ';'))) (Array.from (Array (n).keys ()))) ('2619 2661 2665 2763 2764 2765 2766 2767 2E96 2E97 2F3C 1F0B1 1F0B2 1F0B3 1F0B4 1F0B5 1F0B6 1F0B7 1F0B8 1F0B9 1F0BA 1F0BB 1F0BC 1F0BD 1F0BE 1F394 1F491 1F493 1F494 1F495 1F496 1F497 1F498 1F499 1F49A 1F49B 1F49C 1F49D 1F49E 1F49F 1F5A4 1F60D 1F63B'.split (' '), 5),
((step, paren) => ((gcd, show) => (e, estate) => ((a, b) => { e.innerHTML += '<br/>' + show (a, b, gcd (a, b)); }) (estate['buttonnum'], estate['diecount'])) ((a, b) => { const state = [a, b, 1, 0, 0, 1]; while (state[1] != 0) { step (state); } return [state[0], state[2], state[3]]; }, (a, b, [g, x, y]) => ['gcd = ', g, ' = ', paren (x), '*', a, ' + ', paren (y), '*', b].join (''))) (state => { const [a, b, fa, fb, ga, gb] = state; const m = a % b, d = (a - m) / b; state[0] = b; state[1] = m; state[2] = ga; state[3] = gb; state[4] = fa - d * ga; state[5] = fb - d * gb; }, a => a < 0 ? '(' + a + ')' : a.toString ()),
(fibs => (e, estate) => { e.innerHTML += '<br/>fib = ' + fibs.next ().value; }) (function* () { let a = BigInt (0), b = BigInt (1); yield a; yield b; for (;;) { [a, b] = [b, a + b]; yield b; } } ()),
(procstate => ((tobig, matmul, tofrac, show1, show2, diff, marker, lr4e) => ((S, L, R) => (mstream => (estream => (e, estate) => ((prev, tfnow) => (snow => { e.innerHTML += '<br/>e ~ ' + show1 (tfnow) + (prev === '' ? snow : marker (snow, diff (prev, snow))); procstate['prev'] = snow; }) (show2 (tfnow))) (procstate['prev'], tofrac (estream.next ().value))) (mstream (lr4e ()))) (function* (lrstream) { let m = S; for (let x = lrstream.next ().value; ; x = lrstream.next ().value) { m = matmul (m, x == 'L' ? L : R); yield m; } })) (tobig ([0, 1, 1, 0]), tobig ([1, 1, 0, 1]), tobig ([1, 0, 1, 1]))) (m => m.map (x => BigInt (x)), (m1, m2) => [m1 [0] * m2 [0] + m1 [1] * m2 [2], m1 [0] * m2 [1] + m1 [1] * m2 [3], m1 [2] * m2 [0] + m1 [3] * m2 [2], m1 [2] * m2 [1] + m1 [3] * m2 [3]], m => [m [0] + m [1], m [2] + m [3]], ([a, b]) => a.toString () + ' / ' + b.toString () + ' = ', (digits => (power => ([a, b]) => (a / b).toString () + '.' + (a % b * power / b).toString ().padStart (digits, '0')) (BigInt (10) ** BigInt (digits))) (60), (s1, s2) => { let n = Math.min (s1.length, s2.length); for (let k = 0; k < n; k++) { if (s1 [k] !== s2 [k]) { return k; } } return n < s2.length ? n : -1; }, (s, pos) => pos < 0 ? s : (s.substring (0, pos) + '_' + s.substring (pos)), function* () { let count = 0; yield 'R'; for (;;) { count += 2; yield* 'RL'; yield* 'R'.repeat (count); count += 2; yield* 'LR'; yield* 'L'.repeat (count); } })) ({prev: ''}),
((sortend, minover, swap) => (next => (e, estate) => { e.parentNode.children [0].innerHTML += ' nextperm=' + next (Array.from (estate['posttime'].replace (/\D/g, ''))).join (''); }) (arr => { if (arr.length < 2) { return arr; } for (let k = arr.length - 2; k >= 0; k--) { let over = minover (arr, k); if (over >= 0) { return sortend (swap (arr, k, over + k + 1), k + 1); } } return arr.sort (); })) ((arr, pos) => { arr.splice (pos, arr.length - pos, ...arr.slice (pos).sort ()); return arr; }, (arr, pos) => arr.slice (pos + 1).reduce ((acc, item, idx, sli) => (arr [pos] < item) && ((acc < 0) || (item < sli [acc])) ? idx : acc, -1), (arr, a, b) => { let x = arr [a]; arr [a] = arr [b]; arr [b] = x; return arr; }),
])

770 buzz=FiveSevenEleven Name: Anonymous 2021-01-20 3:06 nextperm=20210120360
🂱 💚 💗 💚 💖 die +3m #154 fizz=SevenEleven inhour=7 inday=64 prime=887 hofR=13349 💖 💚 💗 💚 🂱
gcd = 154 = 0*770 + 1*154 lcm = 770
fib = 42230279526998466217810220532898
e ~ 1038929163353808 / 382200680031313 = 2.71828182845904523536028747134_9248563371580028939628559933000

Upgraded the gcd processing step >>108 to compute the lcm as well for the 362 >>8 "die" posts. https://dis.tinychan.net/read/prog/1582047203 [parsetime, buttonnum, rmslinks, timedelta, count, rmsimages, fizzbuzz, hourdaily, primes, hofr, hearts, gcdlcm, fibonacci, broccoli, nextperm]

posts code in /prog/

(processors => Array.from (document.querySelectorAll ("div.post > div.body")).filter (e => "die" == e.innerText).forEach (e => (elemstate => processors.forEach (p => p (e, elemstate))) ({}))) ([
(e, estate) => (m => { estate['posttime'] = m [0]; estate['day'] = parseInt (m [1], 10); estate['hour'] = parseInt (m [2], 10); estate['min'] = parseInt (m [3], 10); }) (e.parentNode.querySelector ('span.post_time').innerText.match (/^2021-01-(\d+) (\d+):(\d+)$/)),
(e, estate) => (btn => { estate['button'] = btn; estate['buttonnum'] = parseInt (btn.innerText, 10); }) (e.parentNode.querySelector ('button.num')),
(rmsarray => (e, estate) => { e.innerHTML = "<a class='die-link' href='#" + rmsarray [Math.floor (rmsarray.length * Math.random ())].parentNode.getAttribute ("id") + "'>" + e.innerHTML.trim () + "</a>"; }) (Array.from (document.querySelectorAll ("div.post > div.body")).filter (e => /https?:\/\/(www[.])?stallman[.]org\/archives\//.test (e.innerHTML))),
(procstate => (e, estate) => ((t, last) => { if (last >= 0) { ((h, m) => { e.innerHTML += ' +' + (h > 0 ? h + 'h' : '') + m + 'm'; }) ((t - last - (t - last) % 60) / 60, (t - last) % 60); } procstate['last'] = t; }) ((estate['day'] * 24 + estate['hour']) * 60 + estate['min'], procstate['last'])) ({last: -1}),
(procstate => (e, estate) => { e.innerHTML += ' #' + (estate['diecount'] = (++procstate['count'])); }) ({count: 0}),
((makelink, mod) => (e, estate) => { e.innerHTML = e.innerHTML.replace (/ (\S+)$/, makelink (estate['diecount'], mod)); }) ((count, mod) => (match, p1) => [' <a class="image-link" target="_blank" href="https://www.stallman.org/photos/rms-working/pages/', ((count - 1) % mod) + 1, '.html">', p1, '</a>'].join (''), 149),
((cycle, fbval, spec) => ((fb, fbn) => (e, estate) => { e.innerHTML += ' fizz=' + fb.next ().value; estate['button'].innerHTML += ' buzz=' + fbn (estate['buttonnum']); }) (function* () { const gens = spec.map (cycle); for (let k = 1; ; k++) { yield fbval (k, gens.map (g => g.next ().value)); } } (), n => fbval (n, spec.map (([div, s]) => n % div == 0 ? s : "")))) (function* ([n, s]) { for (;;) { for (let k = 1; k < n; k++) { yield ""; } yield s; } }, (n, vals) => { const s = vals.join (""); return s === "" ? n.toString () : s; }, [[3, "Three"], [5, "Five"], [7, "Seven"], [11, "Eleven"]]),
((procstate, spec) => (e, estate) => { e.innerHTML += spec.map (([label, keyfun]) => (key => (count => { procstate[key] = count + 1; return ' ' + label + '=' + (count + 1); }) (procstate[key] ?? 0)) (keyfun (estate))).join (''); }) ({}, [['inhour', estate => 'd' + estate['day'] + 'h' + estate['hour']], ['inday', estate => 'd' + estate['day']]]),
((base, filter, hasmod) => (primes => (e, estate) => { e.innerHTML += ' prime=' + primes.next ().value; }) (function* () { for (let p = base (2), x = p.next ().value; ; p = filter (hasmod (x), p), x = p.next ().value) { yield x; } } ())) (function* (start) { for (let x = start; ; x++) { yield x; } }, function* (pred, iter) { for (let x = iter.next (); !x.done; x = iter.next ()) { if (pred (x.value)) { yield x.value; } } }, div => x => x % div != 0),
(next => (hofr => (e, estate) => { e.innerHTML += ' hofR=' + hofr.next ().value; }) (function* () { yield 1; yield 3; let levels = [], r = 3, s = 4, count = 3; for (;;) { for (let k = 0; k < count; k++) { r += s + k; yield r; } [s, count] = next (levels, 0); } } ())) ((() => { let next = (levels, level) => { if (level < levels.length) { let state = levels [level]; let [start, count, used, S] = state; if (used < count) { let length = start + (used - 1); state [2] = used + 1; state [3] = S + (length + 1); return [S, length]; } else { [start, count] = next (levels, level + 1); let length = start - 1; state [0] = start; state [1] = count; state [2] = 1; state [3] = S + (length + 1); return [S, length]; } } else { levels.push ([4, 3, 2, 13]); return [8, 4]; } }; return next; }) ()),
((chars, n) => (narray => (e, estate) => (pick => { e.innerHTML = pick.join (' ') + ' ' + e.innerHTML + ' ' + pick.reverse ().join (' '); }) (narray.map (k => chars [Math.floor (chars.length * Math.random ())]).map (s => '&#x' + s + ';'))) (Array.from (Array (n).keys ()))) ('2619 2661 2665 2763 2764 2765 2766 2767 2E96 2E97 2F3C 1F0B1 1F0B2 1F0B3 1F0B4 1F0B5 1F0B6 1F0B7 1F0B8 1F0B9 1F0BA 1F0BB 1F0BC 1F0BD 1F0BE 1F394 1F491 1F493 1F494 1F495 1F496 1F497 1F498 1F499 1F49A 1F49B 1F49C 1F49D 1F49E 1F49F 1F5A4 1F60D 1F63B'.split (' '), 5),
((step, paren) => ((gcd, show) => (e, estate) => ((a, b) => { e.innerHTML += '<br/>' + show (a, b, gcd (a, b)); }) (estate['buttonnum'], estate['diecount'])) ((a, b) => { const state = [a, b, 1, 0, 0, 1]; while (state[1] != 0) { step (state); } return [state[0], state[2], state[3]]; }, (a, b, [g, x, y]) => ['gcd = ', g, ' = ', paren (x), '*', a, ' + ', paren (y), '*', b, ' lcm = ', a * b / g].join (''))) (state => { const [a, b, fa, fb, ga, gb] = state; const m = a % b, d = (a - m) / b; state[0] = b; state[1] = m; state[2] = ga; state[3] = gb; state[4] = fa - d * ga; state[5] = fb - d * gb; }, a => a < 0 ? '(' + a + ')' : a.toString ()),
(fibs => (e, estate) => { e.innerHTML += '<br/>fib = ' + fibs.next ().value; }) (function* () { let a = BigInt (0), b = BigInt (1); yield a; yield b; for (;;) { [a, b] = [b, a + b]; yield b; } } ()),
(procstate => ((tobig, matmul, tofrac, show1, show2, diff, marker, lr4e) => ((S, L, R) => (mstream => (estream => (e, estate) => ((prev, tfnow) => (snow => { e.innerHTML += '<br/>e ~ ' + show1 (tfnow) + (prev === '' ? snow : marker (snow, diff (prev, snow))); procstate['prev'] = snow; }) (show2 (tfnow))) (procstate['prev'], tofrac (estream.next ().value))) (mstream (lr4e ()))) (function* (lrstream) { let m = S; for (let x = lrstream.next ().value; ; x = lrstream.next ().value) { m = matmul (m, x == 'L' ? L : R); yield m; } })) (tobig ([0, 1, 1, 0]), tobig ([1, 1, 0, 1]), tobig ([1, 0, 1, 1]))) (m => m.map (x => BigInt (x)), (m1, m2) => [m1 [0] * m2 [0] + m1 [1] * m2 [2], m1 [0] * m2 [1] + m1 [1] * m2 [3], m1 [2] * m2 [0] + m1 [3] * m2 [2], m1 [2] * m2 [1] + m1 [3] * m2 [3]], m => [m [0] + m [1], m [2] + m [3]], ([a, b]) => a.toString () + ' / ' + b.toString () + ' = ', (digits => (power => ([a, b]) => (a / b).toString () + '.' + (a % b * power / b).toString ().padStart (digits, '0')) (BigInt (10) ** BigInt (digits))) (60), (s1, s2) => { let n = Math.min (s1.length, s2.length); for (let k = 0; k < n; k++) { if (s1 [k] !== s2 [k]) { return k; } } return n < s2.length ? n : -1; }, (s, pos) => pos < 0 ? s : (s.substring (0, pos) + '_' + s.substring (pos)), function* () { let count = 0; yield 'R'; for (;;) { count += 2; yield* 'RL'; yield* 'R'.repeat (count); count += 2; yield* 'LR'; yield* 'L'.repeat (count); } })) ({prev: ''}),
((sortend, minover, swap) => (next => (e, estate) => { e.parentNode.children [0].innerHTML += ' nextperm=' + next (Array.from (estate['posttime'].replace (/\D/g, ''))).join (''); }) (arr => { if (arr.length < 2) { return arr; } for (let k = arr.length - 2; k >= 0; k--) { let over = minover (arr, k); if (over >= 0) { return sortend (swap (arr, k, over + k + 1), k + 1); } } return arr.sort (); })) ((arr, pos) => { arr.splice (pos, arr.length - pos, ...arr.slice (pos).sort ()); return arr; }, (arr, pos) => arr.slice (pos + 1).reduce ((acc, item, idx, sli) => (arr [pos] < item) && ((acc < 0) || (item < sli [acc])) ? idx : acc, -1), (arr, a, b) => { let x = arr [a]; arr [a] = arr [b]; arr [b] = x; return arr; }),
])

die

>>125
Stay mad, /pol/cel.

"die" post counts >>8,28 | rates >>30 | 100-groups >>47,49 | hourly count chart >>53,54 | timestamp delta table >>59,60 | decorators >>123,124 [parsetime, buttonnum, rmslinks, timedelta, count, rmsimages, fizzbuzz, hourdaily, primes, hofr, hearts, gcdlcm, fibonacci, broccoli, nextperm]


https://www.theguardian.com/us-news/2021/mar/23/sidney-powell-trump-election-fraud-claims

Pro-Trump lawyer says ‘no reasonable person’ would believe her election lies

DIE

>>126
Why do you keep posting the election stuff? I was making fun of everybody here during the election fraud nonsense.

>>128
The fact that it's about the election, while important, is not the main aspect. The takeaway is that sooner or later those whose standard method of operation is promoting anti-reality will inevitably either slip up or be forced to admit to lying, if they can't maintain total information suppression. This regularly punctures the fantasy bubble their followers depend on, and makes information suppression essential to them, as you've seen with the 413 tightly grouped suppression posts >>28 in three days. This applies regardless of political color, but when one side comes to depend disproportionately on promoting anti-reality, the need for information suppression also becomes asymmetric. Without it you get things like their supreme leader saying https://www.washingtonpost.com/opinions/2020/03/31/want-proof-that-republicans-want-suppress-voters-just-ask-trump/ "levels of voting that, if you ever agreed to it, you’d never have a Republican elected in this country again", or their election fraud spearhead claiming https://www.theguardian.com/us-news/2021/mar/23/sidney-powell-trump-election-fraud-claims "no reasonable person would conclude that the statements were truly statements of fact", or their lawyer admitting https://www.commondreams.org/news/2021/03/03/blaring-quiet-part-out-loud-gop-lawyer-admits-supreme-court-easier-voting-puts to the Supreme Court that easier voting puts them at "competitive disadvantage", or their senator admitting https://www.theguardian.com/us-news/2020/oct/08/republican-us-senator-mike-lee-democracy that democracy is not what they want.


"die" post counts >>8,28 | rates >>30 | 100-groups >>47,49 | hourly count chart >>53,54 | timestamp delta table >>59,60 | decorators >>123,124 [parsetime, buttonnum, rmslinks, timedelta, count, rmsimages, fizzbuzz, hourdaily, primes, hofr, hearts, gcdlcm, fibonacci, broccoli, nextperm]

>>129
I just don't like you and your need to bump a dead thread nobody else is participating in over and over again, effectively spamming, it has nothing to do with supressing Stallman or whatever political motivations you have been obsessing over for months. At least now the spam is programming related, but it also makes you look a bit insane to keep up with this for months, on top of the year of Stallman posts before this.

>>130
I wish you good health and good fortune, my friend.

"die" post counts >>8,28 | rates >>30 | 100-groups >>47,49 | hourly count chart >>53,54 | timestamp delta table >>59,60 | decorators >>123,124 [parsetime, buttonnum, rmslinks, timedelta, count, rmsimages, fizzbuzz, hourdaily, primes, hofr, hearts, gcdlcm, fibonacci, broccoli, nextperm]

https://www.stallman.org/archives/2021-jan-apr.html#8_April_2021_(Stallman_support)

Supporting Stallman against a campaign of hatred

https://stallmansupport.org/

Stallman bot cultist is spamming non-stop now?

413 >>28 tightly grouped suppression posts in three days without ban >>85

spamming

https://dis.tinychan.net/read/prog/1582047203#reply_572

https://www.commondreams.org/news/2021/01/07/murder-media-pro-trump-insurrectionists-target-journalists-covering-attack-us 🐘 Freedom of the press is the first target of fascists everywhere, as they seek to silence opposition and suppress any information that contradicts the alternate reality that their narcissistic leader creates to support his racist fantasy world.

>>133
Why should pro-Russian commies, like Stallman, have any freedoms to start with?

>>133
Three days of sage has me living in your head for months. I hate to invoke the rent free meme, but...

>>135 → >>83-86

"die" post counts >>8,28 | rates >>30 | 100-groups >>47,49 | hourly count chart >>53,54 | timestamp delta table >>59,60 | decorators >>123,124 [parsetime, buttonnum, rmslinks, timedelta, count, rmsimages, fizzbuzz, hourdaily, primes, hofr, hearts, gcdlcm, fibonacci, broccoli, nextperm]

https://www.theguardian.com/us-news/2021/mar/23/sidney-powell-trump-election-fraud-claims

Pro-Trump lawyer says ‘no reasonable person’ would believe her election lies

pro-Russian https://dis.tinychan.net/read/prog/1618253998/31
commies https://dis.tinychan.net/read/prog/1618414920/10

https://www.commondreams.org/news/2021/03/03/blaring-quiet-part-out-loud-gop-lawyer-admits-supreme-court-easier-voting-puts

Blaring Quiet Part Out Loud, GOP Lawyer Admits to Supreme Court That Easier Voting Puts Republicans at 'Competitive Disadvantage'

>>136
oh lol, forgot about that. But >>86 wasn't me, sorry.

To find the largest gcd >>123 after the 362 >>8 "die" posts https://dis.tinychan.net/read/prog/1582047203 are decorated:
>> Array.from (document.querySelectorAll ("div.post > div.body")).map (e => [e.innerText.match (/gcd = (\d+) = /), e.parentNode.querySelector ('button.num').innerText]).filter (p => p [0] != null).map (p => [parseInt (p [0] [1], 10), p [1].split (' ', 1) [0]]).sort ((a, b) => a [0] - b [0]).slice (-5)
0: Array [ 56, "784" ]
​1: Array [ 87, "696" ]
​2: Array [ 88, "792" ]
​3: Array [ 126, "882" ]
​4: Array [ 154, "770" ]

To find the longest fizzbuzz string on the post number after the 362 >>8 "die" posts https://dis.tinychan.net/read/prog/1582047203 are decorated:
>> Array.from (document.querySelectorAll ("button.num")).map (e => e.innerText.match (/(\d+) buzz=(\S+)/)).filter (m => m != null).map (m => [m [1], m [2]]).sort ((a, b) => a [1].length - b [1].length).slice (-5)
0: Array [ "770", "FiveSevenEleven" ]
​1: Array [ "825", "ThreeFiveEleven" ]
​2: Array [ "990", "ThreeFiveEleven" ]
​3: Array [ "693", "ThreeSevenEleven" ]
​4: Array [ "924", "ThreeSevenEleven" ]
And on the "die" post counter:
>> Array.from (document.querySelectorAll ("div.post > div.body")).map (e => e.innerText.match (/#(\d+).* fizz=(\S+)/)).filter (m => m != null).map (m => [m [1], m [2]]).sort ((a, b) => a [1].length - b [1].length).slice (-5)
0: Array [ "210", "ThreeFiveSeven" ]
​1: Array [ "315", "ThreeFiveSeven" ]
​2: Array [ "165", "ThreeFiveEleven" ]
​3: Array [ "330", "ThreeFiveEleven" ]
​4: Array [ "231", "ThreeSevenEleven" ]

yawn

Yearning >>141
Aeris
Wet &
Needy https://gelbooru.com/index.php?page=post&s=view&id=4803544

>>142
virus

>>143
Already done. https://dis.tinychan.net/read/prog/1618426530/17,19,22,23,25

https://iqcaptcha.us.to/

>>144
virus

>>145
virus

Array.from (document.querySelectorAll ("div.post > div.body")).filter (e => /^virus$/i.test (e.innerText.replace (/[^a-zA-Z]+/g, ''))).forEach (e => { e.parentNode.parentNode.removeChild (e.parentNode); })

>>148
virus

https://gelbooru.com/index.php?page=post&s=view&id=6068030

no wordplay + not yuri + futa + source is twitter === garbage collection

Upgrade of >>148:
(walk => Array.from (document.querySelectorAll ("div.post > div.body")).filter (e => /^virus$/i.test (e.innerText.replace (/[^a-zA-Z]+/g, ''))).forEach (walk)) ((() => { let walk = node => { if (node.nodeType === 1) { if (/^br$/i.test (node.nodeName)) { node.remove (); } else if (!/^a$/i.test (node.nodeName) && node.childNodes) { for (let n of Array.from (node.childNodes)) { walk (n); } } } else if (node.nodeType === 3) { node.data = " ♥♥ "; } }; return walk; }) ())


"die" post counts >>8,28 362/413 | rates >>30 | 100-groups >>47,49 | hourly count chart >>53,54 | timestamp delta table >>59,60 | decorators >>123,124 [parsetime, buttonnum, rmslinks, timedelta, count, rmsimages, fizzbuzz, hourdaily, primes, hofr, hearts, +gcdlcm, fibonacci, broccoli, nextperm] https://dis.tinychan.net/read/anarchy/1582047203

https://dis.tinychan.net/read/lounge/1619528974#reply_8
(s => {
const pick = data => data [Math.floor (data.length * Math.random ())]
const data = "clit cunt lick lips pant sigh soft trib yuri juicy labia pussy sweet tasty breast gentle nectar nipple thighs tongue lesbian scissor squeeze"
const make = (data, dest) => data.split (' ').reduce ((acc, s) => { if (s.length in acc) { acc [s.length].push (s); } else { acc [s.length] = [s]; } return acc; }, dest)
const yuri = table => s => s.replace (/[a-z]+/ig, match => match.length in table ? pick (table [match.length]) : match)
return yuri (make (data, {})) (s)
}) (document.querySelector ("div#reply_1 > div.body").innerText)

cunt if you are a breast or my nipple: i sweet clit i tasty and attacking my squeeze is not trib sweet to soft nipple. lick nectar in not gentle tongue controlled by government and not the pussy to nectar juicy you disagree lick how pant breast to lips. sigh so you soft. i get juicy & tasty to yuri squeeze lips cunt clit me to soft by juicy breast lesbian of sigh. i lick the tasty to nectar happiness scissor harassment

as a breast: sweet trib lesbian sigh to cunt scissor it is soft not Harassment if it is the tasty lips you say it. Repeating unwanted statements at scissor is a labia definition of Criminal harassment. i sigh put up cunt lick gentle thighs to clit lesbian scissor soft juicy it labia lips my lick tongue. i nipple cunt i tasty and sigh i pant and repeated thighs lesbian to soft squeeze are harassment.

so: if you labia you lick the pussy to say yuri squeeze remember i trib the tasty to nipple happiness and clit includes enjoying a cigarette. if you interfere pant my choosing to pussy you are violating my tasty to nectar happiness.

gentle tongue controlled by government

>>155
Checked

Sometime between >>140 2021-04-23 and https://dis.tinychan.net/read/anarchy/1587122567#reply_217 2021-04-28, https://dis.tinychan.net/read/prog/1582047203 moved to https://dis.tinychan.net/read/anarchy/1582047203 so the code >>124 can be applied at the new location. For some perspective, that thread contains 13 https://dis.tinychan.net/read/anarchy/1582047203/97,103,106,184,190,267,274,322,416,499,530,555,575 code segments, with copies, including the occasional programming content such as the thread hider https://dis.tinychan.net/read/anarchy/1582047203#reply_499 which can easily be applied to this thread by adding its subject to the list passed to the Set. "My boyfriend is obsessed with sniffing my ass?" https://dis.tinychan.net/read/prog/1505230211 which contains 9 code blocks but no programming https://dis.tinychan.net/read/prog/1505230211/557,559,560,561,562,563,566,637,638 is a legitimate /prog/ thread since it ended on 2017-12-20.

>> Array.from (document.querySelectorAll ("div.post > div.body")).filter (e => e.querySelector ("code.precode") != null).map (e => e.parentNode.getAttribute ("id").replace ("reply_", "")).join (",")
"97,103,106,184,190,267,274,322,416,499,530,555,575"

>> Array.from (document.querySelectorAll ("div.post > div.body")).filter (e => e.querySelector ("code.precode") != null).map (e => e.parentNode.getAttribute ("id").replace ("reply_", "")).join (",")
"557,559,560,561,562,563,566,637,638"

"die" post counts >>8,28 362/413 | rates >>30 | 100-groups >>47,49 | hourly count chart >>53,54 | timestamp delta table >>59,60 | decorators >>123,124 [parsetime, buttonnum, rmslinks, timedelta, count, rmsimages, fizzbuzz, hourdaily, primes, hofr, hearts, +gcdlcm, fibonacci, broccoli, nextperm]

>>157
Nobody cares

>>158
You do at the very least.

Caring >>158
Aeris
Reaches
Ecstasy
Softly https://konachan.com/post/show/258409