cancel
Showing results for
Did you mean:

## i made a cryptograph program in python 3 Level 8

see the video here;

https://youtu.be/judkcG104po

get the python 3 program here, its the file called "crypto";

GitHub - dothehokiepokie/mystuffyouknow: my stuff

here's the result:

input word:

word = "abcd"

results:

['a1', 'b2', 'c3', 'd4']
['a2', 'b3', 'c4', 'd2']
['a3', 'b4', 'c2', 'd3']
['a4', 'b2', 'c3', 'd4']

[Done] exited with code=0 in 0.05 seconds

i mean to incorporate this into my sarcasm program to find made up words that share common letter characters in some logical way. but i may not. i did this after i read about the Morpheus cpu.

3 REPLIES 3 Level 8

i updated my crypto program, now it makes a sentence from a single word then you can feed that sentence into the sarcasm program to find the most sarcastic word and take that as the encryption key thats true;

https://youtu.be/fiH8nNn5-hw

and the first post has the github link to get the python 3 progam called crypto.

heres the new results

# original input word
the original input word = donkey

# each element is a single letter from the input string
# print the decryption each element number
# the first two numbers are the actual letter,
# the second and third numbers are the false letter
# the fifth number is the pattern to make from the added false letters added to the false letter

[['04121', '15272', '14253', '11344', '05262', '25103'], ['04312', '15123', '14174', '11202', '05323', '25214'], ['04343', '15234', '14252', '11193', '05204', '25132'], ['04254', '15202', '14163', '11174', '05302', '25213']]

# print the encryption made from the decryption key

[['c', 'rv', 'cp', 'aya', 'qm', 'wa'], ['vj', 'ac', 'php', 'kl', 'gw', 'wlw'], ['gy', 'wnw', 'pv', 'mj', 'gkg', 'df'], ['opo', 'kv', 'xg', 'aha', 'uc', 'fl']]

# the 4 strings made from the one input string which makes a sentence to feed into the sarcasm program

crvcpayaqmwa vjacphpklgwwlw gywnwpvmjgkgdf opokvxgahaucfl

[Done] exited with code=0 in 0.079 seconds Level 8

a way to make this a artificial intelligence program:

= w on the keyboard wasd

= a on the keyboard wasd

= d on the keyboard wasd

= s on the keyboard wasd

as the ball moves its line of movement makes its point of convergence with the paddle

the ball moves in a line that line is made up of lines pixels that are moved through by various wasd key presses.
down wasd
left or right wasd

if the ball doesn't hit the wall:
ball on pixel row x = down one pixel, left or right n number of pixels
ball on pixel row x1 = down one pixel, left or right n number of pixels
ball on pixel rox x2 = down one pixel, left or right n number of pixels

else:
#the wall changes the direction of the ball so change the (left to right) or (right to left)
ball on pixel row x = down one pixel, left or right n number of pixels
ball on pixel row x1 = down one pixel, left or right n number of pixels
ball on pixel rox x2 = down one pixel, left or right n number of pixels

ball on pixel rows left or right wasd = (ball on pixel row x = left or right n number of pixels) + (ball on pixel row x1 = left or right n number of pixels) + (ball on pixel row x2 = left or right n number of pixels)
ball on pixel rows down wasd = (ball on pixel row x = down one pixel) + (ball on pixel row x1 = down one pixel) + (ball on pixel row x2 = down one pixel)

for y in range ((total down wasd pixels) // (ball on pixel rows down wasd)): # the ball eventually goes to the pixel line the paddle is on.
move the paddle (ball on pixel rows left or right wasd)

this ends the crypto program
what follows is the sarcasm program

sarcasm starts out with the input from crypto of where the ball will meet the paddle.

if the ball doesn't hit the wall:
ball on pixel row x = up one pixel, angle_1 = (left or right n number of pixels), angle_2 = (left or right n number of pixels)
ball on pixel row x1 = up one pixel, angle_1 = (left or right n number of pixels), angle_2 = (left or right n number of pixels)
ball on pixel rox x2 = up one pixel, angle_1 = (left or right n number of pixels), angle_2 = (left or right n number of pixels)

else:
#the wall changes the direction of the ball so change the (left to right) or (right to left)
ball on pixel row x = up one pixel, angle_1 = (left or right n number of pixels), angle_2 = (left or right n number of pixels)
ball on pixel row x1 = up one pixel, angle_1 = (left or right n number of pixels), angle_2 = (left or right n number of pixels)
ball on pixel rox x2 = up one pixel, angle_1 = (left or right n number of pixels), angle_2 = (left or right n number of pixels)

ball on pixel rows left or right wasd = (ball on pixel row x = left or right n number of pixels) + (ball on pixel row x1 = left or right n number of pixels) + (ball on pixel row x2 = left or right n number of pixels)
ball on pixel rows up wasd = (ball on pixel row x = up one pixel) + (ball on pixel row x1 = up one pixel) + (ball on pixel row x2 = up one pixel)

middle angle 1 = (ball on pixel rows left or right wasd)
middle angle 2 = (ball on pixel rows left or right wasd)
left angle 1 = (ball on pixel rows left or right wasd)
left angle 2 = (ball on pixel rows left or right wasd)
right angle 1 = (ball on pixel rows left or right wasd)
right angle 2 = (ball on pixel rows left or right wasd)
# the paddle meeting the ball can be in three different spots on the paddle;
# middle = deflection, depending on if the paddle is moving or still, two possible angles
# left = move ball left in variable angles, depending on if the paddle is moving or still, two possible angles
# right = move ball right in variable angles depending, on if the paddle is moving or still, two possible angles

# sarcasm then makes the bricks a input sentence to get to the most valuable brick.
for x in range bricks:
for y in range ((total up wasd pixels) // (ball on pixel rows up wasd)): # the ball eventually goes to the pixel line the brick is on.
x = x,[y = paddle(middle, left, right)] # the ball is moved by the paddle to the pixels the brick is on

each brick is a line of pixels from the paddle up to the brick.
moved through from the paddle up to the brick in reverse order from how the ball fell.
for each row the ball moves left or right some value and eventually meets the intended brick.

then sarcasm moves the paddle through each brick, each brick = a word in the input sentence.
to eventually get the ball to the most valuable brick.
which is when the ball goes to the top of the bricks and bounces down multiple times.

the sarcasm moves the ball to this brick because it is the highest value of sarcasm.
because it is the word with the most matches.
a match can be where the ball breaks a brick. Level 2

Well, the Indian government has passed a new law that prohibits the use of private crypto and requires the use of official crypto that is regulated by the RBI. The New Indian government plans to draught a measure prohibiting private crypto players and establishing a framework for an official crypto currency controlled by the RBI during the winter session. This ban has been under consideration by the administration for some time. There are more than 14,000 publicly traded cryptocurrencies in the globe. Bitcoin, with a market value of over \$1 trillion, and Ethereum, with a market capitalization of over \$492 billion, are the two most popular cryptocurrencies. 