Older blog entries for dangermaus (starting at number 64)

18 Mar 2012 (updated 19 Mar 2012 at 14:30 UTC) »

This is the monthly report after the usual battles fought in cyberspace and beyond!

Third encounter with AIX

Mauri was playing with hanging puppets and Marti was already eating Spaghetti, but we were all waiting my father for supper on friday evening. The phone rang once, I called back but it was busy. It turned out that my father phoned, however he had to stop the phone call as someone from IBM support finally called him. He explained me that he had a strange black box in a corner of a huge hall full with wine boxes (each with 12 bottles of prestigious wine!) which refused to boot up. On the black box one could read IBM 520, and closer there was a label saying "Type 8203-E4A N/S G5-208 B4". The server went down on friday morning at 9:45 when an electrician doing maintenance work removed fuses to work safely. The whistling UPS run unheard for a while, and the black beast died right after UPS finished its juice.

The whole company could not work without this server through friday. (on which a DHCP server, a file server and a billing software run), so my father decided to keep trying and to skip supper. I could not resist when he mentioned the box was running AIX, so dangermouse mounted in his car and drove to the huge wine hall equipped with ananas pieces, biscuits and the two laptops virgibuntu and andromeda. Intermezzo for the fans: the Calibra car lost the front spoiler in a close encounter with the guard rail, which explains the broken blizzard sign, too.

But back to the problem: the local network was not lying neither on the usual 192.168.x.x IP range, nor on 10.x.x.x. It was between 172.16.x.x and 172.31.x.x which was unusual setting for us, and the confusion was great. On the LCD panel of the IBM 520 one could find out that it was started in modality A which was sort of diagnostic modality. The box did not have neither keyboard nor screen and was silent like the monolith of Space Odissey.
It had a strange HMS port, but we did not know what HMS was. Either the manual of 500 pages we found in Internet about HMS forgot to introduce what HMS was, or we were so tired that could not figure out.

The next day, when the kind technician of IBM came, we learned how to use HMS to revive the server, and learned about the smitty utility, and why one of the hard disk never lighted. For short time, I had the root password of the box, but when I tried to login to have a ride, the software owner already changed it. It is the third time I encounter an AIX, but never had the chance to login and discover its inners! In the end, our job reduced to get the printers back up and running, and to add a samba network name to the host file, which for some reason the resurrected blackbox did not want to resolve. When we left, I glanced one last time at the misterious IBM 520 box, and I felt like it was laughing.

Phantom Computer

I discovered that Virtualbox 4 has much better network support. I used this fact to setup a Fedora Linux 16 with the Sage libraries, a phantastic collection of mathematical software. Additionally, I found out that GPU libraries worked well under Linux, especially the Synapse support made by Lukas Gebauer. There is still some hope for the version II of GPU then! And from the outside, this Fedora thing should appear like a phantom computer on its network segment!


There were two lessons I learned with this puzzle: the first one is "let others help you"! In fact, I could not even solve the first level of the puzzle, while Virgi made it up to level 27. She explained me the rules of the game (we could not see them as we were logged in), and also some of the heuristics she was using, and to which mathematical problem it reduced (this can be found in the forum as well). I had a bad time passing the first level after that, but finally managed to do it! contagious told me that he used an external library to solve the Crossflip challenge. As my brute force solver barely brought me to level 60 and I could not find a way to implement Posa search, I decided to go with external libraries to defeat OneOfUs. I tried out many, including one of an author who made the claim P=NP. He was so kind to provide the C++ implementation, which you can't say of most of so called scientific authors. Still, his library did up to level 460, but then started going very slow. I teamed up with userfriendly, sharing what we discovered on the problem. After our briefing, he then skyrocketed to level 1000.

