Bitcoin Forum
December 05, 2021, 09:40:40 AM *
News: Latest Bitcoin Core release: 22.0 [Torrent]
 
   Home   Help Search Login Register More  
Pages: « 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 [42] 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 ... 123 »
  Print  
Author Topic: [ANN][GAP] Gapcoin - Prime Gap Search - New Math Algo - CPU / GPU - Zero Premine  (Read 285041 times)
drumingspz
Sr. Member
****
Offline Offline

Activity: 392
Merit: 250



View Profile
November 18, 2014, 04:13:31 PM
 #821

Where is the working cuda miner binaries + source code located?

There isn't a cuda miner yet - that's why there is still a bounty.  The bounty that was paid was for the first merit within the top 20.




░░░░░░░▄▄█████▄▄▄░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
░░░░▄██████████████▄░░░░░░░░░░░░░░░░░░░▄██████▄▄░░░░░░
░░▄██████████████████▄░░░░░░░░░░░░░░▄████████████▄░░░░
██████████████████████▄░░░░░░░░░░▄████████████████▄░░
▄███████████████████████▄░░░░░░░▄████████████████████
██████████████████████████▄░░░▄███████████████████████
█████████████████████████████████████████████████████▀
█████████████████████████▀░░░░░▀████████████████████▀
██████████████████████▀░░░░░░░░░▀█████████████████▀░░
░░███████████████████▀░░░░░░░░░░░░░░▀████████████▀░░░░
░░░▀███████████████▀░░░░░░░░░░░░░░░░░░▀▀██████▀▀░░░░░░
░░░░░░▀█████████▀░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
mira  ▀▀
██
 
██
   
██
   
██
   
██
   
██
▄▄
Cryptocurrencies have never been so easy
▬ ● ● ● ● ▬▬▬▬▬▬▬ ● ● ● ● ▬▬▬▬▬▬▬ ● ● ● ● ▬▬▬▬▬▬▬ ● ● ● ● ▬▬▬▬▬▬▬ ● ● ● ● ▬▬▬▬▬▬ ● ● ● ● ▬▬▬▬▬▬ ● ● ● ● ▬▬▬▬▬▬ ● ● ● ● ▬
Facebook LinkedIn Twitter White Paper Google+
▀▀
██
 
██
   
██
   
██
   
██
   
██
▄▄
 
[/center]
1638697240
Hero Member
*
Offline Offline

Posts: 1638697240

View Profile Personal Message (Offline)

Ignore
1638697240
Reply with quote  #2

1638697240
Report to moderator
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction. Advertise here.
1638697240
Hero Member
*
Offline Offline

Posts: 1638697240

View Profile Personal Message (Offline)

Ignore
1638697240
Reply with quote  #2

1638697240
Report to moderator
vidarn
Newbie
*
Offline Offline

Activity: 20
Merit: 1


View Profile
November 18, 2014, 05:19:02 PM
 #822

11   18508   P241 = 227939*587#/11370 - 6508   33.4563   Dana Jacobsen   2014
12   1356   P18 = 401429925999153707   33.4536   Donald E. Knuth   2006
13   7384   P97 = 1719070901...   33.3228   Gapcoin   2014
14   1358   P18 = 523255220614645319   33.2853   Siegfried Herzog & Tomás Oliveira e Silva   2007
15   1476   P20 = 18227591035187773493   33.2811   Bertil Nyman   2013

Wow! Imagine being on a computing merit list next to Donald E. Knuth!
Do you guys realize what an honor that is??
Wink
blizzen
Sr. Member
****
Offline Offline

Activity: 280
Merit: 250



View Profile
November 18, 2014, 07:56:04 PM
 #823


