Block #323,527

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/21/2013, 5:04:22 PM · Difficulty 10.2068 · 6,501,009 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3e333b408d44161685b71eb1b46e05c11870880de37d65efe1ca269bb8412544

Height

#323,527

Difficulty

10.206766

Transactions

1

Size

1.01 KB

Version

2

Bits

0a34ee9d

Nonce

47,762

Timestamp

12/21/2013, 5:04:22 PM

Confirmations

6,501,009

Merkle Root

3b39407e67c1a3e710a64e0aca45f9b84588338e9aee1a1fc4db6737ea95ac63
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.

1.054 × 10⁹⁷(98-digit number)
10540860241495271394…25654555819426380801
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
1.054 × 10⁹⁷(98-digit number)
10540860241495271394…25654555819426380801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.108 × 10⁹⁷(98-digit number)
21081720482990542788…51309111638852761601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.216 × 10⁹⁷(98-digit number)
42163440965981085576…02618223277705523201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.432 × 10⁹⁷(98-digit number)
84326881931962171153…05236446555411046401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.686 × 10⁹⁸(99-digit number)
16865376386392434230…10472893110822092801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.373 × 10⁹⁸(99-digit number)
33730752772784868461…20945786221644185601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.746 × 10⁹⁸(99-digit number)
67461505545569736922…41891572443288371201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.349 × 10⁹⁹(100-digit number)
13492301109113947384…83783144886576742401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.698 × 10⁹⁹(100-digit number)
26984602218227894769…67566289773153484801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.396 × 10⁹⁹(100-digit number)
53969204436455789538…35132579546306969601
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,840,350 XPM·at block #6,824,535 · 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