I kept stucked at level 460 knowing all what userfriendly knew. I worked through the night, but could not find the mistake in my solver implementation. I supposed an obscure error in the POST implementation of Synapse (the submitting part of the solver), but could not find any error after I created a test page to see what I submitted. Defeated, I went to sleep. I thought on all what I observed (including the fact that the "P=NP" solver in its slowlyness passed level 460) and then had the Zen flash, which each hacker.org puzzle hides. It turns out that my solver was in fact correct and it was solving the problem, just it was solving another problem which was not the one expected by hacker.org! I had a nasty mistake in the board generation for level over 242, but this mistake showed up only on bigger boards! The second lesson learnt is "if you think your code is right, it is. Look somewhere else!". For the record, the last level was solved in 20 seconds. The whole story can be seen here, when charting will work again.

Cheat Engine

Cheat Engine is an amazing Open Source tool which you can attach to any running process. Among other things, it identifies where integer variables are held in memory, so that you can modify them while you are playing. This helped me out a lot in a challenge I could not disassemble. I also tried "What in the World" without luck, but knowing what the sequences probably are. And failed on "Slim Image", too. On hacker.org, I often feel at the limit of what my mind can do and also what current software and hardware can do, which is a good introduction for the next section :-)

Geometric Visions

I read the Geometric Visions article of Michael Crawford, which is a great article not only about mental disease, but also about philosophy and about how people mind works in general.

I only had acoustic allucinations once, when i was living in a place close to a noisy rail station where i could not sleep. i never had problems with depressions or so, also because i can't focus on details, i do not care about details (which can be also a problem in life :-)

To tell the difference between voices and real life, i used Occam's rasor principle: if my reasoning started getting too complex, and one easier explanation (which might be hurting to myself) is easier, then i decided to believe the easier explanation and to fix my behaviour in positive ways. I found out that most of the time, complex reasoning was just an excuse to hide my misbehaviour. Occam's principle worked very well through my whole life.

Final notes

I found the OpenFlashChart library for PHP and I am now pepping up deltasql with charts. The hope is that such chart experiments will help the GPU project as well!

As final links the history of Commodore International and of its founder, and a note on the strange Kaprekar numbers.
That's all folks!

20 Feb 2012 (updated 3 May 2012 at 05:52 UTC) »
Per aspera ad astra Through difficulties towards the stars! This is all what was boiling into dangermouse software pot. It was also a time of reminiscences. First, a look on the journey in hackerland:


The challenge is about decoding a ciphertext without knowing the rotors and their initial position. Fortunately, the plugboard position is known.

I saw the Enigma machine at the Imperial Museum of War in Lodon in 2007. It also remembered me when i was working for a security company. I had time to read Turing's treatise on Enigma and dreamed of having my own Enigma on the desk. This month, I read through this slide presentation. The presentation not only explains how Enigma works, it also gives an interesting historic background. It gives the correct light on the events before and after World War II. The difference between the commercial and army version of Enigma was the wiring of the keyboard... Why the Polish were the only who could crack Enigma... Allied where open mouthed when they heard someone could crack rotor machines.. The British collected Enigmas and gave it to colonies after WWII, without revealing they could decode them... And I wonder if the cycles used by Marian Rejewsky are part of the unpublished chapters 4 and 6 of the Turing's treatise. And what else is hidden in the two chapters!

I then used this reference implementation, and created my own Enigma implementation in Freepascal. While coding, I could hear the gears inside the machine moving, the smell of grease and the notches and pitches ticking inside the Polnish "bomba".

I did first the army version (5 rotors, 2 reflectors) and sorted out feasible solutions with the index of coincidence. I then exhagerated and implemented also the Naval version (8 rotors, beta and gamma wheels and adapted reflectors). Admiral Doenitz would be scared, if he would see it! Although I have to admit that this works only if the plugboard is known. So, Admiral, don't worry and sleep weel in your submarine hidden in the oceanic depth...

The source code is committed to the playgroud area of the GPU repository, as this might become one day a GPU plugin to compete against the Enigma@Home project.


Crossflip is a puzzle about light bulbs switching on and off. Goal is to get all light bulbs on the board to be glowing. I decided to avoid the approach with the previous puzzle 'Runaway Robot', namely to work through all levels of enlightment. So, in one evening I had the linear equations in GF(2) describing the problem. The first straightforward implementation with booleans worked until level 150, with the usual GET/POST problem at level 91. Another implementation with packed matrix brought me to level 300.