Top-20 merits
Rank   Size   Gap start   Merit   Discoverer   Year
1   66520   P816 = 1931*1933#/7230 - 30244   35.4245   Michiel Jansen   2012
2   1476   P19 = 1425172824437699411   35.3103   Tomás Oliveira e Silva   2009
3   1442   P18 = 804212830686677669   34.9757   Siegfried Herzog & Tomás Oliveira e Silva   2005
4   1550   P20 = 18361375334787046697   34.9439   Bertil Nyman   2014
5   1530   P20 = 17678654157568189057   34.5225   Bertil Nyman   2014
6   1454   P19 = 3219107182492871783   34.1189   Silvio Pardi & Tomás Oliveira e Silva   2011
7   1370   P18 = 418032645936712127   33.7652   Donald E. Knuth   2006
8   4616   P60 = 4138026610...   33.6265   Helmut Spielauer   2014
9   1490   P20 = 17849040361018364489   33.6127   Bertil Nyman   2011
10   1440   P19 = 4253027105513399527   33.5710   Leif Leonhardy   2014
11   18508   P241 = 227939*587#/11370 - 6508   33.4563   Dana Jacobsen   2014
12   1356   P18 = 401429925999153707   33.4536   Donald E. Knuth   2006
13   7384   P97 = 1719070901...   33.3228   Gapcoin   2014

[/quote]

Congrats! GAP
j0nn9
Full Member
***
Offline Offline

Activity: 177
Merit: 153


View Profile WWW
November 18, 2014, 09:08:38 PM
 #824

Voting about changing the block reward halving:

Every option is represented by Gapcoin address.
Every 0.00000001 GAP (1 Satoshi) counts as one vote.

The Gapcoin address with the most GAP will win the voting.
Then we will make a hard fork (or not) according to the chosen option.


The options are: halving the block reward

  • every 2 years (no changes, no hard fork)   GSJw8qfMBTrX1p9rRexuek4zXjb8ay3Nev
  • every year   GZHgCFHCwQYZhSqmGAJ7rKLYyo8fBEkgdj
  • every half year   GRNwEjBXhr3ccYV78LKRuzjt9howGVwx9c
  • every three months   GLjNmmTZiSxTyFHXAFBjXefmFNWUhTfXjk


Or reducing the block reward every block to effectively halve:

  • every 2 years   GU4oUgmeAC7T9DkgmrD1TjqcgHsdgXAhVU
  • every year   GHxr8JUNtaenHvrgqmt9oXTtZA8dA8DnBH
  • every half year   GRPwr2TiDNNBBUWa36os4Srppy4QdXxa9i
  • every three months   GKKcAv7UyJNLWsSPEwLRuYLBJjkRKvdp5k

The voting will end in one week (18.11.2014 10:00 PM UTC)

After the end of the voting, the funds of these addresses will be added to the
bounty for the first merit which breaks the world record.

Current status: http://coinia.net/gapcoin/voiting.php

One hour left!

Gapcoin - The largest, decentralized prime gap search
j0nn9
Full Member
***
Offline Offline

Activity: 177
Merit: 153


View Profile WWW
November 18, 2014, 10:22:24 PM
 #825

Voting about changing the block reward halving:

Every option is represented by Gapcoin address.
Every 0.00000001 GAP (1 Satoshi) counts as one vote.

The Gapcoin address with the most GAP will win the voting.
Then we will make a hard fork (or not) according to the chosen option.


The options are: halving the block reward

  • every 2 years (no changes, no hard fork)   GSJw8qfMBTrX1p9rRexuek4zXjb8ay3Nev
  • every year   GZHgCFHCwQYZhSqmGAJ7rKLYyo8fBEkgdj
  • every half year   GRNwEjBXhr3ccYV78LKRuzjt9howGVwx9c
  • every three months   GLjNmmTZiSxTyFHXAFBjXefmFNWUhTfXjk


Or reducing the block reward every block to effectively halve:

  • every 2 years   GU4oUgmeAC7T9DkgmrD1TjqcgHsdgXAhVU
  • every year   GHxr8JUNtaenHvrgqmt9oXTtZA8dA8DnBH
  • every half year   GRPwr2TiDNNBBUWa36os4Srppy4QdXxa9i
  • every three months   GKKcAv7UyJNLWsSPEwLRuYLBJjkRKvdp5k

The voting will end in one week (18.11.2014 10:00 PM UTC)

After the end of the voting, the funds of these addresses will be added to the
bounty for the first merit which breaks the world record.

