Make a longer lenguage program












8












$begingroup$


Lenguage is a brainfuck dialect that is notorious for breaking source restriction challenges. That is because Lenguage cares only about the length of it's source and not the contents.



First, the length of the program is calculated. Then, said length is converted to binary and left-padded by zeroes to a multiple of 3. The resulting binary string is split into chunks of 3 bits each of which is translated into a brainfuck command as such:



000 -> +

001 -> -

010 -> >

011 -> <

100 -> .

101 -> ,

110 -> [

111 -> ]


Finally the program is run as brainfuck1.



From here the challenge is pretty simple, write a lenguage program that takes no input and produces an output consisting of one byte repeated $n$ times, where $n$ is strictly greater than the length of your program.



Answers will be scored in bytes with fewer bytes being better.



Here's a hacky program to calculate lenguage from brainfuck




1: For this challenge we will use wrapping cells and a non-wrapping tape.






code-golf quine brainfuck







share|improve this question









$endgroup$












  • $begingroup$
    +[.] Do I win? :P
    $endgroup$
    – Quintec
    3 hours ago










  • $begingroup$
    Perhaps it might be more interesting to score on the length of the output?
    $endgroup$
    – Jo King
    3 hours ago










  • $begingroup$
    @JoKing That's a good idea. Unfortunately it appears to be a bit late for that.
    $endgroup$
    – TRITICIMAGVS
    2 hours ago










  • $begingroup$
    @JoKing Actually since you are the only answerer do you mind if I change it?
    $endgroup$
    – TRITICIMAGVS
    2 hours ago










  • $begingroup$
    sure, i'll change my answer up
    $endgroup$
    – Jo King
    2 hours ago
















8












$begingroup$


Lenguage is a brainfuck dialect that is notorious for breaking source restriction challenges. That is because Lenguage cares only about the length of it's source and not the contents.



First, the length of the program is calculated. Then, said length is converted to binary and left-padded by zeroes to a multiple of 3. The resulting binary string is split into chunks of 3 bits each of which is translated into a brainfuck command as such:



000 -> +

001 -> -

010 -> >

011 -> <

100 -> .

101 -> ,

110 -> [

111 -> ]


Finally the program is run as brainfuck1.



From here the challenge is pretty simple, write a lenguage program that takes no input and produces an output consisting of one byte repeated $n$ times, where $n$ is strictly greater than the length of your program.



Answers will be scored in bytes with fewer bytes being better.



Here's a hacky program to calculate lenguage from brainfuck




1: For this challenge we will use wrapping cells and a non-wrapping tape.






code-golf quine brainfuck







share|improve this question









$endgroup$












  • $begingroup$
    +[.] Do I win? :P
    $endgroup$
    – Quintec
    3 hours ago










  • $begingroup$
    Perhaps it might be more interesting to score on the length of the output?
    $endgroup$
    – Jo King
    3 hours ago










  • $begingroup$
    @JoKing That's a good idea. Unfortunately it appears to be a bit late for that.
    $endgroup$
    – TRITICIMAGVS
    2 hours ago










  • $begingroup$
    @JoKing Actually since you are the only answerer do you mind if I change it?
    $endgroup$
    – TRITICIMAGVS
    2 hours ago










  • $begingroup$
    sure, i'll change my answer up
    $endgroup$
    – Jo King
    2 hours ago














8












8








8


1



$begingroup$


Lenguage is a brainfuck dialect that is notorious for breaking source restriction challenges. That is because Lenguage cares only about the length of it's source and not the contents.



First, the length of the program is calculated. Then, said length is converted to binary and left-padded by zeroes to a multiple of 3. The resulting binary string is split into chunks of 3 bits each of which is translated into a brainfuck command as such:



000 -> +

001 -> -

010 -> >

011 -> <

100 -> .

101 -> ,

110 -> [

111 -> ]


Finally the program is run as brainfuck1.



From here the challenge is pretty simple, write a lenguage program that takes no input and produces an output consisting of one byte repeated $n$ times, where $n$ is strictly greater than the length of your program.



Answers will be scored in bytes with fewer bytes being better.



Here's a hacky program to calculate lenguage from brainfuck




1: For this challenge we will use wrapping cells and a non-wrapping tape.






code-golf quine brainfuck







share|improve this question









$endgroup$




Lenguage is a brainfuck dialect that is notorious for breaking source restriction challenges. That is because Lenguage cares only about the length of it's source and not the contents.



First, the length of the program is calculated. Then, said length is converted to binary and left-padded by zeroes to a multiple of 3. The resulting binary string is split into chunks of 3 bits each of which is translated into a brainfuck command as such:



000 -> +

001 -> -

010 -> >

011 -> <

100 -> .

101 -> ,

110 -> [

111 -> ]


Finally the program is run as brainfuck1.



From here the challenge is pretty simple, write a lenguage program that takes no input and produces an output consisting of one byte repeated $n$ times, where $n$ is strictly greater than the length of your program.