But once again, things worsened: the linked list approach was a miserable failure, as the memory management was taking definitely more time than expected. I tried several things to break the barrier of O(n^3), in particular I focused on iterative methods (which remembered me the time I was working for university). Steepest descent and Conjugate gradient did not work, due to the self orthogonality of the scalar product. I tried to workaround it by simply counting the numbers of bits... Then I tried Gauss-Seidel iteration as there is no scalar product in the iteration. Still, the algorithm did not converge to the solution. Maybe, I had a mistake in the implementation, or the matrix was not positive definite, or it simply does not work in GF(2), who knows?

At the end, I realized I had a major bug into the algorithm, when the system was undetermined. The bug is also in the Linear Algebra book we used at university, and now that I noticed it, I remember my friend Sid who pointed me at it! I could solve the last level (90000 variables) in 8 minutes 20 seconds. Andromeda compiled the last version of the code, and it was executed on Virus's computer. I did not implement one last optimization in this version, and the reverse elimination step was not optimized. I assume, with some more tackling, I could bring it down to 3 minutes, on 64 bit hardware. All in all, I had 15 different approaches, with more than 100 revisions. The whole story can be seen here. Now, I wonder if some system of linear equations could describe Eternity. For that puzzle, I have only the brute force approach in place...

There was also some other progress on the site: solving the challenge protecting the last upper-left corner castle took four evenings of focused thinking. "Lazy spiral" fall straight after.

And "Poke me", although still unsolved, remembered me when I (aged 9) was sitting with my father in front of the C64, he explaining me what "IF","THEN" and "ELSE" meant in Italian. I hope my sons will be interested as well in such stuff... I have an OLPC laptop around, I will show them, when it's time!

Some other updates from "real" hacking life follow:

deltasql 1.4.3

1.4.3 ships with a new feature: users who opt in, will receive an email notification each time a new script is inserted in deltasql.

This feature should easy the introduction in deltasql, where the development is currently done via emails. Users who are confident with deltasql will use it straight away, other users who are not conviced by deltasql strength can opt-in the email notification feature.

The only requirement for all users is that they need to insert the new script into deltasql instead of sending an email to the other users. Admins who would like to user this feature in production should consider installing patch level three available from here in the files section for 1.4.3.

For me, it was the first time I implemented a system which can send emails automatically. dangermouse is a spammer! :-D

Image resizing bomb

This bash script uses ImageMagick and takes as parameter to which percent you want to scale images down. It is useful for me to resize pictures from cameras to be published on the web.

mkdir resized

for f in $FILES
if [ $f != "./resize.sh" ]
echo "Resizing $f file down to $1 per cent..."
# take action on each file. $f store current file name
convert $f -resize $1% "./resized/$f"

12 Jan 2012 (updated 12 Jan 2012 at 14:51 UTC) »

These are the latest from my hackerland journey. I feared that either me or the challenge site would go down, and in fact hacker.org is now temporarily unavailable since three days. Maybe it is under a Denial of Services attack of some user who is angry because he can't solve some challenge... Who knows?

Close to the last castle

With 190 challenges solved, I am close to the last castle on the upper left corner of the map. The challenges around it are very hard, none of them is solved, and after there will be a super-hard challenge anyway to protect this castle.

Being a dangermouse it was reasonably easy to solve some quests of the serie "Really Small Mouse". I brought the mouse down to 21 instructions, but there are some hackers who can do it in 20 and less! Cool challenges encountered on the road were 'No full ACK in SEPT' which refreshed modular algebra a bit, 'Maelstrom' to train image recognition, 'HVM cipher' and 'Really Simple Access' to revive my reminescences of cryptanalysis. While solving "Shattered and Shuffled" and "Shredded and Scrambled", I felt cold down my neck, it was the breath of the dark side who strucked me.

