nickbclifford / ohm Goto Github PK

I love this language both for its easy to remember syntax and its extreme usefulness for golfing. However, I am mainly limited to running this using TIO, and I thought that there has to be some way of encoding and decoding the compressed strings and the base-255 numbers. My suggestion is to use https://repl.it for the encoder's code, because it supports pretty much every language you could want. This would really help with using Ohm online. Thanks!

I'm trying to write a program which converts a string into a BrainF*** program which accomplishes the same thing, but I am very confused about the use of the foreach loop. It seems to have extremely weird behavior. For example, in this program I am trying to turn each character into its character code, and then make a string with "+" repeated the number of times of the character code. I then want to concatenate the string ".[-]" for printing. However, it seems to have extremely weird behavior and doesn't work as intended. I was wondering if you could clarify why this is happening?

`:.+s×".[-]"↔,  Main circuit
`                     Get array of character codes
 :.+s×              For each item in that array, try and replicate the plus symbol that many times
         ".[-]"↔,   Concatenate the string (that causes BF to print) and print out this partof the BF program

Try it online! gives me the following stacktrace if I want to execute lvσ:

/opt/ohm/lib/helpers.rb:225:in `input': undefined method `chomp' for nil:NilClass (NoMethodError)
	from /opt/ohm/ohm.rb:16:in `instance_exec'
	from /opt/ohm/ohm.rb:16:in `block (3 levels) in <class:Stack>'
	from /opt/ohm/ohm.rb:16:in `times'
	from /opt/ohm/ohm.rb:16:in `block (2 levels) in <class:Stack>'
	from /opt/ohm/ohm.rb:271:in `call'
	from /opt/ohm/ohm.rb:271:in `exec'
	from /opt/ohm/ohm:32:in `<main>'

Real time: 0.127 s
User time: 0.106 s
Sys. time: 0.017 s
CPU share: 96.53 %
Exit code: 1

Without the σ everything works fine.

I am attempting to write a 1024 bit RSA program in Ohm, but unfortunately I am limited to only 8 bits for the exponent for it to not overflow. Even then, the format in which the output is displayed prevents me from accessing most of the least significant digits, (it uses the 1.1202002e+62 format) thus preventing me from decrypting. Is there any chance of a fix for which the code could handle integers of arbitrary size? (ie. like Python's integers and floats)
This would be very helpful for cryptography.

P.S. your language is absolutely godly and deserves widespread recognition.

I've noticed that a recurring theme in quite a few cops and robbers challenges is some form of cryptography. I was thinking it would be useful to have some simple hash functions, ie. MD5, SHA-1, SHA-256, SHA-512. Thank you for your consideration and for this amazing golfing language.

https://tio.run/##y8/INfr///C0R437Dq/R@v/fwNDAwMDQ0BAA
To my understanding, the final multiplication shouldn't return those values, but it does

In lib/constants.rb your comment about 0x00-1F in CP437 is not helpful not constructive. Your useless emotions have inflated your codebase to an unusable pile of garbage. The sheer disk space that this comment consumed is too much for most users to handle. Please, on behalf of the entire code golf community, remove this comment.