Difference between revisions of "Obfuscation"
Jump to navigation
Jump to search
DonStewart (talk | contribs) m (Link to other idioms that also contribute to obfuscation) |
NeilMitchell (talk | contribs) (→Obfuscation: Formatting cleanups) |
||
| Line 1: | Line 1: | ||
| − | = Obfuscation = |
||
| − | |||
Haskell is (perhaps surprisingly) an excellent language for code |
Haskell is (perhaps surprisingly) an excellent language for code |
||
obfuscation. There have been three Haskell obfuscation contests: |
obfuscation. There have been three Haskell obfuscation contests: |
||
| − | + | * [http://www.haskell.org/pipermail/haskell/2004-August/014387.html 1993 Bottomth Obfuscation Haskell Contest] |
|
| − | + | * [http://www.scannedinavian.org/iohcc/zeroth-2003/ 2003 Zeroth Obfuscated Haskell Contest] |
|
| − | + | * [http://www.scannedinavian.org/iohcc/succzeroth-2004/ 2004 Succ Zeroth Obfuscated Haskell Contest] |
|
The ability to use symbols for identifiers helps a lot of course, as |
The ability to use symbols for identifiers helps a lot of course, as |
||
Revision as of 16:13, 28 June 2006
Haskell is (perhaps surprisingly) an excellent language for code obfuscation. There have been three Haskell obfuscation contests:
- 1993 Bottomth Obfuscation Haskell Contest
- 2003 Zeroth Obfuscated Haskell Contest
- 2004 Succ Zeroth Obfuscated Haskell Contest
The ability to use symbols for identifiers helps a lot of course, as does suspending the use of layout. Pointfree style is also an excellent help. Use of strange monads and Type_arithmetic can all be very confusing. Finally, Haskell's clean semantics makes refactoring code (semi-)mechanical, leading to some interesting obfuscated encodings (one can replace most Haskell keywords with lambda abstractions, for example).
Example
The following illustrates how, by turning off layout, rewriting keywords (let, case, where) as lambdas, and using symbols for identifiers (in this case multiple '?' characters), Haskell may be highly obfuscated.
--------------------------------------------
module Main where{import List;import System;
import Data.HashTable as H;(???????)=(concat
);(??????)(???)(????)=((groupBy)(???)(????))
;(??????????????????????)(????)=((??????????
)((tail).(???????))((????????????????????)((
??????)(?????????????????????)(????))));(??)
=([' ']);(??????????????)=((hashString));(?)
=((>>=));(???????????????????????)([((???)),
(????)])=((?????????????)(???))?(\(?????)->(
(????????????????)(==)(??????????????))?(\((
???))->((??????????????????)(???????????????
)(???)(?????))>>((?????????????????)(???))?(
\((?????))->((((???????????????????)((????))
((??????????????????????))((?????))))))));((
???????????????????????))(??)=(????????????)
("usage f dic out");(?????????????????????)(
(???),(??????))((????),(????????????????????
))=((???)==(????));(?????????????????)(???)=
(toList)(???);(????????????????????)(????)=(
((??????????)(((??????????)(snd)))((????))))
;(??????????????????)(???????????????)(???)(
(?????))=(((mapM)(((???????????????)(???)))(
(lines)(?????))));(???????????????????)(????
)(???????????????????????)(?????)=(?????????
)(????)((unlines)((???????????????????????)(
?????)));(????????????????)(???)((????))=(((
new)(???)(????)));(main)=((???????????)?(((\
(???)->((???????????????????????)(???))))));
(???????????????)(???)(????)=((????????)(???
)((sort)(????))((??)++(????)));(???????????)
=(getArgs);(????????????)(???)=((((print))((
???))));(??????????)(???)(????)=(((map)(???)
(????)));(????????)((???))(????)(?????)=((((
H.insert))((???))(????)(?????)));(?????????)
((???))((????))=(((writeFile)(???)((????))))
;(?????????????)(???)=(((readFile)((???))))}
--------------------------------------------