I suffered deceiving in "Such Much" and only an answer on the forum brought me back on track. I almost brought down hacker.org by submitting huge numbers calculated with Python! I attacked with brute force 'Soviet Intercept' and I almost locked me out of this challenge; now I have to wait one hour between submitting of answers for this particular challenge, though now I prepared a sort of key which should allow the identification of the spies.

For the cryptographic challenges involving unkown codes, I developed a tool to perform the kappa-test, and another one to perform the chi-test on vigeneres which have substitutions in columns instead of simple caesar ciphers. I wrote them according to this article. I found a good tool to perform first image analysis on Steganographic challenges here made by Caesum, the author of the Challenger's handbook. To perform coprime factorization I definitely recommend MSieve. Other discoveries were Binary Coded Decimals (BCD) and Setun, a Russian computer which was working with ternary balanced circuits :-)

deltasql 1.4.2 and beyond

1.4.2 was a tactical release, to get hands on code which I did not touch since three months and also to advertise deltasql through the Mantra of Open Source Release often, release early. The development of 1.4.3 is struggled by technical accidents (the server I am using to test went down, because the friend of mine who kindly hosts deltasql forgot to pay the bill). Additionally, I face now trouble pushing my code with git to sourceforge. But 1.4.3 will be fresh wind with several minor bugfixes, user preferences and the ability to inform users of new scripts via sendmail.

Finally, to remember myself on how to

Set default operating system in Grub

1. edit DEFAULT variable in /etc/default/grub
2. run sudo grub-update

19 Dec 2011 (updated 19 Dec 2011 at 15:59 UTC) »

There are many challenge sites on the net, and one to unify them all.

I decided to focus on hacker.org as there are many high quality challenges involving programming, cryptography and maths, and a bit less of ugly exploits and similar. The site organizes challenges on a map. Harder challenges are on mountains, easier ones on grass. Each time a challenge is solved, it opens the road to new challenges. Castles protect challenges that are on crossroads. Winning against a fortified castle opens new possibilities and new areas to be discovered.

From easy to hard or the other way round

Sometimes i get stuck solving a harder challenge. At first time, it looks like i am wasting my time, but the point is that if by chance i manage to solve it, several other challenges suddenly get much easier.

This was the case with the Labyrinth challenge, which forced me to develop new techniques for the HVM. In the end, I invested more than one month of time on it. Once Labyrinth was solved, I could solve the similar Deluge and the sequel "Flash Flood warmup" in one day. Other challenges like "King Mouse", "Brokenest Keys" and "Mus Minutoides" finally found a solution through new ugly techniques (mainly calls with no returns and what i call the statistical approach, to spoil them a bit).

To sharpen my weapons further, I put Caesum's Challengers handbook in my journeyer's backpack. And here I found a good explanation of the chi and kappa test, so that I added the index of coincidence to the magic spells I am aware of.

It was a great satisfaction to besiege the castle protected by 'Spiral bits'! The path following algorithm did his job well, but the decoding part was a complete nightmare, so that i turned the Lazarus GUI into a complete editor for inserting, deleting and flipping bits. I also had an integrated lens on board and a tool to compare the decoding on slightly different paths (which did not work very well though). And a good bit of luck was also part of solving it!

I then succesfully attacked 'No full ACK in HEX' and 'No full ACK in DEC', learning Knuth arrow notation, the tower of powers, and in particular learning Python's ability of computing with large numbers, which is unrivalled. Maple couldn't do what Python did. Now I know why some numeric people I worked with were so happy with Python :-)

And still, there is work to do. My armies failed several times against 'Blizzard' and 'Descartes'. The 'Captcha' prototype needs further refinement as well...

(current ranking on hacker.org is 188 with 180 challenges solved/on Khan 200 challenges solved and Copernicus badge reached, next goal is one million points)

2 Dec 2011 (updated 2 Dec 2011 at 10:02 UTC) »

Mauri is born! Marti now has a brother and we are all very happy to welcome him in our family :-) Might the source be with you, Luke.

In the following, some updates on our lone hackerland journey:

