How specific are ASIC's design? Can they single hash SHA256?
I understand that Bitcoin's ASICs are a highly optimized piece of equipment and, therefore, are also very specific.
My question: are they able to do a single (or triple?) SHA-256 hash at all? And, if so, how competitively would they be with versus a GPU?
mining-hardware hash asic cryptography
New contributor
add a comment |
I understand that Bitcoin's ASICs are a highly optimized piece of equipment and, therefore, are also very specific.
My question: are they able to do a single (or triple?) SHA-256 hash at all? And, if so, how competitively would they be with versus a GPU?
mining-hardware hash asic cryptography
New contributor
add a comment |
I understand that Bitcoin's ASICs are a highly optimized piece of equipment and, therefore, are also very specific.
My question: are they able to do a single (or triple?) SHA-256 hash at all? And, if so, how competitively would they be with versus a GPU?
mining-hardware hash asic cryptography
New contributor
I understand that Bitcoin's ASICs are a highly optimized piece of equipment and, therefore, are also very specific.
My question: are they able to do a single (or triple?) SHA-256 hash at all? And, if so, how competitively would they be with versus a GPU?
mining-hardware hash asic cryptography
mining-hardware hash asic cryptography
New contributor
New contributor
New contributor
asked 1 hour ago
Tiago Loriato SimõesTiago Loriato Simões
61
61
New contributor
New contributor
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
A Bitcoin mining ASIC:
- does not attempt to complete a single hash, rather fragments of two SHA256 compression rounds which is then compared to a target, the result is never returned
- can not accept arbitrary information that is not in the form of a partial SHA256 compression round
So in terms of competitiveness, a CPU can actually complete a SHA256 hash, a mining ASIC can not, which I suppose puts it ahead in this arbitrary race.
add a comment |
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "308"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Tiago Loriato Simões is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fbitcoin.stackexchange.com%2fquestions%2f84616%2fhow-specific-are-asics-design-can-they-single-hash-sha256%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
A Bitcoin mining ASIC:
- does not attempt to complete a single hash, rather fragments of two SHA256 compression rounds which is then compared to a target, the result is never returned
- can not accept arbitrary information that is not in the form of a partial SHA256 compression round
So in terms of competitiveness, a CPU can actually complete a SHA256 hash, a mining ASIC can not, which I suppose puts it ahead in this arbitrary race.
add a comment |
A Bitcoin mining ASIC:
- does not attempt to complete a single hash, rather fragments of two SHA256 compression rounds which is then compared to a target, the result is never returned
- can not accept arbitrary information that is not in the form of a partial SHA256 compression round
So in terms of competitiveness, a CPU can actually complete a SHA256 hash, a mining ASIC can not, which I suppose puts it ahead in this arbitrary race.
add a comment |
A Bitcoin mining ASIC:
- does not attempt to complete a single hash, rather fragments of two SHA256 compression rounds which is then compared to a target, the result is never returned
- can not accept arbitrary information that is not in the form of a partial SHA256 compression round
So in terms of competitiveness, a CPU can actually complete a SHA256 hash, a mining ASIC can not, which I suppose puts it ahead in this arbitrary race.
A Bitcoin mining ASIC:
- does not attempt to complete a single hash, rather fragments of two SHA256 compression rounds which is then compared to a target, the result is never returned
- can not accept arbitrary information that is not in the form of a partial SHA256 compression round
So in terms of competitiveness, a CPU can actually complete a SHA256 hash, a mining ASIC can not, which I suppose puts it ahead in this arbitrary race.
answered 1 hour ago
AnonymousAnonymous
8,78211028
8,78211028
add a comment |
add a comment |
Tiago Loriato Simões is a new contributor. Be nice, and check out our Code of Conduct.
Tiago Loriato Simões is a new contributor. Be nice, and check out our Code of Conduct.
Tiago Loriato Simões is a new contributor. Be nice, and check out our Code of Conduct.
Tiago Loriato Simões is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Bitcoin Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fbitcoin.stackexchange.com%2fquestions%2f84616%2fhow-specific-are-asics-design-can-they-single-hash-sha256%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown