Humpty dumpty dumpity dee

Don't fall for the fud. They've already fixed it and made a breakthrough in computer science.

Attached: 1598002118107.png (680x383, 518.06K)

NEVER SELLING

Hurry up and go up so I can dump it already

lmao who even bought this garbage?
as if it wasn't so obvious after pajeets brigaded biz with forced and badly ripped off memes several times now
as if it wasn't so obvious when this shitcoin would dump EVERY SINGLE TIME
as if it wasn't so obvious when gilles would keep cashing out his rlc for sports cars
as if it wasn't so obvious when these retards have 0 adoption after 5 version releases
>b-but we're in the adoption phase now
NOTHING HAPPENING AS PER USUAL KEK
S AND H

FUD

LARP

LARP

FUD & LARP

Stop counter LARPing you faggot

FUD

FUD & LARP

Attached: rlc_card_with_barrels.png (1416x672, 1.5M)

Pathetic bagholder.

Have been in this since 0.3$. Sou yes, my light bags are getting lighter by the day. Nice FUD btw. Oh come on guys, why are you even in this thread FUDing if you don't care? If you didn't care you'd literally not even click it. BUT YOU DO. And you aren't even a lurker laughing at people who are stupid, you are willingly participating in something you "think" will fails. But you actually know it'll succeed, you stupid sand nigger

NSMDO NSMDO NSMDO NSMDO

Attached: rlc_fren.png (819x827, 58.78K)

Why is it larp? I honestly don't know what a boolean is. Tried understanding it on the wikipedia article but it's all complicated math and stuff I can't understand. Why would I had to know it? That's like asking for quantum physics or something I haven't really studied, you need a PHD for that.

Because it's fucking FUD. The "boolean problem" is literal FUD. If programmed for 2 months you'd realize that they're literally putting words together that make them sound "smart" as if they were computer programmers. They might be, but trust me when I tell you that a "boolean problem" doesn't exist. It never has and it never will.

A boolean is a value that can be 1 or 0 (true or false). It is used in programming so that you can have variables which tell you if something IS or IS NOT.
So for instance (simple retarded program)

x = true
if x == false:
DO SOMETHING IF X IS FALSE
else x == true:
DO SOMETHING IF X IS TRUE (this will be executed, because we set x to true in the first line)

And yes, I actually am a programmer, I actually know this is retarded FUD and LARPs to get more of this GEM.

Attached: comfy_winter.png (1084x695, 510.74K)

>boolean
>complicated math
lmfao nice larp kek

So it's really FUD? Fuck it sounded real, I checked the SATA ports on my computer cause I had a worker running and I thought the metadatas were leaking I didn't want my computer to get all wet.

Also look at my thread ( ) for like 2 weeks ago, we destroyed every single attempt at FUD

Attached: rlc_office.png (800x600, 778.11K)

FucKING LARPing LIAR
en.wikipedia.org/wiki/Boolean_satisfiability_problem

Are you retarded ? The boolean problem is the boolean satisfiability problem (en.wikipedia.org/wiki/Boolean_satisfiability_problem) and is not solvable in P, but the POCO protocol assumes it is. This is literally proven to be not solvable in polynomial time for larger N, where N here is the number of workers. If you didn't know this, you shouldn't be commenting. Kek, imagine thinking the boolean problem is about what a Boolean is, how new are you ?

user, I don't know how to tell you this, but it literally didn't dump this time. I made 4x on the first pump from dumb chico followers and now have 10k barrels sitting scot-free
I'm really impressed it hasn't actually dumped back to under $1

Attached: sip.png (749x749, 644.33K)

Wait a moment. What you're telling me makes no sense, you're the one larping. How can x = true? x = x and true = true. Also I've never seen two equal symbols together at school, how does "==" makes any sense? equals equals equal? Stop trolling I really need to know an answer

So what's the claim as to how this confounds the project at hand?

The claim is that I pulled this out of my ass. Has nothing to do with iExec. I'm just bored.
Or: everything I just said is a lie.
You decide.

Look at this guy, LARPing again

>checked SATA ports
>metadatas leaking
>wet computer

Do you even see how retarded this sounds. It's like looking at someone programming in a movie.

Wow, just wow.
"It asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE."
This has nothing to do with iExec RLC and is a problem that falls into the category of discrete mathematics.

POCO doesn't have shit to do with the Boolean satisfiability problem you stupid LARP, oh god. The FUD is getting dumber by the millisecond.

Look at me you fucks... Let's take this formula for example

A OR B

Can we somehow give the value A and the value B a boolean value so that the end result is TRUE (or 1)? Yes, if we set the value A to TRUE (or 1) the full thing will be TRUE, since there is a OR in between the two. We could also set B to TRUE and it would accomplish the same thing... So all of the below answers do the trick

TRUE or FALSE = TRUE
FALSE or TRUE = TRUE
TRUE or TRUE = TRUE
But this one doesn't
FALSE or FALSE = FALSE

This is what the Boolean satisfiability problem is... AND IT HAS NOTHING TO DO WITH iExec RLC

Because x = true means "X is equal to true" in computer programming. x == true means "Is x equal to true". Damn, you must be baiting me with this stupid shit... Look i'll give you a link to a python tutorial to prove I'm right (tutorialspoint.com/python/python_decision_making.htm look under the "Single Statement Suites" section)

FAKE AND GAY LARPS. TRYING TO FUD A GEM

Attached: amazexec.jpg (728x455, 64.74K)

== Is Boolean

Correct, everything you just said before this post is a lie and you're just a LARP trying to buy more of this because you know that people are so stupid that you would believe your wannabe programmer glueing random word together LARP

Attached: eat_my_ass_linky_fedak.png (545x608, 382.38K)

Stop acting like the boolean problem never existed. it did but they solved it. so it's all good. You're losing credibility with your lies.

> POCO doesn't have shit to do with the Boolean satisfiability problem you stupid LARP, oh god
Let me put this in very simple words, for a simpleton faggot like you

In computational complexity theory, the quantified Boolean formula problem (QBF) is a generalization of the Boolean satisfiability problem in which both existential quantifiers and universal quantifiers can be applied to each variable - which represents a subset of the poco protocol in the cardinatlity of workers and machine verified tasks. Put another way, POCO asks whether a quantified sentential form over a set of Boolean variables is true or false. For example, the following is an instance of QBF:

POCO-QBF is the canonical complete problem for PSPACE, the class of problems solvable by a deterministic or nondeterministic Turing machine in polynomial space and unlimited time. Given the formula in the form of an abstract syntax tree, the problem can be solved easily by a set of mutually recursive procedures which evaluate the formula. Such an algorithm uses space proportional to the height of the tree, which is linear in the worst case, but uses time exponential in the number of quantifiers.

Provided that MA ⊊ PSPACE, which is widely believed, QBF cannot be solved, nor can a given solution even be verified, in either deterministic or probabilistic polynomial time (in fact, unlike the satisfiability problem, there's no known way to specify a solution succinctly). It can be solved using an alternating Turing machine in linear time, since AP = PSPACE, where AP is the class of problems alternating machines can solve in polynomial time.

When the seminal result IP = PSPACE was shown (see interactive proof system), it was done by exhibiting an interactive proof system that could solve QBF by solving a particular arithmetization of the problem.