Magic Number and the file system mystery - Who is the original CAFEBABE ?

File Types and Magic Numbers

Most operating systems has a way of recognizing file types. An operating system needs to recognize a file type so that it will know what to do with it. Since all files are just bits and bytes in the disk it will need to know how to interpret does bits and bytes in a manner consistent to what type of file it is.

One of the most common ways to designate a type to a file is through using file extensions. The part of the file name after the dot (.) . Like .exe, .doc, .java, .jpg An operating system will be able to recognize a file using this extension. This is most commonly used in Windows.

In Unix it is a little bit more flexible. Unix defers how an application can recognize files it can act on. One method is using Magic Numbers (What are magic Numbers ?). But not all files have magic numbers. Unix also allows file extensions - but this is not enforced or dictated by Unix (not like windows) like
.sh .c .gcc .o [1] 

So, Now what is CAFEBABE ?

CAFEBABE is the hexadecimal value of the magic number used on compiled class files for java.(Java Class File).  
So i tried looking into some of the class files in unix and there it is CAFEBABE


But was there really a CAFE BABE ?
If there is, who could she be ?
If you are curious too I think here is a good starting point
Let's Dig this Up!
[1] A. Silberschatz et al, “File Concept,” in Operating System Concepts, 9th ed. Hoboken NJ,USA: Wiley 2013, ch. 11, pp. 510–511.

Comments

Post a Comment

Popular posts from this blog

OAuth 1.0a Request Signing and Verification - HMAC-SHA1 - HMAC-SHA256

Image
This is a security project that I did this Fall semester. I was interested in why the OAuth1.0a specification did not require you to sign a request using RSA-SHA1 or any RSA algorithm. The first issue that I found is where would you store your private keys in a javascript client? - as a javascript encrypted file ? from the browser ?  - that will be a security hole if you allow javascript to get private keys. These are some of the questions that got me asking and which I cannot find answers to for now. OAuth 1.0a Signature Signing and Verification using JavaScript Implementation Background The OAuth specification tries to define an API authentication method that allows consumer websites or applications to access protected API Resources from a Service provider. The advantage that OAuth provides is that the user of the website or application is not required to disclose their credentials to their service provider. Another advantage of using OAuth to authenticate is that it does not
Read more

Spark DataFrame - Array[ByteBuffer] - IllegalAurmentException

IllegalArgumentException - ByteBuffer - Spark DataFrame I was processing a several million documents (~ 20 million) in which we need to extract the NLP features using NLP4J, OpenNLP, and WordNet. The combination of the three NL features blows up each record to 11 times its original size. We are using all three because we do not know yet what feature sets will be helpful to us. The original dataset is in parquet files in HDFS (16 partitions). I thought that was convenient just use withColumn and pass a UDF (User Defined Function) on the column where it needs those features. withColumn adds the calculated column back to the DataFrame. So I created the spark job (I am on Spark 1.5.2-cdh5.5.2)for the above, and things started to get nasty. I am blowing up the ByteBuffer array on the in-memory columnar storage. This is the exception that I am getting. There seems to be no reference in my code in this stack trace. java.lang.IllegalArgumentException at java.nio.ByteB
Read more

Gensim Doc2Vec on Spark - a quest to get the right Vector

Ever since I joined the R & D group we have been doing a lot of cool things, like trying IBM Watson (see previous blog entry). Now we are doing a lot of Natural language processing.  We wanted to compare the similarity of two documents. There is this excellent project Gensim ( doc2vec ) that easily allow to you to translate large blocks of text to a fixed length feature vector to make comparisons. Here is the link to the  original paper  from some people from Google that explains the approach. In essence, they wanted to find a representation that will overcome the weaknesses of the bag of words model. The doc2vec approach proves to be a reliable approach to comparing similarities of documents because it takes into consideration the semantics and the order of the word in context. So with that, we wanted to use it for a corpus of 26 million documents. Calculating the doc2vec for 26 million documents is not a small task, so we need to process it in Spark. The problem is that there
Read more