<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/">
	<channel>
		<title>Won&#x27;t 280 billion of any operation take too long to realistically execute?</title>
		<link>/blogentry/184155</link>
		<atom:link href="https://www.lotterypost.com/rss/blogcomments/184155" rel="self" type="application/rss+xml" />
		<description>hypersoniq's Blog: Won&#x27;t 280 billion of any operation take too long to realistically execute?</description>
		<dc:language>en-us</dc:language>
		<generator>Lottery Post RSS Generator</generator>
		<item>
			<title>Comment #1</title>
			<link>/blogentry/184155#c260954</link>
			<guid isPermaLink="true">/blogentry/184155#c260954</guid>
			<pubDate>Mon, 25 Mar 2024 03:38:43 GMT</pubDate>
			<dc:creator>hypersoniq</dc:creator>
			<description><![CDATA[<p>Minimizing overhead does actually make a difference. With a headless configuration there is no overhead on keyboard and mouse interrupts. There is no video signal to send to a monitor.&#x3c;br /&#x3e;With an email alert function I can receive notifications when each list completes and also full text error messages if it hangs up. &#x3c;br /&#x3e;There are other options on the table as well, such as buying a cluster of PIs to divide the processing, but I must exhaust all other options for a clean run on one machine.... &#x5b;&#xa0;<a href="/blogentry/184155#c260954">More</a>&#xa0;&#x5d;</p>]]></description>
			<category>hypersoniq</category>
		</item>
		<item>
			<title>Original Blog Entry: Won&#x27;t 280 billion of any operation take too long to realistically execute?</title>
			<link>/blogentry/184155</link>
			<guid isPermaLink="true">/blogentry/184155</guid>
			<pubDate>Sun, 24 Mar 2024 03:29:51 GMT</pubDate>
			<dc:creator>hypersoniq</dc:creator>
			<description><![CDATA[<p>If the core algorithm took even 1 second to run, the process would take almost 8,879 years to run... fortunately the algorithm, both checking for a match and checking the top 10 can be performed thousands of times in 1 second.<br /><br />An accurate estimate still needs to be made with a timer on a limited set of maybe 10,000<br /><br />The time of the algorithm is of utmost importance, so the time consuming initial operations are only done once per run... loading a csv file into a pandas data frame... the actual match and sort are the heartbeat of the operation and are being optimized to be run thousands of times per second.<br /><br />Even with the optimizers in place, the estimate is now measured in months. How many months depends on my ability to make the code as streamlined as possible.... &#x5b;&#xa0;<a href="/blogentry/184155">More</a>&#xa0;&#x5d;</p>]]></description>
			<category>Blog Entry</category>
			<category>hypersoniq</category>
			<wfw:comment>https://www.lotterypost.com/blogentry/184155</wfw:comment>
		</item>
	</channel>
</rss>

