<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>superponiblog</title>
	<atom:link href="http://blog.superponible.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.superponible.com</link>
	<description>security, forensics, photography ...</description>
	<lastBuildDate>Sun, 13 Jan 2013 05:12:10 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.5</generator>
		<item>
		<title>SANS SEC503: Intrusion Detection In-Depth Mentor Class</title>
		<link>http://blog.superponible.com/2013/01/12/sans-sec503-intrusion-detection-in-depth-mentor-class/</link>
		<comments>http://blog.superponible.com/2013/01/12/sans-sec503-intrusion-detection-in-depth-mentor-class/#comments</comments>
		<pubDate>Sun, 13 Jan 2013 05:12:10 +0000</pubDate>
		<dc:creator>superponible</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://blog.superponible.com/?p=106</guid>
		<description><![CDATA[If you live in the New Orleans area and are interested in SANS training but can&#8217;t make it to a conference, I will be leading a mentor session starting in March for SEC503: Intrusion Detection In-Depth. Enter Promo Code MGIAC13 when registering for Security 503 from the Mentor Program to receive your FREE GIAC Exam attempt Mentor classes meets once &#8230; <a class="meta-nav" href="http://blog.superponible.com/2013/01/12/sans-sec503-intrusion-detection-in-depth-mentor-class/">Continue reading &#8594;</a>]]></description>
				<content:encoded><![CDATA[<p>If you live in the New Orleans area and are interested in SANS training but can&#8217;t make it to a conference, I will be leading a mentor session starting in March for <a href="http://www.sans.org/course/intrusion-detection-in-depth" title="SEC503: Intrusion Detection In-Depth">SEC503: Intrusion Detection In-Depth</a>.</p>
<p>Enter Promo Code MGIAC13 when registering for Security 503 from the Mentor Program to receive your FREE GIAC Exam attempt</p>
<p>Mentor classes meets once a week for 10 weeks in the evening for two hours &#8211; much like a graduate school course. No need to be out of the office or travel, and you&#8217;ll get more time to digest the content and more interaction.  The class includes MP3 audio files so you can study at your own pace in between sessions and have questions ready for the next class.  This course spans a wide variety of topics from foundational material such as TCP/IP to detecting an intrusion, building in breadth and depth along the way. </p>
<p>Course Details:</p>
<p>SECURITY 503: Intrusion Detection In-Depth</p>
<p>Start Date: March 27 &#8211; 6:30-8:30pm</p>
<p>Registration and full class information: <a href="http://www.sans.org/mentor/class/31040" title="http://www.sans.org/mentor/class/31040">http://www.sans.org/mentor/class/31040</a></p>
]]></content:encoded>
			<wfw:commentRss>http://blog.superponible.com/2013/01/12/sans-sec503-intrusion-detection-in-depth-mentor-class/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Christmas 2012 Hacking Challenge</title>
		<link>http://blog.superponible.com/2013/01/12/christmas-2012-hacking-challenge/</link>
		<comments>http://blog.superponible.com/2013/01/12/christmas-2012-hacking-challenge/#comments</comments>
		<pubDate>Sun, 13 Jan 2013 04:49:46 +0000</pubDate>
		<dc:creator>superponible</dc:creator>
				<category><![CDATA[Challenges]]></category>
		<category><![CDATA[Penetration Testing]]></category>

		<guid isPermaLink="false">http://blog.superponible.com/?p=97</guid>
		<description><![CDATA[Ed Skoudis and SANS&#8217;s holiday hacking challenges are something fun I look forward to every year. They&#8217;re always entertaining a good little test of security skills. This year&#8217;s &#8220;The Year Without a Santa&#8230; Hack&#8221; was no different. I don&#8217;t think I&#8217;ve ever seen &#8220;The Year Without a Santa,&#8221; but the Control Systems twist for the challenge was cool. Since the &#8230; <a class="meta-nav" href="http://blog.superponible.com/2013/01/12/christmas-2012-hacking-challenge/">Continue reading &#8594;</a>]]></description>
				<content:encoded><![CDATA[<p>Ed Skoudis and SANS&#8217;s holiday hacking challenges are something fun I look forward to every year.  They&#8217;re always entertaining a good little test of security skills.  This year&#8217;s <a href="http://pen-testing.sans.org/blog/pen-testing/2012/12/07/holiday-challenge-2012" title="The Year Without a Santa... Hack">&#8220;The Year Without a Santa&#8230; Hack&#8221;</a> was no different.  I don&#8217;t think I&#8217;ve ever seen &#8220;The Year Without a Santa,&#8221; but the Control Systems twist for the challenge was cool.</p>
<p>Since the submission deadline has passed, I thought I&#8217;d post my report here.  Looking forward to seeing the results, hopefully this coming week.</p>
<p><a href='http://blog.superponible.com/wp-content/uploads/2013/01/2012HolidayHackChallenge.pdf'>2012 Holiday Hack Challenge</a></p>
]]></content:encoded>
			<wfw:commentRss>http://blog.superponible.com/2013/01/12/christmas-2012-hacking-challenge/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Christmas 2011 Hacking Challenge</title>
		<link>http://blog.superponible.com/2012/07/15/christmas-2011-hacking-challenge/</link>
		<comments>http://blog.superponible.com/2012/07/15/christmas-2011-hacking-challenge/#comments</comments>
		<pubDate>Sun, 15 Jul 2012 21:12:16 +0000</pubDate>
		<dc:creator>superponible</dc:creator>
				<category><![CDATA[Challenges]]></category>
		<category><![CDATA[Forensics]]></category>

		<guid isPermaLink="false">http://blog.superponible.com/?p=85</guid>
		<description><![CDATA[I spent a couple nights over my Christmas vacation working on the Christmas 2011 Hacking Challenge on the SANS Pen Test blog. This is the first year I&#8217;ve done the challenge, and I had a lot of fun with it. I may have gone a little overboard with the report, but I wanted to try to make it somewhat realistic. &#8230; <a class="meta-nav" href="http://blog.superponible.com/2012/07/15/christmas-2011-hacking-challenge/">Continue reading &#8594;</a>]]></description>
				<content:encoded><![CDATA[<p>I spent a couple nights over my Christmas vacation working on the <a href="http://pen-testing.sans.org/holiday-challenge">Christmas 2011 Hacking Challenge</a> on the <a href="http://pen-testing.sans.org/">SANS Pen Test blog</a>.  This is the first year I&#8217;ve done the challenge, and I had a lot of fun with it.  I may have gone a little overboard with the report, but I wanted to try to make it somewhat realistic.</p>
<p>I ended up getting honorable mention when the <a href="http://pen-testing.sans.org/blog/2012/01/26/holiday-challenge-2011-winners-answers">results</a> were posted.  I was pretty happy with that, even though it meant I didn&#8217;t win a copy of Ed Skoudis&#8217;s book.  That wasn&#8217;t a big deal since I ended up winning a copy during NetWars at SANS2012 in Orlando, and I wouldn&#8217;t really need two copies.  I had always meant to post my report when the challenge was over, and I&#8217;m just now getting around to that.</p>
<p>Here&#8217;s a <a href="http://blog.superponible.com/wp-content/uploads/2012/07/2011HolidayHackChallenge.pdf">link to my report</a> and here is what Ed had to say about it in the results post:</p>
<blockquote><p>Dave Lassalle: Your report was very detailed, and was a close second. You explained the Apple Software Update component of the attack well, explained all of the fields in the CellLocation table, mentioned the GPS anomalies and the duplicate timestamps, and included a great map showing all of the places. You also extracted and ran the iTunesSetup.exe malware and wrote your own handler for it, which was very impressive. Amazing work, beautifully executed.</p></blockquote>
<p><a href='http://blog.superponible.com/wp-content/uploads/2012/07/2011HolidayHackChallenge.pdf'>2011HolidayHackChallenge</a></p>
]]></content:encoded>
			<wfw:commentRss>http://blog.superponible.com/2012/07/15/christmas-2011-hacking-challenge/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>srch_strings_wrap &#8212; history and examples</title>
		<link>http://blog.superponible.com/2011/11/17/srch_strings_wrap-history-and-examples/</link>
		<comments>http://blog.superponible.com/2011/11/17/srch_strings_wrap-history-and-examples/#comments</comments>
		<pubDate>Thu, 17 Nov 2011 22:45:21 +0000</pubDate>
		<dc:creator>superponible</dc:creator>
				<category><![CDATA[Forensics]]></category>
		<category><![CDATA[dfir]]></category>
		<category><![CDATA[forensics]]></category>
		<category><![CDATA[script]]></category>

		<guid isPermaLink="false">http://blog.superponible.com/?p=24</guid>
		<description><![CDATA[I recently took SANS FOR508 with Rob Lee in Las Vegas.  It was a great class and I highly recommend it to everyone interested in Digital Forensics.  I&#8217;m new to forensics and learned so much from the class. One of the topics covered is using the srch_strings command from the Sleuth Kit on a filesystem image to obtain not just &#8230; <a class="meta-nav" href="http://blog.superponible.com/2011/11/17/srch_strings_wrap-history-and-examples/">Continue reading &#8594;</a>]]></description>
				<content:encoded><![CDATA[<p>I recently took <a href="http://www.sans.org/security-training/advanced-computer-forensic-analysis-incident-response-98-mid">SANS FOR508</a> with Rob Lee in Las Vegas.  It was a great class and I highly recommend it to everyone interested in Digital Forensics.  I&#8217;m new to forensics and learned so much from the class.</p>
<p>One of the topics covered is using the srch_strings command from the <a href="http://www.sleuthkit.org/">Sleuth Kit</a> on a filesystem image to obtain not just the strings within the file, but also the byte offset of each string.  This is done using the &#8220;-t d&#8221; option:</p>
<pre>$ srch_strings -a -t d sda1.img
 7208 vmlinuz-2.2.14-5.0
 7336 System.map-2.2.14-5.0smp
 7464 module-info-2.2.14-5.0
 262176 lost+found
 262196 kernel.h
 262212 System.map-2.2.14-5.0
 262244 module-info-2.2.14-5.0</pre>
<p>Then, after obtaining the block size of the filesystem using fsstat, we figure out which block each of these strings is in.  For example, this is an image of a filesystem with 1024 byte blocks, so divide each byte offset by 1024:</p>
<pre>Block  String
 7     vmlinuz-2.2.14-5.0
 7     System.map-2.2.14-5.0smp
 7     module-info-2.2.14-5.0
 256   lost+found
 256   kernel.h
 256   System.map-2.2.14-5.0
 256   module-info-2.2.14-5.0</pre>
<p>During class, I got tired of opening the calculator to figure out these blocks, so I came up with a little one liner to do everything at once:</p>
<pre>$ strings -a -t d sda1.img | tee file | awk '{print $1"/1024"}' | bc | paste - file
7       7208 vmlinuz-2.2.14-5.0
7       7336 System.map-2.2.14-5.0smp
7       7464 module-info-2.2.14-5.0
256     262176 lost+found
256     262196 kernel.h
256     262212 System.map-2.2.14-5.0
256     262244 module-info-2.2.14-5.0</pre>
<p>Eventually, I got tired of typing that out and turned it into a script after getting back home after class.  I emailed Rob Lee about it and he put me in touch with Hal Pomeranz, who had been working on a similar script.  Hal and I had some other ideas of where this could be taken, and that&#8217;s what eventually became <a href="https://github.com/superponible/Search-Strings-Extension">srch_strings_wrap</a>.</p>
<p>In a <a href="http://blog.superponible.com/2011/11/17/srch_strings_wrap-forensics-tool/">previous post</a>, I gave an overview of the command line options and functionality, so now I&#8217;d just like to show some examples.<span id="more-24"></span></p>
<p>As I said in the overview, if you just supply the same command line options as you would to srch_strings, srch_strings_wrap will give the same output:</p>
<pre>$ srch_strings_wrap -a -t d sda1.img
 7208 vmlinuz-2.2.14-5.0
 7336 System.map-2.2.14-5.0smp
 7464 module-info-2.2.14-5.0
 262176 lost+found
 262196 kernel.h
 262212 System.map-2.2.14-5.0
 262244 module-info-2.2.14-5.0</pre>
<p>If you know the blocksize you can specify with the -b option or use -d and it will be determined from <strong>fsstat</strong>.</p>
<pre>$ srch_strings_wrap -a -t d -d sda1.img
OR
$ srch_strings_wrap -a -t d -b 1024 sda1.img
FILENAME_NF	NF	Metadata	A	7	40	7208	vmlinuz-2.2.14-5.0
FILENAME_NF	NF	Metadata	A	7	168	7336	System.map-2.2.14-5.0smp
FILENAME_NF	NF	Metadata	A	7	296	7464	module-info-2.2.14-5.0
/	A	2	A	256	32	262176	lost+found
/	A	2	A	256	52	262196	kernel.h
/	A	2	A	256	68	262212	System.map-2.2.14-5.0
/	A	2	A	256	100	262244	module-info-2.2.14-5.0</pre>
<p>There are a few different output options. To write STDOUT to a file, use &#8220;-w file&#8221;. To suppress STDOUT, use &#8220;-N&#8221;. To print a header line, use &#8220;-H&#8221;, which for the output above would be:</p>
<pre>FILENAME	I_STATUS	INODE	B_STATUS	BLOCK	B_OFFSET	BYTE OFFSET	STRING</pre>
<p>The default delimiter is the tab character, but it can be changed with &#8220;-F delim&#8221; where delim is 1 or more characters to use. Alternatively, &#8220;-C&#8221; can be used to print in CSV format, which will put quotes around the string and escape any quotes within the string.</p>
<pre>"/","A","2","A","256","32","262176","lost+found"</pre>
<p>The default output takes the srch_strings output and prepends the additional columns. Another option is to use &#8220;-O&#8221; which will group all the hits within a single file or inode, if it was found, or the block if not.</p>
<pre>$ srch_strings_wrap -a -t d -d -O sda1.img

IMAGE: sda1.img, PARTITION: N/A, FILE: FILENAME_NF, INODE STATUS: NF, INODE: Metadata, BLOCK: 7
	BLOCK_OFFSET	STRING
	        40 vmlinuz-2.2.14-5.0
	       168 System.map-2.2.14-5.0smp
	       296 module-info-2.2.14-5.0

IMAGE: sda1.img, PARTITION: N/A, FILE: /, INODE STATUS: A, INODE: 2
	FILE_OFFSET	STRING
	        32 lost+found
	        52 kernel.h
	        68 System.map-2.2.14-5.0</pre>
<p>All these commands are using the default &#8220;level&#8221; of 3 which tries to go all the way from the byte offset (level 0) to the block (level 1) to the inode (level 2) to the filename (level 3). The &#8220;-l #&#8221; option can be used to specify a custom level if going all the way to the filename layer is not needed. The output will be adjusted accordingly and the command should run faster at lower levels. Note that &#8220;level 0&#8243; is essentially the same as the basic srch_strings output. Here&#8217;s an example of only going to level 1:</p>
<pre>srch_strings_wrap -a -t d -d -l 1 -H sda1.img
B_STATUS	BLOCK	B_OFFSET	BYTE OFFSET	STRING
A	7	40	7208	vmlinuz-2.2.14-5.0
A	7	168	7336	System.map-2.2.14-5.0smp
A	7	296	7464	module-info-2.2.14-5.0
A	256	32	262176	lost+found
A	256	52	262196	kernel.h</pre>
<p>The -A option can be used to automatically carve any matches into a folder. The default folder is in the current directory and is called <strong>ssw_output</strong>, but it can be changed with the &#8220;-D path&#8221; option.</p>
<pre>$ srch_strings_wrap -a -t d -d -A -N sda1.img
$ ls ssw_output/sda1.img/00/\[root\]/module-info-2.2.14-5.0     
module-info-2.2.14-5.0smp  vmlinux-2.2.14-5.0
ROOTDIR                    vmlinux-2.2.14-5.0smp
System.map-2.2.14-5.0      vmlinuz-2.2.14-5.0</pre>
<p>The file named ROOTDIR is the root directory on the filesystem. The directory structure within ssw_output is &#8220;image_name/partition_number/&#8221; followed by [root] for allocated files, [unallocated] for unallocated files, and [filename unknown] when the filename couldn&#8217;t be found.</p>
<p>All of these examples so far have assumed that the image is a partition or filesystem image. This is the default, but a full disk image can be given as well. The <strong>mmls</strong> command is used to pick the partitions and their offsets. The partition number will be prepended in the output and &#8220;00&#8243; will be used if it&#8217;s just a filesystem image.</p>
<pre>$ srch_strings_wrap -a -t d -d -A sda.img
00	FILENAME_NF	NF	Metadata	A	7	40	7208	vmlinuz-2.2.14-5.0
00	FILENAME_NF	NF	Metadata	A	7	168	7336	System.map-2.2.14-5.0smp
00	FILENAME_NF	NF	Metadata	A	7	296	7464	module-info-2.2.14-5.0
00	/	A	2	A	256	32	262176	lost+found
00	/	A	2	A	256	52	262196	kernel.h</pre>
<p>Autocarving the whole image may match on many files, so srch_strings_wrap accepts &#8220;-g string&#8221; or &#8220;-G file&#8221; where string is a grep regex or file contains a list of strings to pass to &#8220;grep -f&#8221;. Case insensitivity can be specified with &#8220;-i&#8221;. The grep commands can be used with or without the &#8220;-A&#8221; option.</p>
<pre>$ /srch_strings_wrap -a -t d -d -g f.*le sda1.img | head
/System.map-2.2.14-5.0	A	13	A	269	1003	276459	c0106e91 t mtrr_file_add
/System.map-2.2.14-5.0	A	13	A	270	4	276484	c0106f03 t mtrr_file_del
/System.map-2.2.14-5.0	A	13	A	279	123	285819	c0112e72 t copy_files
/System.map-2.2.14-5.0	A	13	A	280	896	287616	c0116ff0 T exit_files</pre>
<p>The last option is &#8220;-P&#8221; which, rather than an image, accepts the output of a previously run srch_strings command. This would be useful if you wanted to run srch_strings on an entire image just once, then wanted to run multiple different &#8220;grep&#8221; searches on those results. The precomputed file is cat&#8217;d in via the pipeline. The &#8220;-I image&#8221; is also required where image is the image file that srch_strings was run against:</p>
<pre>$ srch_strings_wrap -a -t d sda1.img &gt; sda1.asc
$ cat sda1.asc | srch_strings_wrap -P -I sda1.img
FILENAME_NF	NF	Metadata	A	7	40	7208	vmlinuz-2.2.14-5.0
FILENAME_NF	NF	Metadata	A	7	168	7336	System.map-2.2.14-5.0smp
FILENAME_NF	NF	Metadata	A	7	296	7464	module-info-2.2.14-5.0
/	A	2	A	256	32	262176	lost+found
/	A	2	A	256	52	262196	kernel.h
$ cat sda1.asc | srch_strings_wrap -P -I sda1.img -g f.*le &gt; sda1.asc.f_le
$ cat sda1.asc | srch_strings_wrap -P -I sda1.img -g kernel &gt; sda1.asc.kernel</pre>
<p>That covers all of the current functionality. I hope people find it useful. If anyone has any suggestions for improvement or finds any bugs, let me know at dave at this domain.</p>
]]></content:encoded>
			<wfw:commentRss>http://blog.superponible.com/2011/11/17/srch_strings_wrap-history-and-examples/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>srch_strings_wrap &#8212; forensics tool</title>
		<link>http://blog.superponible.com/2011/11/17/srch_strings_wrap-forensics-tool/</link>
		<comments>http://blog.superponible.com/2011/11/17/srch_strings_wrap-forensics-tool/#comments</comments>
		<pubDate>Thu, 17 Nov 2011 22:40:18 +0000</pubDate>
		<dc:creator>superponible</dc:creator>
				<category><![CDATA[Forensics]]></category>
		<category><![CDATA[dfir]]></category>
		<category><![CDATA[forensics]]></category>

		<guid isPermaLink="false">http://blog.superponible.com/?p=16</guid>
		<description><![CDATA[I wrote a tool called srch_strings_wrap (available at GitHub &#8211; https://github.com/superponible/Search-Strings-Extension) that extends the functionality of the srch_strings command in the Sleuth Kit.  The idea came from repeatedly having to determine the block that corresponded to the results of srch_strings during FOR508.  I contacted Rob Lee about what I had written and he put me in touch with Hal Pomeranz, &#8230; <a class="meta-nav" href="http://blog.superponible.com/2011/11/17/srch_strings_wrap-forensics-tool/">Continue reading &#8594;</a>]]></description>
				<content:encoded><![CDATA[<p>I wrote a tool called <strong>srch_strings_wrap</strong> (available at <a href="https://github.com/superponible/Search-Strings-Extension">GitHub &#8211; https://github.com/superponible/Search-Strings-Extension</a>) that extends the functionality of the <strong>srch_strings</strong> command in the <a href="http://www.sleuthkit.org/">Sleuth Kit</a>.  The idea came from repeatedly having to determine the block that corresponded to the results of srch_strings during FOR508.  I contacted Rob Lee about what I had written and he put me in touch with Hal Pomeranz, who had a similar script and some other ideas.</p>
<p>There are other scripts in my repository that are previous versions of this script, but they are not as fully functional as srch_strings_wrap.</p>
<p>The original srch_strings will pull out the strings within a file and gives the byte offset if requested.  My script srch_strings_wrap will obtain the byte offset, but also will use that byte offset to determine, if available, the block, inode, and filename that string is in.  Several command line options exists for filtering results, modifying output, and automatically carving matched files/inodes/blocks.</p>
<p>Currently, the command line options include:</p>
<p style="padding-left: 30px;">If no special options are given, srch_strings_wrap can be used in place of srch_strings.</p>
<p style="padding-left: 30px;">The blocksize of the filesystem can be specified (-b) or automatically determined from the image (-d).  Multiple filesystem images can be given as arguments, but only one full disk image can be specified.  The output can be grouped by file/inode/block (-O) or printed out line by line (default).  It supports custom delimiters (-F) and can output to CSV (-C).  Output can be written, if desired with a header (-H), to a file (-w), to standard out (default), or not at all (-N).  Grep terms can be passed on the command line (-g) or in a dirty word file (-G), with case insensitivity (-i).</p>
<p style="padding-left: 30px;">If full lookups to the filename layer are not needed, the level can be specified to decrease runtime: byte (-l0, no different from &#8220;srch_strings -t d&#8221;), block (-l1), inode (-l2), and filename (-l3, the default).  There is an option to autocarve (-A) which will carve out all matching strings at the highest level available.</p>
<p style="padding-left: 30px;">And if multiple grep searches will be conducted, &#8220;<strong>srch_strings -a -t d fs.img &gt; output.asc</strong>&#8221; can be run on an image to capture all the strings and save the output to a file, then -P can be used to accept the output of that file piped in (&#8220;<strong>cat output.asc | srch_strings_wrap -P -I fs.img</strong>&#8220;).</p>
<p>See <a href="http://blog.superponible.com/2011/11/17/srch_strings_wrap-history-and-examples/">my overview post</a> for some more examples and a little history on the tool.  It should be available in future versions of the <a href="http://computer-forensics.sans.org/community/downloads">SANS Investigative Forensics Toolkit (SIFT) Workstation</a>.</p>
<p>* Link to this post: <a href="http://blog.superponible.com/2011/11/17/srch_strings_wrap-forensics-tool/">http://blog.superponible.com/2011/11/17/srch_strings_wrap-forensics-tool/</a><br />
* Link to the examples: <a href="http://blog.superponible.com/2011/11/17/srch_strings_wrap-history-and-examples/">http://blog.superponible.com/2011/11/17/srch_strings_wrap-history-and-examples/<br />
</a> * Link to GitHub repository: <a href="https://github.com/superponible/Search-Strings-Extension">https://github.com/superponible/Search-Strings-Extension</a></p>
<p>&nbsp;</p>
]]></content:encoded>
			<wfw:commentRss>http://blog.superponible.com/2011/11/17/srch_strings_wrap-forensics-tool/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>starting hands</title>
		<link>http://blog.superponible.com/2006/02/07/starting-hands/</link>
		<comments>http://blog.superponible.com/2006/02/07/starting-hands/#comments</comments>
		<pubDate>Tue, 07 Feb 2006 20:55:45 +0000</pubDate>
		<dc:creator>superponible</dc:creator>
				<category><![CDATA[Poker]]></category>
		<category><![CDATA[poker]]></category>

		<guid isPermaLink="false">http://blog.superponible.com/?p=13</guid>
		<description><![CDATA[Time for my quarterly poker related post. I created a single page with tables of the starting hand strategies recommended by Abdul Jalib and the ones for Tight and Loose games in Small Stakes Hold &#8216;Em. I thought I could do this and figure out why I&#8217;m playing so tight (and losing so much), but it doesn&#8217;t seem to be &#8230; <a class="meta-nav" href="http://blog.superponible.com/2006/02/07/starting-hands/">Continue reading &#8594;</a>]]></description>
				<content:encoded><![CDATA[<p>Time for my quarterly poker related post. I created a single page with <a title="tables" href="http://www.superponible.com/startinghands.html" target="_blank">tables</a> of the starting hand strategies recommended by Abdul Jalib and the ones for Tight and Loose games in Small Stakes Hold &#8216;Em.</p>
<p>I thought I could do this and figure out why I&#8217;m playing so tight (and losing so much), but it doesn&#8217;t seem to be helping. I don&#8217;t know what my problem is.</p>
]]></content:encoded>
			<wfw:commentRss>http://blog.superponible.com/2006/02/07/starting-hands/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>WSOP versus Inflation</title>
		<link>http://blog.superponible.com/2005/06/21/wsop-versus-inflation/</link>
		<comments>http://blog.superponible.com/2005/06/21/wsop-versus-inflation/#comments</comments>
		<pubDate>Tue, 21 Jun 2005 19:47:33 +0000</pubDate>
		<dc:creator>superponible</dc:creator>
				<category><![CDATA[Poker]]></category>
		<category><![CDATA[poker]]></category>
		<category><![CDATA[wsop]]></category>

		<guid isPermaLink="false">http://blog.superponible.com/?p=6</guid>
		<description><![CDATA[Iggy&#8217;s post got me wondering how the $10,000 WSOP Main Event buy-in has compared against inflation over the years, so I found a conversion table and created this spreadsheet. I guess it&#8217;s not so surprising that the Plaza&#8217;s $50,000 buy-in event only had 11 entrants, since that&#8217;s comparable in today&#8217;s money to the $10,000 buy-in back in 1972. Year CF* &#8230; <a class="meta-nav" href="http://blog.superponible.com/2005/06/21/wsop-versus-inflation/">Continue reading &#8594;</a>]]></description>
				<content:encoded><![CDATA[<p>Iggy&#8217;s <a href="http://guinnessandpoker.blogspot.com/2005/05/let-me-mention-one-thing-i-have-lot-of.html">post</a> got me wondering how the <a href="http://www.worldseriesofpoker.com/">$10,000 WSOP Main Event</a> buy-in has compared against inflation over the years, so I found a conversion table and created this spreadsheet.</p>
<p>I guess it&#8217;s not so surprising that the <a href="http://www.cardplayer.com/poker-tournaments/event.php?id=1597&amp;screen=result">Plaza&#8217;s $50,000 buy-in event</a> only had 11 entrants, since that&#8217;s comparable in today&#8217;s money to the $10,000 buy-in back in 1972.<span id="more-6"></span></p>
<table border="1" cellspacing="1" cellpadding="1" width="100%" style="font-size:smaller;">
<tbody>
<tr>
<td align="CENTER" height="20"><strong>Year</strong></td>
<td align="CENTER"><strong>CF*</strong></td>
<td align="CENTER"><strong>Buy-in</strong></td>
<td align="CENTER"><strong>Buy-in<br />(2005$)</strong></td>
<td align="CENTER"><strong>Winner<br />($)</strong></td>
<td align="CENTER"><strong>Winner<br />(2005$)</strong></td>
<td align="CENTER"><strong>Field</strong></td>
<td align="CENTER"><strong>Prize Pool<br />($)</strong></td>
<td align="CENTER"><strong>Prize Pool<br />(2005$)</strong></td>
</tr>
<tr>
<td align="CENTER" height="20">1970</td>
<td align="RIGHT">0.201</td>
<td align="CENTER">**</td>
<td align="CENTER">**</td>
<td align="CENTER">**</td>
<td align="CENTER">**</td>
<td align="RIGHT">7</td>
<td align="CENTER">**</td>
<td align="CENTER">**</td>
</tr>
<tr>
<td align="CENTER" height="20">1971</td>
<td align="RIGHT">0.209</td>
<td align="RIGHT">5,000</td>
<td align="RIGHT">23,900</td>
<td align="RIGHT">30,000</td>
<td align="RIGHT">144,000</td>
<td align="RIGHT">6</td>
<td align="RIGHT">30,000</td>
<td align="RIGHT">144,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1972</td>
<td align="RIGHT">0.216</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">46,300</td>
<td align="RIGHT">80,000</td>
<td align="RIGHT">370,000</td>
<td align="RIGHT">8</td>
<td align="RIGHT">80,000</td>
<td align="RIGHT">370,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1973</td>
<td align="RIGHT">0.230</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">43,500</td>
<td align="RIGHT">130,000</td>
<td align="RIGHT">565,000</td>
<td align="RIGHT">13</td>
<td align="RIGHT">130,000</td>
<td align="RIGHT">565,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1974</td>
<td align="RIGHT">0.255</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">39,200</td>
<td align="RIGHT">160,000</td>
<td align="RIGHT">627,000</td>
<td align="RIGHT">16</td>
<td align="RIGHT">160,000</td>
<td align="RIGHT">627,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1975</td>
<td align="RIGHT">0.278</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">36,000</td>
<td align="RIGHT">210,000</td>
<td align="RIGHT">755,000</td>
<td align="RIGHT">21</td>
<td align="RIGHT">210,000</td>
<td align="RIGHT">755,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1976</td>
<td align="RIGHT">0.294</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">34,000</td>
<td align="RIGHT">220,000</td>
<td align="RIGHT">748,000</td>
<td align="RIGHT">22</td>
<td align="RIGHT">220,000</td>
<td align="RIGHT">748,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1977</td>
<td align="RIGHT">0.313</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">31,900</td>
<td align="RIGHT">340,000</td>
<td align="RIGHT">1,086,000</td>
<td align="RIGHT">34</td>
<td align="RIGHT">340,000</td>
<td align="RIGHT">1,086,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1978</td>
<td align="RIGHT">0.337</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">29,700</td>
<td align="RIGHT">210,000</td>
<td align="RIGHT">623,000</td>
<td align="RIGHT">31</td>
<td align="RIGHT">310,000</td>
<td align="RIGHT">920,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1979</td>
<td align="RIGHT">0.375</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">26,700</td>
<td align="RIGHT">270,000</td>
<td align="RIGHT">720,000</td>
<td align="RIGHT">54</td>
<td align="RIGHT">540,000</td>
<td align="RIGHT">1,440,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1980</td>
<td align="RIGHT">0.426</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">23,500</td>
<td align="RIGHT">385,000</td>
<td align="RIGHT">904,000</td>
<td align="RIGHT">73</td>
<td align="RIGHT">730,000</td>
<td align="RIGHT">1,714,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1981</td>
<td align="RIGHT">0.470</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">21,300</td>
<td align="RIGHT">375,000</td>
<td align="RIGHT">798,000</td>
<td align="RIGHT">75</td>
<td align="RIGHT">750,000</td>
<td align="RIGHT">1,596,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1982</td>
<td align="RIGHT">0.499</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">20,000</td>
<td align="RIGHT">520,000</td>
<td align="RIGHT">1,042,000</td>
<td align="RIGHT">104</td>
<td align="RIGHT">1,040,000</td>
<td align="RIGHT">2,084,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1983</td>
<td align="RIGHT">0.515</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">19,400</td>
<td align="RIGHT">580,000</td>
<td align="RIGHT">1,126,000</td>
<td align="RIGHT">108</td>
<td align="RIGHT">1,080,000</td>
<td align="RIGHT">2,097,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1984</td>
<td align="RIGHT">0.537</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">18,600</td>
<td align="RIGHT">660,000</td>
<td align="RIGHT">1,229,000</td>
<td align="RIGHT">132</td>
<td align="RIGHT">1,320,000</td>
<td align="RIGHT">2,458,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1985</td>
<td align="RIGHT">0.556</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">18,000</td>
<td align="RIGHT">700,000</td>
<td align="RIGHT">1,259,000</td>
<td align="RIGHT">140</td>
<td align="RIGHT">1,400,000</td>
<td align="RIGHT">2,518,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1986</td>
<td align="RIGHT">0.567</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">17,600</td>
<td align="RIGHT">570,000</td>
<td align="RIGHT">1,005,000</td>
<td align="RIGHT">141</td>
<td align="RIGHT">1,410,000</td>
<td align="RIGHT">2,487,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1987</td>
<td align="RIGHT">0.587</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">17,000</td>
<td align="RIGHT">625,000</td>
<td align="RIGHT">1,065,000</td>
<td align="RIGHT">156</td>
<td align="RIGHT">1,560,000</td>
<td align="RIGHT">2,658,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1988</td>
<td align="RIGHT">0.612</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">16,300</td>
<td align="RIGHT">700,000</td>
<td align="RIGHT">1,144,000</td>
<td align="RIGHT">167</td>
<td align="RIGHT">1,670,000</td>
<td align="RIGHT">2,729,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1989</td>
<td align="RIGHT">0.641</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">15,600</td>
<td align="RIGHT">755,000</td>
<td align="RIGHT">1,178,000</td>
<td align="RIGHT">178</td>
<td align="RIGHT">1,780,000</td>
<td align="RIGHT">2,777,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1990</td>
<td align="RIGHT">0.676</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">14,800</td>
<td align="RIGHT">895,000</td>
<td align="RIGHT">1,324,000</td>
<td align="RIGHT">194</td>
<td align="RIGHT">1,940,000</td>
<td align="RIGHT">2,870,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1991</td>
<td align="RIGHT">0.704</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">14,200</td>
<td align="RIGHT">1,000,000</td>
<td align="RIGHT">1,420,000</td>
<td align="RIGHT">215</td>
<td align="RIGHT">2,150,000</td>
<td align="RIGHT">3,054,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1992</td>
<td align="RIGHT">0.725</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">13,800</td>
<td align="RIGHT">1,000,000</td>
<td align="RIGHT">1,379,000</td>
<td align="RIGHT">201</td>
<td align="RIGHT">2,010,000</td>
<td align="RIGHT">2,772,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1993</td>
<td align="RIGHT">0.747</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">13,400</td>
<td align="RIGHT">1,000,000</td>
<td align="RIGHT">1,339,000</td>
<td align="RIGHT">220</td>
<td align="RIGHT">2,200,000</td>
<td align="RIGHT">2,945,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1994</td>
<td align="RIGHT">0.766</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">13,100</td>
<td align="RIGHT">1,000,000</td>
<td align="RIGHT">1,305,000</td>
<td align="RIGHT">268</td>
<td align="RIGHT">2,680,000</td>
<td align="RIGHT">3,499,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1995</td>
<td align="RIGHT">0.788</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">12,700</td>
<td align="RIGHT">1,000,000</td>
<td align="RIGHT">1,269,000</td>
<td align="RIGHT">273</td>
<td align="RIGHT">2,730,000</td>
<td align="RIGHT">3,464,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1996</td>
<td align="RIGHT">0.811</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">12,300</td>
<td align="RIGHT">1,000,000</td>
<td align="RIGHT">1,233,000</td>
<td align="RIGHT">295</td>
<td align="RIGHT">2,950,000</td>
<td align="RIGHT">3,637,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1997</td>
<td align="RIGHT">0.830</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">12,000</td>
<td align="RIGHT">1,000,000</td>
<td align="RIGHT">1,205,000</td>
<td align="RIGHT">312</td>
<td align="RIGHT">3,120,000</td>
<td align="RIGHT">3,759,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1998</td>
<td align="RIGHT">0.843</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">11,900</td>
<td align="RIGHT">1,000,000</td>
<td align="RIGHT">1,186,000</td>
<td align="RIGHT">350</td>
<td align="RIGHT">3,500,000</td>
<td align="RIGHT">4,152,000</td>
</tr>
<tr>
<td align="CENTER" height="20">1999</td>
<td align="RIGHT">0.861</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">11,600</td>
<td align="RIGHT">1,000,000</td>
<td align="RIGHT">1,161,000</td>
<td align="RIGHT">393</td>
<td align="RIGHT">3,930,000</td>
<td align="RIGHT">4,564,000</td>
</tr>
<tr>
<td align="CENTER" height="20">2000</td>
<td align="RIGHT">0.890</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">11,200</td>
<td align="RIGHT">1,500,000</td>
<td align="RIGHT">1,685,000</td>
<td align="RIGHT">512</td>
<td align="RIGHT">5,120,000</td>
<td align="RIGHT">5,753,000</td>
</tr>
<tr>
<td align="CENTER" height="20">2001</td>
<td align="RIGHT">0.916</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">10,900</td>
<td align="RIGHT">1,500,000</td>
<td align="RIGHT">1,638,000</td>
<td align="RIGHT">612</td>
<td align="RIGHT">6,120,000</td>
<td align="RIGHT">6,681,000</td>
</tr>
<tr>
<td align="CENTER" height="20">2002</td>
<td align="RIGHT">0.930</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">10,800</td>
<td align="RIGHT">2,000,000</td>
<td align="RIGHT">2,151,000</td>
<td align="RIGHT">631</td>
<td align="RIGHT">6,310,000</td>
<td align="RIGHT">6,785,000</td>
</tr>
<tr>
<td align="CENTER" height="20">2003</td>
<td align="RIGHT">0.951</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">10,500</td>
<td align="RIGHT">2,500,000</td>
<td align="RIGHT">2,629,000</td>
<td align="RIGHT">839</td>
<td align="RIGHT">8,390,000</td>
<td align="RIGHT">8,822,000</td>
</tr>
<tr>
<td align="CENTER" height="20">2004</td>
<td align="RIGHT">0.977</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">10,200</td>
<td align="RIGHT">5,000,000</td>
<td align="RIGHT">5,118,000</td>
<td align="RIGHT">2,576</td>
<td align="RIGHT">25,760,000</td>
<td align="RIGHT">26,366,000</td>
</tr>
<tr>
<td align="CENTER" height="20">2005</td>
<td align="RIGHT">1.000</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">10,000</td>
<td align="RIGHT">10M?</td>
<td align="RIGHT">10M?</td>
<td align="RIGHT">6,000**</td>
<td align="RIGHT">60M?</td>
<td align="RIGHT">60M?</td>
</tr>
</tbody>
</table>
<p><strong>Notes:</strong><br />
* &#8212; Conversion Factor<br />
** &#8212; The players voted on the winner this year.</p>
<p>The WSOP was a winner-take-all event from 1971 until 1978. In 1978, the winner received 2/3 of the prize pool. This was reduced to 50% from 1979 through 1985, then reduced again to 40% from 1986 through 1990. Starting in 1991, first place prize money was set at $1 million until recent years when the size has exploded.<img src="http://www.superponible.com/dot.jpg" alt="" /></p>
<hr />
<p>The information in this table was gathered from:</p>
<ul>
<li>An <a href="http://guinnessandpoker.blogspot.com/2005/05/let-me-mention-one-thing-i-have-lot-of.html">uberpost</a> by <a href="http://guinnessandpoker.blogspot.com/">Iggy</a>.</li>
<li>The <a href="http://oregonstate.edu/dept/pol_sci/fac/sahr/sahr.htm#_Download_Conversion_Factors_1">conversion factors</a> found in this Excel spreadsheet.</li>
<li>The <a href="http://en.wikipedia.org/wiki/World_series_of_poker">World Series of Poker</a> entry on <a href="http://www.wikipedia.org/">Wikipedia</a>.</li>
<li>The <a href="http://www.cardplayer.com/world_series_of_poker/world_series_poker_results.php">World Series of Poker Results</a> page on <a href="http://www.cardplayer.com/">Card Player&#8217;s</a> website.</li>
</ul>
<p>&nbsp;</p>
]]></content:encoded>
			<wfw:commentRss>http://blog.superponible.com/2005/06/21/wsop-versus-inflation/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