Runaway Robot

Probably some smart people go straight to the correct solution. For me, I walked through all stages of enlightment. I first developed a maze parser in Frepascal, then got a brute force solver in place which could solve up to about maze level 120. The solver started taking long times for each new level (up to 6 hours). I am a bit out of gear right now as we moved house, lost connection to civilization for some time, and still have to reactivate the server room, which will move from pavement to cellar. I remembered that spartacusII server got burned in a similar challenge and decided to upgrade the algorithm as soon as possible. With dynamic programming I restricted a bit the solution space. A first attempt with combinations failed, I tried to debug the way I create combinations, but could not find the mistake. I rewrote the algorithm and got a working solver for levels up to 153. Then again, the solver was taking too much time. Finally, I got a sort of Zen flash and found a way to retrieve the solution, as it would be just popping out from the maze. The new solver could solve any maze in less than a second, and easily moved up to level 513. When it solved level 514 (a level noone has solved), and was waiting the one minute delay to avoid server pounding before the solution is submitted, I got very proud. Too much proud, as the server answered: "Your solution sucked, maximum level for this puzzle is 513". This site is amazing, it does not forget to teach you to be modest :-) The whole story can be seen in this graph as well.

I then decided to attack another puzzle, Mortal Coil. Adapting the parser and getting a brute force solver in place was easy, as Runaway prepared the path. But now I am stuck at level 68. I found papers on the Hamiltionian path problem, which is NP-complete and now need to think on how to divide and conquer it.

Other challenges

On the Hack Virtual Machine, I worked out the meaning of the two commands ^ and v and such knowledge lead to some progress: by analyzing the solution of Execution Style, I finally cracked Hello Small World! Also revision 34 of my Labyrinth program could solve the three mazes, though it required several submissions. In fact, the limit of 40'000 cycles is very tight. The version which solved the challenge could solve the reference maze I was using only in about 53'000 cycles. The Labyrinth program is based on a wall following algorithm published in Nievergelt's book about Algorithms and datatypes.

I found in the depths of Internet an almost complete map of the challenges and it is clear now that to achieve some breakthrough, I need to work out Spiral Bits. The encoding is a bit hard, but by printing out the spiral on a piece of A3 paper, it is possible to work it out with some patience. The pathfinder solver I developed follows the spiral but keeps staying on the side, so I have to think a way to balance it a bit. To debug the breadcrumbs left by the program, I use this magnifying glass.

On Khan Academy, I am close to the Copernicus Badge, but the Atlas Black Hole badge moved again out of range from 250 to 500 challenges...

Some other news

Unrelated to the previous topic, a deltasql patch to branch from existing tags for 1.4.1 is published here.

And do not forget to check the Wikileaks Spy Files!

Let me finally point at a news on the Voyager probes measuring Lyman-alpha radiation (here). Amazing piece of irons, the Voyager space probes!

Win a trip in space!

I once saw a documentary about Burt Rutan's Spaceship One. I was impressed by the engineering skills of Rutan's team and by their audacity: how they tried different rockets for their spaceship (the first one blew up), the ingenious method developed for reentry in atmosphere... How during the flight to win the SpaceX price the main 3D instrument gave up and the pilot simply lead the spaceship in direction where it was more dark :-)

If you are lucky, there is now the possibility to win a suborbital flight with Space Adventures, a company which offers space trips based on the technology developed by Rutan.

If you are a database administrator living in UK, US, Canada or Germany, try Redgate contest DBA in space. You might win a trip to space! I am doing it although I am Swiss and can't win anything just for fun :-)

I noticed the contest, because Redgate is developing database control version tools similar to deltasql.

Monitor a tor node in Wikileaks style

One of the good sources feeding Wikileaks is the tor network. What happens is that lot of intelligence agencies pull sensitive stolen documents via tor, so that they can hide their tracks while stealing documents. Wikileaks volunteers might run tor exit nodes and monitor for unencrypted traffic going through it.

For example, in Gentoo (unfortunately, this time I did not write down all steps, so it is only a sketch):

emerge -av tcpdump # to monitor traffic
emerge -av openntpd # to synchronize the clock with ntpd
emerge -av tor # tor itself
torgencert # generates a certificate for your tor node
ntptime # to adjust your clock

Configure /etc/tor/torrc so that it is sound, plus add the following lines so that the tor node becomes an exit node.
The following lines make your tor node an useful node which will cause you little trouble as all exiting traffic is encrypted a part of irc.

ExitPolicy accept *:22 # ssh
ExitPolicy accept *:465 # smtps (SMTP over SSL)
ExitPolicy accept *:993 # imaps (IMAP over SSL)
ExitPolicy accept *:994 # ircs (IRC over SSL)
ExitPolicy accept *:995 # pop3s (POP3 over SSL)

ExitPolicy accept *:6660-6697 # allow irc ports, very widely
ExitPolicy reject *:* # no other exits allowed

The next two policies make your tor node useful to monitor it for stolen documents. It is best however, not to run it for too long time as you might get complaints, as unfortunately tor is not only used by charitative NGOs...

ExitPolicy accept *:22 # ssh
ExitPolicy accept *:465 # smtps (SMTP over SSL)

The final policy is

ExitPolicy reject *:* # no other exits allowed

Now try to tear up tor and listen for packets:

/etc/init.d/tor start
tcpdump -A | grep -i "WHATYOUAREINTERESTEDIN" > captured .txt

If tor does not start check /var/log/tor/tor.log for hints.

Besides this topic, I found an interesting article on how the Great Chinese Firewall works. But I think that DNS poisoning is only one of the many techniques used.

Cool hacker challenges

On hacker.org I was able to cut the head of the arithmetic snake. And I am proud on how I solved the "Cons Car" challenge with a Freepascal prototype always at the swapping limit of my old andromeda laptop. As side effect, I finally got insights into the LISP language. I am breaking my head on the late didactic crypto challenges and on "Anybody Out There": I tried to model it with two parameters of an oscillating circuit (L and C) and had a look at the hydrogen line, but it did not work out. (rank 210/solved 170)

Not much progress on Khan Academy (videos 187/2619 - solved 194/211)
23 Sep 2011 (updated 23 Sep 2011 at 08:49 UTC) »
"Force has no place where there is need of skill." - Herodotus

Kahn's wisdom

Khan Academy published new exercices and this revived my interest in the platform: I solved some more exercices and watched through several videos. While watching "How Earth's tilt causes Seasons" I realised a conceptual mistake in simclimate (released with GPU): I consider the angle for sunlight but not day duration of sunlight... I also watched the series on Milancovitch Precession and Obliquity, Orbit Excentricity wobbling and Perihelion precession. I had the Python introduction, courses about Human Evolution and Earth Formation, and I then decided to start a complete refresh of Linear Algebra, as the course attended at university was taken 13 years ago. And even at work, from time to time, linear algebra is lurking. (Current status: exercices: 176/188, videos: 187/2259)

Journey in Hackerland

The quests are getting definitively more difficult to solve. This month I could solve only eight challenges. Revision 54 of my Brainfuck interpreter written in Superhack language finally conquered the fortified castle. For "Spiral bits" my prototypes aren't good enough yet, so that one complete area of Hackerland remains off range. "Execution Style" and several didactic cipher challenges were solved. Also the Lawsonomy secret is unveiled. But speaking of didactic cipher challenges: brute force works only up to 4 billion keys, which can be tested in roughly a quarter hour of computations assuming printable ASCII characters. If the key space is bigger, this quote is definitely not valid: "If force does not work, you are not using enough force". For "Branches" I painfully worked out a solution, but the number I get is not accepted as solution, meaning that probably I cut off too much code or that I oversimplified the recursion. Who knows. For "Snake Arithmetic", I understood how the nominator is composed, but I still could not telescope the denominator part of the Python equation. For "Anybody Out There" I bought the book "Fourier Transform for pedestrians", but I am still waiting for it as it is out of print and the new edition should come this month. For this alien challenge, I also asked help to an old keen friend of mine who studied physics.

