Bitcoin Forum
May 22, 2024, 05:25:11 AM *
News: Latest Bitcoin Core release: 27.0 [Torrent]
 
  Home Help Search Login Register More  
  Show Posts
Pages: [1]
1  Alternate cryptocurrencies / Announcements (Altcoins) / Re: XEL - The Codable Decentralized Supercomputer - XEL.ORG on: April 11, 2021, 02:36:02 AM
...

Ad 2) It can be used for search strategies (like brute force) that can be solved by random guessing.
Ad 3) It works for some special cases of Monte Carlo Methods, namely those that can be solved by simple random guessing  Wink

Explanation: You can't trust any computation node in the network. Therefore you must verify each (partial) result from every single computation node. Furthermore the XEL network needs to determine who of the workers gets rewards. If you can't verify the (partial) results the workers best strategy would be to cheat (because it is less work).

For that reason the only meaningful application that remains is solving problems by random guessing, for which you can easily verify if the result is correct.
2  Alternate cryptocurrencies / Announcements (Altcoins) / Re: XEL - The Codable Decentralized Supercomputer - XEL.ORG on: March 01, 2021, 03:17:58 PM
Ismail, what makes think this project is aimed at resolution of intractable problems by guessing? Huh
Maybe I misunderstood something.
What are the types of problems the project aims to solve? You mentioned computer science class in universities, what class could that be?

I wouldn't say I have really good understanding of XEL project's capabilities, but I would put it this way: it can work on tasks which can be programmed in ePL language, which is a bit simplified variant of either Java or C-like language (https://docs.xel.org/learn-epl.html). So basically, if I understand it correctly, if you can code a task on Java, you can probably run it on XEL network using all the computers connected to it, which provide you a computational resource.

However, when speaking about possibility to use the project as a part of training program in computer science class, I meant the project itself, not its capabilities (though they could be used too, if project is polished good enough, and all the necessary features added). I mean something like a distributed computing class, where students can take the code of a computation client in https://github.com/xel-software, examine that, learn it, add missing functionality, fix bugs, and maintain a XEL network. This could provide them with first-hand experience with a working distributed computing solution.

First, ePL doesn't allow for any data structure nor does it has objects. Java is object oriented. You can't compare it with ePL.
Second, the solution of a problem you want to solve by XEL has to be encoded in such a way that one can verify if a given random number is a solution of the problem. XEL works by parallel random guessing, that's how it is.
Third, if you want to use ePL to solve a problem you will most likely need an intermediate step to encode the problem in ePL (for the first two reasons).

I have the impression that no one of the people who actually hold some XEL coins have the slightest understanding of XEL or/and computer science. This is another reason why I think that the project is lost forever without any chance to be revived.
3  Alternate cryptocurrencies / Announcements (Altcoins) / Re: XEL - The Codable Decentralized Supercomputer - XEL.ORG on: February 26, 2021, 08:04:48 PM
Ismail, what makes think this project is aimed at resolution of intractable problems by guessing? Huh
Maybe I misunderstood something.
What are the types of problems the project aims to solve? You mentioned computer science class in universities, what class could that be?
4  Alternate cryptocurrencies / Announcements (Altcoins) / Re: XEL - The Codable Decentralized Supercomputer - XEL.ORG on: February 26, 2021, 01:33:55 PM
In my opinion there is basically no chance that this project will be revived.

From the point of view of computer science (CS), there is no use for this approach. In theoretical CS we learn how to classify problems in terms of their computational complexity (P, NP, EXP, NEXP,...). We think that some problems in NP are intractable (but we don't know for sure).
Tractable problems (the ones in P) can be solved in reasonable time, while intractable problems cannot be solved in reasonable time in general, no matter how much computational power you throw at those problems (not considering quantum computing). In general there is no hope in trying to solve an intractable problem by guessing, which is what this project is aiming at.
In short: From the point of view of computer science, this is a hopeless approach.
Pages: [1]
Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!