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

            Ponta tanko

            Image
            Usona ponta tanko M60A1 Ponta tanko estas, simile kiel kirasita savveturilo, inter specialaj kirasitaj transportiloj. Kiel pontaj tankoj eblas konsideri ĉiujn memmovigaj rimedoj ebligantaj superi obstaklojn ĝis larĝeco 24 metroj rekte en spaco de bataloperacoj. Ties ĉefa tasko estas ebligi al la propraj taĉmentoj daŭrigi en rapida antaŭenirado sen senbezona reteniĝo. El tio pli-malpli rezultas taktikaj-teknikaj postuloj, kiujn ili devas plenumi. Precipe temas pri kapablo operacii komune kun unue-sinsekvaj taĉmentoj kaj transpontigi obstaklojn dum kelke da minutoj. This page is only for reference, If you need detailed information, please check here
            Read more

            Tantalo (mitologio)

            Image
            Ĉi tiu artikolo temas pri mitologio. Por aliaj signifoj vidu la paĝon Tantalo (apartigilo) . Tantalo , laŭ Gioacchino Assereto. Laŭ la helena mitologio, Tantalo (el la greka Τάνταλος , ŝancelanta aŭ tre malfeliĉa ) estis filo de Zeŭso kaj la oceanidino Pluto, laŭ la plej divastigata versio. Li estis reĝo de Frigio [1] aŭ de la monto Sipilo, en Lidio (Malgrandazio) [2] kaj post sia morto li suferis eternan torturadon ĉe la Tartaro, la plej profunda parto de Hadeso, rezervita por la plej perversaj homoj. Tamen, kelkaj rakontoj asertas ke li estis reĝo de Argo aŭ de Korinto [3] , aŭ ke li migris norden el la monto Sipilo por akiri la tronon de Paflagonio, el kie Ilo forpelis lin pro tio, ke Tantalo forkaptis kaj seksperfortis lian fraton Ganimedon [4] , kaj tiel ofendis la diojn. Verŝajne li ankaŭ regis urbon en okcidenta Anatolio, kiun oni nomis Tantalis [5] pro li, aŭ Sipilo , pro la monto sur kies flanko ankoraŭ staras ĝiaj ruinaĵoj [6] . Laŭ la geografiisto Strabo,...
            Read more

            Erzsébet Schaár

            Image
            Erzsébet Schaár Memportreto de Erzsébet Schaár en Pécs Personaj informoj Naskiĝo 27-an de julio 1908 ( 1908-07-27 ) en Budafok Morto 29-an de aŭgusto 1975 ( 1975-08-29 ) (67-jara) en Budapeŝto Ŝtataneco Hungario Profesio skulptisto Familianoj Edz(in)o Tibor Vilt v   •   d   •   r Erzsébet Schaár [erĵEbet ŝAr], laŭ hungarlingve kutima sinsekvo Schaár Erzsébet estis hungara skulptisto. Ŝia edzo estis Tibor Vilt. Déryné Széppataki Róza en Miskolc fare de Erzsébet Schaár Erzsébet Schaár [1] naskiĝis la 27-an de julio 1908 en Budafok, ŝi mortis la 29-an de aŭgusto 1975 en Budapeŝto. Enhavo 1 Biografio 2 Elektitaj solaj ekspozicioj 3 Elektitaj kolektivaj ekspozicioj 4 Elektitaj skulptaĵoj 5 Elektitaj disĉiploj 6 Fontoj 7 Referencoj Biografio | Erzsébet Schaár studis en Industriarta Lernejo, poste en Reĝa Belarta Altlernejo (1924-1926). Ŝia ĉefinstruisto estis Zsig...
            Read more