Block #304,442

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/10/2013, 10:25:53 PM · Difficulty 9.9933 · 6,540,114 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
6231fa98b1f267c23a7fcd276cc5f30956ea7290ea9cf79c9a4db219414d73f2

Height

#304,442

Difficulty

9.993336

Transactions

1

Size

1.01 KB

Version

2

Bits

09fe4b48

Nonce

208,619

Timestamp

12/10/2013, 10:25:53 PM

Confirmations

6,540,114

Merkle Root

ce255c18296d6ac45f7ec3c5534589719088f63092e931bf592f38c0b0b66c39
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

2.655 × 10⁹⁶(97-digit number)
26552886335289729899…34630000489980534721
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
2.655 × 10⁹⁶(97-digit number)
26552886335289729899…34630000489980534721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.310 × 10⁹⁶(97-digit number)
53105772670579459799…69260000979961069441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.062 × 10⁹⁷(98-digit number)
10621154534115891959…38520001959922138881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.124 × 10⁹⁷(98-digit number)
21242309068231783919…77040003919844277761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.248 × 10⁹⁷(98-digit number)
42484618136463567839…54080007839688555521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.496 × 10⁹⁷(98-digit number)
84969236272927135679…08160015679377111041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.699 × 10⁹⁸(99-digit number)
16993847254585427135…16320031358754222081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.398 × 10⁹⁸(99-digit number)
33987694509170854271…32640062717508444161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.797 × 10⁹⁸(99-digit number)
67975389018341708543…65280125435016888321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.359 × 10⁹⁹(100-digit number)
13595077803668341708…30560250870033776641
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:58,000,851 XPM·at block #6,844,555 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy