Block #427,352

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/3/2014, 7:53:04 AM · Difficulty 10.3478 · 6,414,561 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1bb0cc52f30dd29beaf63c65369866fef0971949c554821518294e15a178ce20

Height

#427,352

Difficulty

10.347772

Transactions

8

Size

2.65 KB

Version

2

Bits

0a59078e

Nonce

61,373

Timestamp

3/3/2014, 7:53:04 AM

Confirmations

6,414,561

Merkle Root

7f7071a1f24b37ac12563b2db50c64df1629539e40cc2630bcbee4de0b91fb6f
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.

5.146 × 10⁹⁵(96-digit number)
51466444952661844741…65634135606620661921
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
5.146 × 10⁹⁵(96-digit number)
51466444952661844741…65634135606620661921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.029 × 10⁹⁶(97-digit number)
10293288990532368948…31268271213241323841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.058 × 10⁹⁶(97-digit number)
20586577981064737896…62536542426482647681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.117 × 10⁹⁶(97-digit number)
41173155962129475793…25073084852965295361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.234 × 10⁹⁶(97-digit number)
82346311924258951586…50146169705930590721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.646 × 10⁹⁷(98-digit number)
16469262384851790317…00292339411861181441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.293 × 10⁹⁷(98-digit number)
32938524769703580634…00584678823722362881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.587 × 10⁹⁷(98-digit number)
65877049539407161269…01169357647444725761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.317 × 10⁹⁸(99-digit number)
13175409907881432253…02338715294889451521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.635 × 10⁹⁸(99-digit number)
26350819815762864507…04677430589778903041
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,979,679 XPM·at block #6,841,912 · 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