Current status: http://coinia.net/gapcoin/voiting.php

One hour left!

So, the voting is over.

To sum it up:

62.15% (971.99000001 gap) voted for every 2 years (no changes, no hard fork)
36.57% (571.99000000 gap) voted for every block - every half year
  1.28% (  20.00000000 gap) voted for every block - every three months

This means: Everything stays as it was.

Like i said, I'll now add the funds of the voting to the bounty for the world record.
This increases the bounty about 1,563.98000001 gap, which is pretty awesome  Grin

Gapcoin - The largest, decentralized prime gap search
crz
Member
**
Offline Offline

Activity: 116
Merit: 10


View Profile
November 18, 2014, 11:07:28 PM
 #826

Hi, I'm crz and I designed for a lot of others coins (Shadowcash, IOC, Cloak..) This one is for gapcoin branding Smiley

Donations welcome at GAP: GdjcBC9vdDrx4bRZRzXaMdSMnuQrghPmC9 Smiley


Branding/Graphics, UI/UX Designer, Front/Back-end Developer. (IRC (freenode): crz)
nonce-pool
Full Member
***
Offline Offline

Activity: 149
Merit: 100


View Profile
November 19, 2014, 01:12:56 AM
 #827

We want to to make the pool a bit more efficient at finding blocks, better for everyone right?
So we are going to raise the difficulty on the ports.

Port 4200 will be switching to a vardiff port on Saturday the 22nd.
This will allow slower miners to be able to submit shares in a timely manner and still accommodate larger miners as well.
For best results users mining on this port should be using unique worker names for each miner.

Port 4205 will will remain a fixed difficulty port, better suited for faster miners or aws users with multiple workers with the same name.

We are going to 'ease' the difficulty up every couple days or so until we can find a happy difficulty.

We expect the shares to the pool will slow eventually by about 50% or more for everyone so don't be alarmed if you don't 'feel' like you are submitting often
enough, the pool pays pplns so your earnings should not change, we will increase the round pplns payout window if necessary.

The are no changes needed to your miners.


agran
Hero Member
*****
Offline Offline

Activity: 910
Merit: 1000


View Profile
November 19, 2014, 09:08:16 AM
 #828

Very bad voting system was. I offered to make the system as in MemoryCoin, but I was misunderstood and it all turned into a competition of skill, "who has time in the last 5 minutes to vote".

QORA | 2ND GEN | NEW SOURCE CODE | QTz6fSV2VNc2wjwwsw57kwQzgQhmGw5idQ
Palmdetroit
Legendary
*
Offline Offline

Activity: 910
Merit: 1000


PHS 50% PoS - Stop mining start minting


View Profile
November 19, 2014, 09:37:30 AM
 #829

Voting about changing the block reward halving:

Every option is represented by Gapcoin address.
Every 0.00000001 GAP (1 Satoshi) counts as one vote.

The Gapcoin address with the most GAP will win the voting.
Then we will make a hard fork (or not) according to the chosen option.


The options are: halving the block reward

  • every 2 years (no changes, no hard fork)   GSJw8qfMBTrX1p9rRexuek4zXjb8ay3Nev
  • every year   GZHgCFHCwQYZhSqmGAJ7rKLYyo8fBEkgdj
  • every half year   GRNwEjBXhr3ccYV78LKRuzjt9howGVwx9c
  • every three months   GLjNmmTZiSxTyFHXAFBjXefmFNWUhTfXjk


Or reducing the block reward every block to effectively halve:

  • every 2 years   GU4oUgmeAC7T9DkgmrD1TjqcgHsdgXAhVU
  • every year   GHxr8JUNtaenHvrgqmt9oXTtZA8dA8DnBH
  • every half year   GRPwr2TiDNNBBUWa36os4Srppy4QdXxa9i
  • every three months   GKKcAv7UyJNLWsSPEwLRuYLBJjkRKvdp5k

The voting will end in one week (18.11.2014 10:00 PM UTC)

After the end of the voting, the funds of these addresses will be added to the
bounty for the first merit which breaks the world record.