Through my journey, I discovered plenty of tools worth of mention: IntelliJ IDEA, Netbeans and ImageMagick. My favourite pseudorandom generator ISAAC has a companion in form of the RadioGatun hash function.
(Current status: rank 212, quests 165/277)

deltasql 1.4.1

deltasql 1.4.1 is a maintenance release. I discovered a stability problem in deltaclient (for which a dedicated patch of 1.4.0 was done), and tried to minimize the impact of undefined index errors when using strict error_reporting in php.ini. Some unused columns were dropped and the synchronization INSERT statement was simplified. This release really qualifies for the maintenance tag.

My next goal is to try to develop a plugin for the Squirrel SQL client, which is phantastic client which is able to connect to multiple database types (as it is based among other drivers on JDBC ones, a technology I am familiar with). Squirrel SQL is useful at work as well, as there I do not have administrator rights, and I am therefore prevented to install the full Oracle driver.

Linux Magazines

I am a fan of Linux Magazine. I read many articles there, including one presenting System Dynamics tools used in simulations and one about the Hercules Mainframe emulator. And all the cloud computing stuff is more than a hype. Virtualbox is definitely running on my computers. Plenty of images for Virtualbox are here.


I downloaded Wikileaks cables from Cryptome. For the moment, I decided to split them with split -b 4096k cables.csv cableparts and to search through them with fgrep -i tanzania cableparts* > tanzania.txt. Probably not the best approach, though.
deltasql with new Freepascal/Lazarus client

I am quite proud of the new deltasql release 1.4.0, as it features a client completely written in Freepascal/Lazarus. It contains some of the libraries written for the GPU II platform, and some more stuff I will use to write an applaunch plugin for GPU II. I will test this plugin together with the anagramas plugin, developed as technical fallback from code written for hacker.org.

Echolink on Android

I tested the Echolink app on the Android phone of virus (HTC Legend). I connected to node HB3YGE-L two kilometers from my house. When I spoke the QSO handshake sequence,
it came out of the Yaesu FT60 with a delay of approximately two seconds. It worked also the other way round, speaking into the Yaesu FT60 echoed on the Android phone. I then connected to a node in New Zealand and heard ham radios talking, unfortunately I could not understand their English.

There is something which I miss on the Echolink app: I'd like to have the node number information along with the node name, so that I can connect to the nodes with the Yaesu FT60 by using the Echolink DTMF commands. I list them here as a reminder, the text is from the previous link.

Info Request: By pressing "*" will ask the Node to play an ID message.
Connect: Enter the Node ID number of the station you want to connect to.
Random Node: By pressing "00" the system will connect you to any available Node.
Random Link: By pressing "01" the system will connect you to any available Link or Repeater.
Disconnect: Press "#" to disconnect.

Virtual Academies

Life is definitely worth living :-), in the sense that the same named challenge on Hacker.org finally got solved, after destroying our best equipment. "Countdown Calc", "Patience" and "Blackbox" were interesting as they spaced on the decompiling domain. "Number Theory" and "Primal Pi" brushed up my aging C++ knowledge. "Filtration Residue", "Blood, Toil, Tear and Sweat" and "Dejà vu" taught us a lot. "Right Key Left", "My Chemical Romance", "Hereditary" and "Yoga Message" were pure fun. New tools discovered are Boomerang Decompiler, Hercules Emulator, Scilab and the NTL library. The challenge on which I hope to learn most is "Anybody Out There", although my mathematical skills are quite poor when it comes to signal analysis.

