It looks like you're using an Ad Blocker.
Please white-list or disable AboveTopSecret.com in your ad-blocking tool.
Some features of ATS will be disabled while you continue to use an ad-blocker.
Byzantine fault tolerance is a sub-field of fault tolerance research inspired by the Byzantine Generals' Problem, which is a generalized version of the Two Generals' Problem.
The objective of Byzantine fault tolerance is to be able to defend against Byzantine failures, in which components of a system fail in arbitrary ways (i.e., not just by stopping or crashing but by processing requests incorrectly, corrupting their local state, and/or producing incorrect or inconsistent outputs). Correctly functioning components of a Byzantine fault tolerant system will be able to correctly provide the system's service assuming there are not too many Byzantine faulty components.
A hash function is any algorithm that maps data of arbitrary length to data of a fixed length. The values returned by a hash function are called hash values, hash codes, hash sums, checksums or simply hashes. Recent development of internet payment networks also uses a form of 'hashing' for checksums, and has brought additional attention to the term.
originally posted by: ScientiaFortisDefendit
I am interested in how you would use this method for voting. I am no computer scientist, but from the voter side of the equation, would there not need to be a very secure database of all eligible voters that could not be gamed? Let's say that each voter would only get one vote via this methodology, which could be done, but what is to stop people from manufacturing fraudulent voters/use dead voters, etc. The current state databases are most certainly inaccurate.
originally posted by: kwakakev
With all the electricity and processing already going on, I do question just how valid this mathematical lottery process is for dealing with the problems of transaction pools? The idea of a transaction chain sounds good, but setting random functions just to burn up processing power looks quite wasteful of processing resources.
I do question just how valid this mathematical lottery process is for dealing with the problems of transaction pools
originally posted by: kwakakev
a reply to: XPLodER
To quickly recap and confirm, a block chain is what is being mined in the bitcoin process,
If this is right then what encryption / redundancy / double checking options exist for the transactions chain?
There is a chance here to take advantage of a lot of processing and strengthen the system.
There does appear to be a random feature from the bitcoin mining process, could this lottery turn into some kind of transaction coin for the bit coin?
I can handle PHP but there is a lot I do not know about distributing computing and the challenges of it. The future of computing does look like it is still in start up stages, kinda does make you wonder just how much of a difference optimizing CPU distribution on the die can make.
How much longer until not just having solar cells on your house, but millions of CPU's as well. To these ends you will need solid code, not just something that you hope to out process with.
With the bitcoin limit being fixed it is important to not have any long term solutions based directly on their mining. With what is happening in the stock market and micro trades there does look to be a growing load with bitcoin and similar systems.
How will the currency go when there are millions of transactions every second?
As for the pool, one option is hand out tickets as they walk in then the random function becomes simple again. But this does bring along a centralization issue.
Do you know what part of the current system is responsible for setting the random puzzle?
Is this part also responsible for reading the results and assigning a transaction chain?
It is good to chat to you again too.