Answers will be scored in bytes with fewer bytes being better.



Here's a hacky program to calculate lenguage from brainfuck




1: For this challenge we will use wrapping cells and a non-wrapping tape.






code-golf quine brainfuck




code-golf quine brainfuck






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked 5 hours ago









TRITICIMAGVSTRITICIMAGVS

34.2k10156366




34.2k10156366












  • $begingroup$
    +[.] Do I win? :P
    $endgroup$
    – Quintec
    3 hours ago










  • $begingroup$
    Perhaps it might be more interesting to score on the length of the output?
    $endgroup$
    – Jo King
    3 hours ago










  • $begingroup$
    @JoKing That's a good idea. Unfortunately it appears to be a bit late for that.
    $endgroup$
    – TRITICIMAGVS
    2 hours ago










  • $begingroup$
    @JoKing Actually since you are the only answerer do you mind if I change it?
    $endgroup$
    – TRITICIMAGVS
    2 hours ago










  • $begingroup$
    sure, i'll change my answer up
    $endgroup$
    – Jo King
    2 hours ago


















  • $begingroup$
    +[.] Do I win? :P
    $endgroup$
    – Quintec
    3 hours ago










  • $begingroup$
    Perhaps it might be more interesting to score on the length of the output?
    $endgroup$
    – Jo King
    3 hours ago










  • $begingroup$
    @JoKing That's a good idea. Unfortunately it appears to be a bit late for that.
    $endgroup$
    – TRITICIMAGVS
    2 hours ago










  • $begingroup$
    @JoKing Actually since you are the only answerer do you mind if I change it?
    $endgroup$
    – TRITICIMAGVS
    2 hours ago










  • $begingroup$
    sure, i'll change my answer up
    $endgroup$
    – Jo King
    2 hours ago
















$begingroup$
+[.] Do I win? :P
$endgroup$
– Quintec
3 hours ago




$begingroup$
+[.] Do I win? :P
$endgroup$
– Quintec
3 hours ago












$begingroup$
Perhaps it might be more interesting to score on the length of the output?
$endgroup$
– Jo King
3 hours ago




$begingroup$
Perhaps it might be more interesting to score on the length of the output?
$endgroup$
– Jo King
3 hours ago












$begingroup$
@JoKing That's a good idea. Unfortunately it appears to be a bit late for that.
$endgroup$
– TRITICIMAGVS
2 hours ago




$begingroup$
@JoKing That's a good idea. Unfortunately it appears to be a bit late for that.
$endgroup$
– TRITICIMAGVS
2 hours ago












$begingroup$
@JoKing Actually since you are the only answerer do you mind if I change it?
$endgroup$
– TRITICIMAGVS
2 hours ago




$begingroup$
@JoKing Actually since you are the only answerer do you mind if I change it?
$endgroup$
– TRITICIMAGVS
2 hours ago












$begingroup$
sure, i'll change my answer up
$endgroup$
– Jo King
2 hours ago




$begingroup$
sure, i'll change my answer up
$endgroup$
– Jo King
2 hours ago










1 Answer
1






active

oldest

votes


















4












$begingroup$

8437495638205698686671 bytes



This translates to the brainfuck program:



-[>>[>]+[->[>]+.[<]+<]<-]


Which prints exactly $231584178474632390847141970017375815706539969331281128078915168015826259279614$ SOH bytes.



This is calculated by the function



f(n)=2*f(n-1)+n

f(0)=0


(submission pending change from code-golf to the shortest output)



664613997892457936451903530140172168 bytes



The program is $190096884071251415869242504183037647$ bytes long, which translates to the brainfuck program:



----[>+++++<--]>[>>[>]+[->[>]+.[<]+<]<-]


This is calculated by the function



f(n)=2*f(n-1)+n

f(0)=0


With an input of 118.






share|improve this answer











$endgroup$













    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.ifUsing("editor", function () {
    StackExchange.using("externalEditor", function () {
    StackExchange.using("snippets", function () {
    StackExchange.snippets.init();
    });
    });
    }, "code-snippets");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "200"
    };
    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
    },
    onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f179325%2fmake-a-longer-lenguage-program%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









    4












    $begingroup$

    8437495638205698686671 bytes



    This translates to the brainfuck program:



    -[>>[>]+[->[>]+.[<]+<]<-]


    Which prints exactly $231584178474632390847141970017375815706539969331281128078915168015826259279614$ SOH bytes.



    This is calculated by the function



    f(n)=2*f(n-1)+n
    
f(0)=0


    (submission pending change from code-golf to the shortest output)



    664613997892457936451903530140172168 bytes



    The program is $190096884071251415869242504183037647$ bytes long, which translates to the brainfuck program:



    ----[>+++++<--]>[>>[>]+[->[>]+.[<]+<]<-]


    This is calculated by the function



    f(n)=2*f(n-1)+n
    
