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
    4 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
    4 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
    4 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
    4 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
4 hours ago




$begingroup$
+[.] Do I win? :P
$endgroup$
– Quintec
4 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 2 hours ago

























        answered 3 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

            Costa Masnaga

            Image
            .mw-parser-output .avviso .mbox-text-div>div,.mw-parser-output .avviso .mbox-text-full-div>div{font-size:90%}.mw-parser-output .avviso .mbox-image div{width:52px}.mw-parser-output .avviso .mbox-text-full-div .hide-when-compact{display:block} Questa voce o sezione sull'argomento Lombardia non cita le fonti necessarie o quelle presenti sono insufficienti . Puoi migliorare questa voce aggiungendo citazioni da fonti attendibili secondo le linee guida sull'uso delle fonti. Segui i suggerimenti del progetto di riferimento. Costa Masnaga comune Localizzazione Stato   Italia Regione Lombardia Provincia Lecco Amministrazione Sindaco Sabina Panzeri (Al centro il cittadino) dall'08/06/2009 Territorio Coordinate 45°46′N 9°17′E  /  45.766667°N 9.283333°E 45.766667; 9.283333  ( Costa Masnaga ) Coordinate: 45°46′N 9°17′E  /  45.766667°N 9.283333°E 45.766667; 9.283333  ( Costa Masnaga ) Altitudine 318 m s.l.m...
            Read more

            Fotorealismo

            Image
            Guerrino Boatto, Venice's St. Barnaba Church and canal Il fotorealismo è un genere di pittura basato sull'uso di una o più fotografie dalle quali l'artista prende le informazioni necessarie da utilizzare poi nel processo della creazione dell'opera, in genere ad olio o ad acrilico, al fine di avere un aspetto finale il più simile possibile alla fotografia. Indice 1 Storia 2 Lista dei fotorealisti 3 Note 4 Voci correlate 5 Altri progetti Storia | Il fotorealismo è un movimento che nasce negli Stati Uniti d'America alla fine degli anni sessanta [1] sulla scia della Pop Art [2] [3] [4] , e insieme condividono il carattere reazionario verso la travolgente ascesa dei media, che alla metà del ventesimo secolo si trasforma in un fenomeno di massa talmente imponente da minacciare il valore dell'immagine nell'arte. [5] [6] Ne consegue così che, colto il gesto d'inizio che fu della Pop Art, i fotorealisti aprono ad un ...
            Read more

            Sidney Franklin

            Image
            Questa voce sull'argomento registi statunitensi è solo un abbozzo . Contribuisci a migliorarla secondo le convenzioni di Wikipedia. Sidney Franklin, foto di Carl Van Vechten Oscar alla memoria Irving G. Thalberg 1943 Sidney Franklin , all'anagrafe Sidney Arnold Franklin , (San Francisco, 21 marzo 1893 – Santa Monica, 18 maggio 1972), è stato un regista, produttore cinematografico e attore statunitense. Il 20 giugno 1963, si sposò con l'attrice australiana Enid Bennett. Il matrimonio durò fino alla morte dell'attrice, il 14 maggio 1969 [1] Indice 1 Filmografia 1.1 Regista 1.2 Aiuto regia (parziale) 1.3 Produttore 1.4 Attore (parziale) 2 Note 3 Altri progetti 4 Collegamenti esterni Filmografia | Regista | The Baby , co-regia Chester M. Franklin (1915) The Rivals , co-regia Chester M. Franklin (1915) Little Dick's First Case , co-regia Chester M. Franklin (1915) Her Filmland Hero , co-...
            Read more