Originally posted by phishna
decoded to e^(hi)pi)1=0
ALL CREDIT TO Rich Hoyle for solving this code.
www.cropcircleconnector.com...
Binary-ASCII coding within the new crop picture at Wilton Windmill
01100101 e
01011110 ^
00101000 (
01101000 h
01101001 i
00101001 )
01110000 p
01101001 i
00101001 )
00110001 1
00111101 =
00110000 0
Read each 8-bit ASCII character from inside to out, starting along a double tramline which points towards a nearby windmill, using bars = 1 or spaces = 0.
Then proceed clockwise until all twelve 8-bit characters have been read.
In order to read a second duplicate set of binary digits, use bars = 0 or spaces = 1.
Three Relevant Equations
Euler Identity e^(i)pi+1=0
Crop ASCII e^(hi)pi)1=0
Crop ASCII corrected e^(hi)pi+1=0
Originally posted by phishna
decoded to e^(hi)pi)1=0
ALL CREDIT TO Rich Hoyle for solving this code.
www.cropcircleconnector.com...
Binary-ASCII coding within the new crop picture at Wilton Windmill
01100101 e
01011110 ^
00101000 (
01101000 h
01101001 i
00101001 )
01110000 p
01101001 i
00101001 )
00110001 1
00111101 =
00110000 0
Read each 8-bit ASCII character from inside to out, starting along a double tramline which points towards a nearby windmill, using bars = 1 or spaces = 0.
Then proceed clockwise until all twelve 8-bit characters have been read.
In order to read a second duplicate set of binary digits, use bars = 0 or spaces = 1.
Three Relevant Equations
Euler Identity e^(i)pi+1=0
Crop ASCII e^(hi)pi)1=0
Crop ASCII corrected e^(hi)pi+1=0