Current status: http://coinia.net/gapcoin/voiting.php

One hour left!

So, the voting is over.

To sum it up:

62.15% (971.99000001 gap) voted for every 2 years (no changes, no hard fork)
36.57% (571.99000000 gap) voted for every block - every half year
  1.28% (  20.00000000 gap) voted for every block - every three months

This means: Everything stays as it was.

Like i said, I'll now add the funds of the voting to the bounty for the world record.
This increases the bounty about 1,563.98000001 gap, which is pretty awesome  Grin


Any improved miners in the works? If we could fill in all the top spots it would get tons of press I'm sure, which is price increase, which is more records! Maybe see what these top gap finders mine with  Cheesy

MrUnzO
Member
**
Offline Offline

Activity: 79
Merit: 10


View Profile
November 19, 2014, 09:54:36 AM
 #830

got 580GAP for sell, pm me for price.
AizenSou
Hero Member
*****
Offline Offline

Activity: 938
Merit: 1000


View Profile
November 19, 2014, 10:54:46 AM
 #831

Hi, I'm crz and I designed for a lot of others coins (Shadowcash, IOC, Cloak..) This one is for gapcoin branding Smiley

Donations welcome at GAP: GdjcBC9vdDrx4bRZRzXaMdSMnuQrghPmC9 Smiley



Amazing, crz. Donation on the way Wink
GreekBitcoin
Legendary
*
Offline Offline

Activity: 1428
Merit: 1001


getmonero.org


View Profile WWW
November 19, 2014, 06:34:45 PM
 #832

Being physicist and unfortunately not so into math i watched this today (and the 20min more footage) about prime gaps and kinda liked it:
 
https://www.youtube.com/watch?v=vkMXdShDdtY

Some questions:

Is there also world records for primes that have a gap of 2 ? Can gapcoin find them or because of sieves it may pass primes (I am not sure i understand how sieves work)?

I am kinda excited with primes lately. What should i read to understand how gapcoin finds gaps? Does it need really advanced mathematics?
Aleh777
Full Member
***
Offline Offline

Activity: 352
Merit: 100


View Profile
November 19, 2014, 06:49:38 PM
 #833

Being physicist and unfortunately not so into math i watched this today (and the 20min more footage) about prime gaps and kinda liked it:
 
https://www.youtube.com/watch?v=vkMXdShDdtY

Some questions:

Is there also world records for primes that have a gap of 2 ? Can gapcoin find them or because of sieves it may pass primes (I am not sure i understand how sieves work)?

I am kinda excited with primes lately. What should i read to understand how gapcoin finds gaps? Does it need really advanced mathematics?

gapcoin very interesting coin!

Like! Smiley
j0nn9
Full Member
***
Offline Offline

Activity: 177
Merit: 153


View Profile WWW
November 19, 2014, 08:04:59 PM
 #834

Being physicist and unfortunately not so into math i watched this today (and the 20min more footage) about prime gaps and kinda liked it:
 
https://www.youtube.com/watch?v=vkMXdShDdtY

Some questions:

Is there also world records for primes that have a gap of 2 ? Can gapcoin find them or because of sieves it may pass primes (I am not sure i understand how sieves work)?

I am kinda excited with primes lately. What should i read to understand how gapcoin finds gaps? Does it need really advanced mathematics?

The algorithm:

The average length of a prime gap with the starting prime p, is log(p),
which means that the average prime gap size increases with lager primes.

Instead of the pure length, Gapcoin uses the merit of a prime gap,
which is the ratio of the gap's size to the average gap size.

Let p be the prime starting a prime gap, then m = gapsize/log(p) will be the merit of this prime gap.
Also a pseudo random number is calculated from p to provide finer difficulty adjustment.

Let rand(p) be a pseudo random function with 0 < rand(p) < 1
Then, for a prime gap starting at prime p with size s,
the difficulty will be s/log(p) + 2/log(p) ∗ rand(p),
where 2/log(p) is the average distance between a gap of size s and s + 2 (the next greater gap) in the proximity of p.

