Hundreds of thousands of words contained in such a small package
12
$begingroup$
If you find that you are crafty you will see the answer's: ___________
CfAaEuDbLcIuHk
DbBaAbEbAiEfIa
JaCaEaIcIcEfIa
JaCaAaEfAaEfIa
BcJkAaEfAaEfIa
EbIkAuEfAaEfIa
EbIkAbEfAaEfIa
DfAqEaEfAaEfIa
IcEfEaAiAaEfIa
IcGfEaIcIcEfIa
EfDiAbEbAqEfIa
AuCuAuDbLkIuHk
hint
The mods might have something to say about how this can be solved.
hint #2
Each pair is a byte-sized portion
enigmatic-puzzle lateral-thinking steganography
asked Apr 4 '18 at 0:32
BuildstartedBuildstarted
1,297422
$endgroup$
|
show 8 more comments
12
$begingroup$
If you find that you are crafty you will see the answer's: ___________
CfAaEuDbLcIuHk
DbBaAbEbAiEfIa
JaCaEaIcIcEfIa
JaCaAaEfAaEfIa
BcJkAaEfAaEfIa
EbIkAuEfAaEfIa
EbIkAbEfAaEfIa
DfAqEaEfAaEfIa
IcEfEaAiAaEfIa
IcGfEaIcIcEfIa
EfDiAbEbAqEfIa
AuCuAuDbLkIuHk
hint
The mods might have something to say about how this can be solved.
hint #2
Each pair is a byte-sized portion
enigmatic-puzzle lateral-thinking steganography
asked Apr 4 '18 at 0:32
BuildstartedBuildstarted
1,297422
$endgroup$
$begingroup$
I feel like these are shortened URL links, but goo.gl and bit.ly don't match, so maybe not...
$endgroup$
– Jakob Lovern
Apr 6 '18 at 19:53
1
$begingroup$
Everything needed to solve the puzzle is contained within the puzzle it just requires some lateral-thinking... i guess i could add that tag.
$endgroup$
– Buildstarted
Apr 6 '18 at 19:58
1
$begingroup$
Yeah they're nothing external.
$endgroup$
– Buildstarted
Apr 6 '18 at 22:32
1
$begingroup$
The first hint may suggest mod like in modular reduction. Just a guess -- haven't looked :-)
$endgroup$
– Carl Löndahl
Apr 7 '18 at 19:23
1
$begingroup$
A few pairs of letters are repeated several times, but I'm not seeing any obvious way to turn the pairs into "bytes" (as in eight binary bits)
$endgroup$
– Dmihawk
May 30 '18 at 4:02
|
show 8 more comments
12
12
12
9
$begingroup$
If you find that you are crafty you will see the answer's: ___________
CfAaEuDbLcIuHk
DbBaAbEbAiEfIa
JaCaEaIcIcEfIa
JaCaAaEfAaEfIa
BcJkAaEfAaEfIa
EbIkAuEfAaEfIa
EbIkAbEfAaEfIa
DfAqEaEfAaEfIa
IcEfEaAiAaEfIa
IcGfEaIcIcEfIa
EfDiAbEbAqEfIa
AuCuAuDbLkIuHk
hint
The mods might have something to say about how this can be solved.
hint #2
Each pair is a byte-sized portion
enigmatic-puzzle lateral-thinking steganography
asked Apr 4 '18 at 0:32
BuildstartedBuildstarted
1,297422
$endgroup$
If you find that you are crafty you will see the answer's: ___________
CfAaEuDbLcIuHk
DbBaAbEbAiEfIa
JaCaEaIcIcEfIa
JaCaAaEfAaEfIa
BcJkAaEfAaEfIa
EbIkAuEfAaEfIa
EbIkAbEfAaEfIa
DfAqEaEfAaEfIa
IcEfEaAiAaEfIa
IcGfEaIcIcEfIa
EfDiAbEbAqEfIa
AuCuAuDbLkIuHk
hint
The mods might have something to say about how this can be solved.
hint #2
Each pair is a byte-sized portion
enigmatic-puzzle lateral-thinking steganography
enigmatic-puzzle lateral-thinking steganography
asked Apr 4 '18 at 0:32
BuildstartedBuildstarted
1,297422
asked Apr 4 '18 at 0:32
BuildstartedBuildstarted
1,297422
edited Apr 7 '18 at 20:05
Buildstarted
asked Apr 4 '18 at 0:32
BuildstartedBuildstarted
1,297422
asked Apr 4 '18 at 0:32
BuildstartedBuildstarted
1,297422
asked Apr 4 '18 at 0:32
BuildstartedBuildstarted
1,297422
1,297422
$begingroup$
I feel like these are shortened URL links, but goo.gl and bit.ly don't match, so maybe not...
$endgroup$
– Jakob Lovern
Apr 6 '18 at 19:53
1
$begingroup$
Everything needed to solve the puzzle is contained within the puzzle it just requires some lateral-thinking... i guess i could add that tag.
$endgroup$
– Buildstarted
Apr 6 '18 at 19:58
1
$begingroup$
Yeah they're nothing external.
$endgroup$
– Buildstarted
Apr 6 '18 at 22:32
1
$begingroup$
The first hint may suggest mod like in modular reduction. Just a guess -- haven't looked :-)
$endgroup$
– Carl Löndahl
Apr 7 '18 at 19:23
1
$begingroup$
A few pairs of letters are repeated several times, but I'm not seeing any obvious way to turn the pairs into "bytes" (as in eight binary bits)
$endgroup$
– Dmihawk
May 30 '18 at 4:02
|
show 8 more comments
$begingroup$
I feel like these are shortened URL links, but goo.gl and bit.ly don't match, so maybe not...
$endgroup$
– Jakob Lovern
Apr 6 '18 at 19:53
1
$begingroup$
Everything needed to solve the puzzle is contained within the puzzle it just requires some lateral-thinking... i guess i could add that tag.
$endgroup$
– Buildstarted
Apr 6 '18 at 19:58
1
$begingroup$
Yeah they're nothing external.
$endgroup$
– Buildstarted
Apr 6 '18 at 22:32
1
$begingroup$
The first hint may suggest mod like in modular reduction. Just a guess -- haven't looked :-)
$endgroup$
– Carl Löndahl
Apr 7 '18 at 19:23
1
$begingroup$
A few pairs of letters are repeated several times, but I'm not seeing any obvious way to turn the pairs into "bytes" (as in eight binary bits)
$endgroup$
– Dmihawk
May 30 '18 at 4:02
$begingroup$
I feel like these are shortened URL links, but goo.gl and bit.ly don't match, so maybe not...
$endgroup$
– Jakob Lovern
Apr 6 '18 at 19:53
$begingroup$
I feel like these are shortened URL links, but goo.gl and bit.ly don't match, so maybe not...
$endgroup$
– Jakob Lovern
Apr 6 '18 at 19:53
1
1
$begingroup$
Everything needed to solve the puzzle is contained within the puzzle it just requires some lateral-thinking... i guess i could add that tag.
$endgroup$
– Buildstarted
Apr 6 '18 at 19:58
$begingroup$
Everything needed to solve the puzzle is contained within the puzzle it just requires some lateral-thinking... i guess i could add that tag.
$endgroup$
– Buildstarted
Apr 6 '18 at 19:58
1
1
$begingroup$
Yeah they're nothing external.
$endgroup$
– Buildstarted
Apr 6 '18 at 22:32
$begingroup$
Yeah they're nothing external.
$endgroup$
– Buildstarted
Apr 6 '18 at 22:32
1
1
$begingroup$
The first hint may suggest mod like in modular reduction. Just a guess -- haven't looked :-)
$endgroup$
– Carl Löndahl
Apr 7 '18 at 19:23
$begingroup$
The first hint may suggest mod like in modular reduction. Just a guess -- haven't looked :-)
$endgroup$
– Carl Löndahl
Apr 7 '18 at 19:23
1
1
$begingroup$
A few pairs of letters are repeated several times, but I'm not seeing any obvious way to turn the pairs into "bytes" (as in eight binary bits)
$endgroup$
– Dmihawk
May 30 '18 at 4:02
$begingroup$
A few pairs of letters are repeated several times, but I'm not seeing any obvious way to turn the pairs into "bytes" (as in eight binary bits)
$endgroup$
– Dmihawk
May 30 '18 at 4:02
|
show 8 more comments
1 Answer
1
active
oldest
votes
-1
$begingroup$
Cornucopia ??
My answer is based on knitting...
'f' for front
'b' for back or behind
'a' for across or around
I'm still not 100% sure of this answer
answered 5 hours ago
KevinKevin
111
New contributor
Kevin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
Do you think you could provide some reasoning?
$endgroup$
– Hugh
5 hours ago
$begingroup$
Yeah some elaboration would be nice.
$endgroup$
– Brandon_J
5 hours ago
$begingroup$
I'm new to this community :) But I would like a yes / no confirmation of my answer from the author before I give my technique. Or are we supposed to collaboratively solve?
$endgroup$
– Kevin
5 hours ago
3
$begingroup$
@Kevin The way answers work here is that you provide both the answer and your reasoning, and then the author tells you whether you're correct or not (though it's worth noting that in this case, he hasn't logged in since August). You also need to put a spoiler tag>!before your answer to hide it, so anyone else who wants to have a go at the puzzle can do so.
$endgroup$
– F1Krazy
5 hours ago
$begingroup$
how do I do the spoiler tag?
$endgroup$
– Kevin
5 hours ago
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "559"
};
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
});
}
});
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
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%2fpuzzling.stackexchange.com%2fquestions%2f63286%2fhundreds-of-thousands-of-words-contained-in-such-a-small-package%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
-1
$begingroup$
Cornucopia ??
My answer is based on knitting...
'f' for front
'b' for back or behind
'a' for across or around
I'm still not 100% sure of this answer
answered 5 hours ago
KevinKevin
111
New contributor
Kevin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
Do you think you could provide some reasoning?
$endgroup$
– Hugh
5 hours ago
$begingroup$
Yeah some elaboration would be nice.
$endgroup$
– Brandon_J
5 hours ago
$begingroup$
I'm new to this community :) But I would like a yes / no confirmation of my answer from the author before I give my technique. Or are we supposed to collaboratively solve?
$endgroup$
– Kevin
5 hours ago
3
$begingroup$
@Kevin The way answers work here is that you provide both the answer and your reasoning, and then the author tells you whether you're correct or not (though it's worth noting that in this case, he hasn't logged in since August). You also need to put a spoiler tag>!before your answer to hide it, so anyone else who wants to have a go at the puzzle can do so.
$endgroup$
– F1Krazy
5 hours ago
$begingroup$
how do I do the spoiler tag?
$endgroup$
– Kevin
5 hours ago
add a comment |
-1
$begingroup$
Cornucopia ??
My answer is based on knitting...
'f' for front
'b' for back or behind
'a' for across or around
I'm still not 100% sure of this answer
answered 5 hours ago
KevinKevin
111
New contributor
Kevin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
Do you think you could provide some reasoning?
$endgroup$
– Hugh
5 hours ago
$begingroup$
Yeah some elaboration would be nice.
$endgroup$
– Brandon_J
5 hours ago
$begingroup$
I'm new to this community :) But I would like a yes / no confirmation of my answer from the author before I give my technique. Or are we supposed to collaboratively solve?
$endgroup$
– Kevin
5 hours ago
3
$begingroup$
@Kevin The way answers work here is that you provide both the answer and your reasoning, and then the author tells you whether you're correct or not (though it's worth noting that in this case, he hasn't logged in since August). You also need to put a spoiler tag>!before your answer to hide it, so anyone else who wants to have a go at the puzzle can do so.
$endgroup$
– F1Krazy
5 hours ago
$begingroup$
how do I do the spoiler tag?
$endgroup$
– Kevin
5 hours ago
add a comment |
-1
-1
-1
$begingroup$
Cornucopia ??
My answer is based on knitting...
'f' for front
'b' for back or behind
'a' for across or around
I'm still not 100% sure of this answer
answered 5 hours ago
KevinKevin
111
New contributor
Kevin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
Cornucopia ??
My answer is based on knitting...
'f' for front
'b' for back or behind
'a' for across or around
I'm still not 100% sure of this answer
answered 5 hours ago
KevinKevin
111
New contributor
Kevin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 5 hours ago
answered 5 hours ago
KevinKevin
111
New contributor
Kevin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 5 hours ago
KevinKevin
111
answered 5 hours ago
KevinKevin
111
111
New contributor
Kevin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Kevin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Kevin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$begingroup$
Do you think you could provide some reasoning?
$endgroup$
– Hugh
5 hours ago
$begingroup$
Yeah some elaboration would be nice.
$endgroup$
– Brandon_J
5 hours ago
$begingroup$
I'm new to this community :) But I would like a yes / no confirmation of my answer from the author before I give my technique. Or are we supposed to collaboratively solve?
$endgroup$
– Kevin
5 hours ago
3
$begingroup$
@Kevin The way answers work here is that you provide both the answer and your reasoning, and then the author tells you whether you're correct or not (though it's worth noting that in this case, he hasn't logged in since August). You also need to put a spoiler tag>!before your answer to hide it, so anyone else who wants to have a go at the puzzle can do so.
$endgroup$
– F1Krazy
5 hours ago
$begingroup$
how do I do the spoiler tag?
$endgroup$
– Kevin
5 hours ago
add a comment |
$begingroup$
Do you think you could provide some reasoning?
$endgroup$
– Hugh
5 hours ago
$begingroup$
Yeah some elaboration would be nice.
$endgroup$
– Brandon_J
5 hours ago
$begingroup$
I'm new to this community :) But I would like a yes / no confirmation of my answer from the author before I give my technique. Or are we supposed to collaboratively solve?
$endgroup$
– Kevin
5 hours ago
3
$begingroup$
@Kevin The way answers work here is that you provide both the answer and your reasoning, and then the author tells you whether you're correct or not (though it's worth noting that in this case, he hasn't logged in since August). You also need to put a spoiler tag>!before your answer to hide it, so anyone else who wants to have a go at the puzzle can do so.
$endgroup$
– F1Krazy
5 hours ago
$begingroup$
how do I do the spoiler tag?
$endgroup$
– Kevin
5 hours ago
$begingroup$
Do you think you could provide some reasoning?
$endgroup$
– Hugh
5 hours ago
$begingroup$
Do you think you could provide some reasoning?
$endgroup$
– Hugh
5 hours ago
$begingroup$
Yeah some elaboration would be nice.
$endgroup$
– Brandon_J
5 hours ago
$begingroup$
Yeah some elaboration would be nice.
$endgroup$
– Brandon_J
5 hours ago
$begingroup$
I'm new to this community :) But I would like a yes / no confirmation of my answer from the author before I give my technique. Or are we supposed to collaboratively solve?
$endgroup$
– Kevin
5 hours ago
$begingroup$
I'm new to this community :) But I would like a yes / no confirmation of my answer from the author before I give my technique. Or are we supposed to collaboratively solve?
$endgroup$
– Kevin
5 hours ago
3
3
$begingroup$
@Kevin The way answers work here is that you provide both the answer and your reasoning, and then the author tells you whether you're correct or not (though it's worth noting that in this case, he hasn't logged in since August). You also need to put a spoiler tag
>! before your answer to hide it, so anyone else who wants to have a go at the puzzle can do so.$endgroup$
– F1Krazy
5 hours ago
$begingroup$
@Kevin The way answers work here is that you provide both the answer and your reasoning, and then the author tells you whether you're correct or not (though it's worth noting that in this case, he hasn't logged in since August). You also need to put a spoiler tag
>! before your answer to hide it, so anyone else who wants to have a go at the puzzle can do so.$endgroup$
– F1Krazy
5 hours ago
$begingroup$
how do I do the spoiler tag?
$endgroup$
– Kevin
5 hours ago
$begingroup$
how do I do the spoiler tag?
$endgroup$
– Kevin
5 hours ago
add a comment |
draft saved
draft discarded
Thanks for contributing an answer to Puzzling 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.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
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%2fpuzzling.stackexchange.com%2fquestions%2f63286%2fhundreds-of-thousands-of-words-contained-in-such-a-small-package%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');
});
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');
});
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');
});
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
$begingroup$
I feel like these are shortened URL links, but goo.gl and bit.ly don't match, so maybe not...
$endgroup$
– Jakob Lovern
Apr 6 '18 at 19:53
1
$begingroup$
Everything needed to solve the puzzle is contained within the puzzle it just requires some lateral-thinking... i guess i could add that tag.
$endgroup$
– Buildstarted
Apr 6 '18 at 19:58
1
$begingroup$
Yeah they're nothing external.
$endgroup$
– Buildstarted
Apr 6 '18 at 22:32
1
$begingroup$
The first hint may suggest mod like in modular reduction. Just a guess -- haven't looked :-)
$endgroup$
– Carl Löndahl
Apr 7 '18 at 19:23
1
$begingroup$
A few pairs of letters are repeated several times, but I'm not seeing any obvious way to turn the pairs into "bytes" (as in eight binary bits)
$endgroup$
– Dmihawk
May 30 '18 at 4:02