f(0)=0


    With an input of 118.






    share|improve this answer











    $endgroup$


















      4












      $begingroup$

      8437495638205698686671 bytes



      This translates to the brainfuck program:



      -[>>[>]+[->[>]+.[<]+<]<-]


      Which prints exactly $231584178474632390847141970017375815706539969331281128078915168015826259279614$ SOH bytes.



      This is calculated by the function



      f(n)=2*f(n-1)+n
      
f(0)=0


      (submission pending change from code-golf to the shortest output)



      664613997892457936451903530140172168 bytes



      The program is $190096884071251415869242504183037647$ bytes long, which translates to the brainfuck program:



      ----[>+++++<--]>[>>[>]+[->[>]+.[<]+<]<-]


      This is calculated by the function



      f(n)=2*f(n-1)+n
      
f(0)=0


      With an input of 118.






      share|improve this answer











      $endgroup$
















        4












        4








        4





        $begingroup$

        8437495638205698686671 bytes



        This translates to the brainfuck program:



        -[>>[>]+[->[>]+.[<]+<]<-]


        Which prints exactly $231584178474632390847141970017375815706539969331281128078915168015826259279614$ SOH bytes.



        This is calculated by the function



        f(n)=2*f(n-1)+n
        
f(0)=0


        (submission pending change from code-golf to the shortest output)



        664613997892457936451903530140172168 bytes



        The program is $190096884071251415869242504183037647$ bytes long, which translates to the brainfuck program:



        ----[>+++++<--]>[>>[>]+[->[>]+.[<]+<]<-]


        This is calculated by the function



        f(n)=2*f(n-1)+n
        
f(0)=0


        With an input of 118.






        share|improve this answer











        $endgroup$



        8437495638205698686671 bytes



        This translates to the brainfuck program:



        -[>>[>]+[->[>]+.[<]+<]<-]


        Which prints exactly $231584178474632390847141970017375815706539969331281128078915168015826259279614$ SOH bytes.



        This is calculated by the function



        f(n)=2*f(n-1)+n
        
f(0)=0


        (submission pending change from code-golf to the shortest output)



        664613997892457936451903530140172168 bytes



        The program is $190096884071251415869242504183037647$ bytes long, which translates to the brainfuck program:



        ----[>+++++<--]>[>>[>]+[->[>]+.[<]+<]<-]


        This is calculated by the function



        f(n)=2*f(n-1)+n
        
f(0)=0


        With an input of 118.







        share|improve this answer














        share|improve this answer



        share|improve this answer








        edited 1 hour ago

























        answered 2 hours ago









        Jo KingJo King

        21.9k249113




        21.9k249113






























            draft saved

            draft discarded




















































            If this is an answer to a challenge…




            • …Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.


            • …Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one.
              Explanations of your answer make it more interesting to read and are very much encouraged.


            • …Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.



            More generally…




            • …Please make sure to answer the question and provide sufficient detail.


            • …Avoid asking for help, clarification or responding to other answers (use comments instead).





            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f179325%2fmake-a-longer-lenguage-program%23new-answer', 'question_page');
            }
            );

            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







            -

            Popular posts from this blog

            Accessing regular linux commands in Huawei's Dopra Linux

            Image
            4 Backstory: I have a Huawei HG8245 router in my house and I want to change the default username/password. I've tried following this guide but the config file always gets reset. My ISP isn't helping either so I'm looking for other ways to accomplish this. The router has telnet access so this seems like a way to change the credentials. The first shell I gain access to looks like this: WAP> Pressing "?" gives me a list of available commands which I've pasted here, the two interesting ones are "su" and "shell". I can't seem to get su access, even after logging in as root (challenge password prompt, and then nothing happens), but shell gives me a proper linux shell. WAP>shell BusyBox v1.18.4 (2017-12-26 17:06:34 CST) built-in shell (ash) Enter 'hel
            Read more

            Can't connect RFCOMM socket: Host is down

            Image
            up vote 3 down vote favorite I have bluez 5.4.3 and I am attempting to communicate with a ble device through minicom. These two deceives (my computer and a bluno nano) are alreadt paired and this has been my method so far. #bluetoothctl # pair xx:xx:xx:xx:xx:xx # exit Everything is working well so far then... #sudo rfcomm connect /dev/rfcomm0 xx:xx:xx:xx:xx:xx 1 & [1] 3665 Can't connect RFCOMM socket: Host is down Does anyone know how to resolve this issue? Any help would be very much appreciated. bluetooth bluez share | improve this question asked Feb 9 '17 at 18:46 Brandon Knape 46 2
            Read more

            Kernel panic - not syncing: Fatal Exception in Interrupt

            Image
            0 Every day this error occured on my pc, kernel panic error on interrupt, what will be the problem? linux-mint share asked 6 mins ago Vinod Selvin Vinod Selvin 1 1 New contributor Vinod Selvin is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct. add a comment
            Read more