Problem is now that there are two castles, one protected by "Superbrainfuck", the other protected by "Spiral Bits". We have prototypes to solve the two challenges, but they still do not work :-(. And no way to execute "Execution Style", nor "One Function". Is this the end of our journey on hackerland?

For the record, our current ranking on Hacker.org is 239 with 157 challenges solved. Also Khan Academy published some more exercises (137/149)... Virtual Academies are the best escape path for Alice in Dilbertland!
The hacker explores the intersection of art and science in an insatiable quest to understand and shape the world around him.
We guide you on this journey.
From www.hacker.org

Yesterday evening we achieved the 128 Challenges solved mark :-) Best challenges in this journey from the last Blog entry were 'Maeda Path', 'Tic Tac Blah', 'Secure Room', 'Broken keys', 'Immortal' and 'Train Wreck'.

The challenge which keeps resisting us is 'A life worth living'. The spartacusii server burnt while computing the Game of Life for this challenge. Or maybe it died due too a lightning tempest which occurred two days ago. Or it did too much BOINC computations. Also the router is playing strange: I get a red light on the Internet... It was a second hand computer anyway. Basically, to solve more quests, we are risking the best of our gears. Now, I will need to reenable the pico server which I did not operate to spare current (and money). I also have another old server ready for operations.

We are now ranked 516 on the hacker.org site and almost in the top 500. This evening, me and virus will go out for dinner to party this incredible achievement in our life :-)
of mice and men

we just solved the Cavern challenge on the hacker academy. our bash warrior fought and died several times deep down into the dungeon, but a final modification into his mind brought him in about 16 hours down to the diabolic beast at the bottom. our warrior slaught the beast in two moves :-) we did not think someone could create such a deep dungeon!
dungeon's challenges are our entry to the more complicated challenges that require games to be solved by automation.

digging deeper

our "challenges solved" counter scores 102, but now the next challenges require us to invest much more time. we solved the first 90 challenges in two weeks, and then it took one week to solve another ten. this week we solved only one or two... also, we need to dig deeper into our toolbox. in particular, we start performing statistical analysis on ciphertexts (like done on one of my previous jobs)... i also printed out the Python code of the HackVM to learn its inners. and we need to decompose cellular automata into its components to know the number of cells at the 10th billion generation...

a life worth living

the Conway's game of life challenges are interesting, too. and make me feel younger, as my first Life implementation in BASIC for C64 was around 1989, after reading some old articles in Scientific American. i still remember the flash experience i had; my life simulation was not behaving as expected: only when i introduced a copy of the lifeboard for the previous generation, things started working out :-). with my father, we did another implementation in Turbo Pascal for Windows 3.1 back in 1992. the third implementation i did was just some days ago in Freepascal to solve the 'life skills' challenge. but in all my implementations were on bounded universes.

with please, i then noticed the Golly project, a simulator for Cellular Automata including Life. Golly has an unbounded universe, still it is very fast when the lifeboard size is small and can adapt lifeboard size if cells grow out of the box. and it is amazing feeling, as there are plenty of patterns in Golly and even a complete Turing machine working on the Life universe. it is amazing because i remember reading in Scientific American about it and how it theoretically should be possible to construct it in Life, as some NAND patterns were already working when simulated on a big supercomputer. 20 years later, i can run a complete Turing machine on the Life universe on my old laptop :-D.

in Scientific American, i read also about Life in 3 dimensions, and i wonder if there were progress on this as well. but probably not, as we 3D beings we think best in 2D. or at least me...

thinking different

all this time spent on the hacker academy is producing some chemical changes in my mind: i start looking at the detail, giving importance to an end of line or looking at ranges were a function is presumed to work. errors get more important than all the rest! and evidence just becomes obvious background noise... too much evidence can become even a misleading trail.
numbers previously thought big get small like a quarter hour or like four billion keys XORed on a ciphertext. numbers never considered before (because greater than the universe's atom count) are solution to challenges...
writing use-once code and combining tools and operating systems... burning CPU time, network bandwidth and hard disks... in short, hacker.org is wonderful!

55 older entries...

New Advogato Features

New HTML Parser: The long-awaited libxml2 based HTML parser code is live. It needs further work but already handles most markup better than the original parser.

Keep up with the latest Advogato features by reading the Advogato status blog.

If you're a C programmer with some spare time, take a look at the mod_virgule project page and help us with one of the tasks on the ToDo list!