Block #302,961

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/10/2013, 2:55:39 AM · Difficulty 9.9929 · 6,524,225 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2384d9700f907507877a537cf71ee18997b45708335913e26bd4ff9cac8df880

Height

#302,961

Difficulty

9.992868

Transactions

1

Size

1.11 KB

Version

2

Bits

09fe2c96

Nonce

80,229

Timestamp

12/10/2013, 2:55:39 AM

Confirmations

6,524,225

Merkle Root

6c715b5fd3d37f84ddeef9160a77baafe9d9244a93bf1b188412afd00095c256
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.

6.449 × 10⁹³(94-digit number)
64491355270060383107…79780017227214001921
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
6.449 × 10⁹³(94-digit number)
64491355270060383107…79780017227214001921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.289 × 10⁹⁴(95-digit number)
12898271054012076621…59560034454428003841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.579 × 10⁹⁴(95-digit number)
25796542108024153242…19120068908856007681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.159 × 10⁹⁴(95-digit number)
51593084216048306485…38240137817712015361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.031 × 10⁹⁵(96-digit number)
10318616843209661297…76480275635424030721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.063 × 10⁹⁵(96-digit number)
20637233686419322594…52960551270848061441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.127 × 10⁹⁵(96-digit number)
41274467372838645188…05921102541696122881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.254 × 10⁹⁵(96-digit number)
82548934745677290377…11842205083392245761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.650 × 10⁹⁶(97-digit number)
16509786949135458075…23684410166784491521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.301 × 10⁹⁶(97-digit number)
33019573898270916150…47368820333568983041
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:57,861,584 XPM·at block #6,827,185 · 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