When it actually comes to mining, there are two additional fields added to the Blockheader, named “shift” and “adder”.

We will calculate the prime p as sha256(Blockheader) ∗ 2^shift + adder.
As an additional criterion the adder has to be smaller than 2^shift to avoid that the PoW could be reused.


Mining:

For mining, PoWCore uses a basic prime sieve with some slightly improvements:

The sieving steps:

Calculate the first n primes.
In the actual sieve we skip all even numbers,
because we want to only sieve the odd multiplies of each prime.

So, we create an additional set of primes and multiply each with two.
Make sure the start_index of the sieve is divisible by two.

Now calculate for each prime the first odd number in the sieve,
which is divisible by that prime (called pindex).

For each prime p: mark the pindex as composite,
add 2 ∗ p to pindex and mark it as composite,
 redo till we reach the end of the sieve.

For each remaining prime candidate,
check primality with the Fermat-pseudo-prime-test as it is faster than the Miller-Rabin-test
(Fermat is not as accurate as the Miller-Rabin and maybe some valid sieve results will not be accepted, but this should be very rare)

Now scan the remaining (pseudo) primes for a big prime gap.


Additional notes:

start–index can be hash ∗ 2^shift + [0, 2^shift)

max sieve size depends on start index, and is limited by (hash + 2^shift) - start_index.

shift can theoretically be in range [14, 2^16),
but nodes can choose to only accept shifts till a given amount (e.g. 512 for the main nodes)


dcct's improvements

We do not check every remaining prime candidate with the fermat test.
Instead we look how large the gap has to be to fit the required difficulty (max_length).

Then we determine the first prime in the sieve (called pstart).
Now we scan the prime candidates in the range (pstart, pstart + max_length).
We start at the position (pstart + max_length) and scan every prime candidate in reverse order till we reach pstart.

If we find a prime within the range (pstart, pstart + max_length)
we can skip all other prime candidates within that range and set pstart to that prime.

We redo the above process till we reach the end of the sieve.



So, to sum it up:

Gapcoin is researching into the opposite problem than the one of your video above,
but the max prime gap problem and the twin prime conjecture are closely related,
so, maybe Gapcoin's prime gaps could help somehow proving it.

Gapcoin - The largest, decentralized prime gap search
BitcoinFX
Legendary
*
Offline Offline

Activity: 2534
Merit: 1602


https://youtu.be/DsAVx0u9Cw4 ... Dr. WHO < KLF


View Profile WWW
November 19, 2014, 11:02:35 PM
 #835

Finally got around to updating the Gapcoin CPU Cloud Mining Guide...

Modded CPU-Miner (by dcct, about 10x faster): See: https://bitcointalk.org/index.php?topic=822498.msg9526611#msg9526611

This post will be linked from the guide to provide instructions for updating, as follows:

~ After logging into your cloud instance:

Code:
sudo killall gapminer

Code:
sudo apt-get update

Code:
wget github.com/gapcoin/GapMiner/releases/download/dcct-mod/linux.zip

Code:
7z x linux.zip

Code:
screen -r

Code:
linux/64/gapminer -o http://mine3.gap.nonce-pool.com -p 4200 -u YOURusername.YOURworker -x YOURpassword --retries -1 -t 1

Gapcoin Cloud Mining Guide at: http://gapcoin.grn.cc

Thanks!
 

"Bitcoin OG" Bored/Board of making others wealthy! | 1JXFXUBGs2ZtEDAQMdZ3tkCKo38nT2XSEp | Bitcoin is BTC | CSW is NOT Satoshi Nakamoto | I Mine BTC, LTC, ZEC, XMR and GAP | Support my BTC on Tor addnodes Project | Media enquiries : Wu Ming | Enjoy The Money Machine | "You cannot compete with Open Source" and "Cryptography != Banana"
drumingspz
Sr. Member
****
Offline Offline

Activity: 392
Merit: 250



View Profile
November 20, 2014, 05:00:45 AM
 #836

yay! it's finally raining in California!

{bump}




░░░░░░░▄▄█████▄▄▄░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
░░░░▄██████████████▄░░░░░░░░░░░░░░░░░░░▄██████▄▄░░░░░░
░░▄██████████████████▄░░░░░░░░░░░░░░▄████████████▄░░░░
██████████████████████▄░░░░░░░░░░▄████████████████▄░░
▄███████████████████████▄░░░░░░░▄████████████████████
██████████████████████████▄░░░▄███████████████████████
█████████████████████████████████████████████████████▀
█████████████████████████▀░░░░░▀████████████████████▀
██████████████████████▀░░░░░░░░░▀█████████████████▀░░
░░███████████████████▀░░░░░░░░░░░░░░▀████████████▀░░░░
░░░▀███████████████▀░░░░░░░░░░░░░░░░░░▀▀██████▀▀░░░░░░
░░░░░░▀█████████▀░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
mira  ▀▀
██
 
██
   
██
   
██
   
██
   
██
▄▄
Cryptocurrencies have never been so easy
▬ ● ● ● ● ▬▬▬▬▬▬▬ ● ● ● ● ▬▬▬▬▬▬▬ ● ● ● ● ▬▬▬▬▬▬▬ ● ● ● ● ▬▬▬▬▬▬▬ ● ● ● ● ▬▬▬▬▬▬ ● ● ● ● ▬▬▬▬▬▬ ● ● ● ● ▬▬▬▬▬▬ ● ● ● ● ▬
Facebook LinkedIn Twitter White Paper Google+
▀▀
██
 
██
   
██
   
██
   
██
   
██
▄▄
 
[/center]
agran
Hero Member
*****
Offline Offline

Activity: 910
Merit: 1000


View Profile
November 20, 2014, 08:25:31 AM
 #837

@j0nn9, is it possible to realize improvement of dcct for the GPU-miner?

QORA | 2ND GEN | NEW SOURCE CODE | QTz6fSV2VNc2wjwwsw57kwQzgQhmGw5idQ
onegray
Newbie
*
Offline Offline

Activity: 1
Merit: 0


View Profile
November 20, 2014, 05:10:18 PM
 #838

The dcct's optimisation uses an idea to skip prime tests for a range of numbers between two primes if it is less than the gap minimum length. This works only for sequential searching.
angelovAlex
Newbie
*
Offline Offline

Activity: 1
Merit: 0


View Profile
November 20, 2014, 08:47:03 PM
 #839

Hi, Guys.
I'm actually an iOS developer, but for experiment decided to create a cuda miner in free time. I rewrite mpz's powmod function for cuda and ran it on my old 9600gt. The first results are 12x times faster then on CPU. On new cards we can get really great result.
The second step is to integrate into the miner. But as my video card on my pc, I have to compile the miner for windows. Which is quite difficult for me, as my usual development environment is Mac with Xcode.

So the question is: does someone have build ready visual studio solution with built libraries for windows? Or just explain how do you compile the miner on windows?

Trying to compile the miner for windows is not something on which I want to spend my time, so if no one responses, I will install ubuntu on my pc.
j0nn9
Full Member
***
Offline Offline

Activity: 177
Merit: 153


View Profile WWW
November 20, 2014, 09:26:49 PM
 #840

Hi, Guys.
I'm actually an iOS developer, but for experiment decided to create a cuda miner in free time. I rewrite mpz's powmod function for cuda and ran it on my old 9600gt. The first results are 12x times faster then on CPU. On new cards we can get really great result.
The second step is to integrate into the miner. But as my video card on my pc, I have to compile the miner for windows. Which is quite difficult for me, as my usual development environment is Mac with Xcode.

So the question is: does someone have build ready visual studio solution with built libraries for windows? Or just explain how do you compile the miner on windows?

Trying to compile the miner for windows is not something on which I want to spend my time, so if no one responses, I will install ubuntu on my pc.

For windows compilation I use MinGW and MSYS.
This thread has a good explanation about the basic setup: https://bitcointalk.org/index.php?topic=149479.0

Gapcoin - The largest, decentralized prime gap search
Pages: « 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 [42] 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 ... 123 »
  Print  
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!