Block #3,411,517

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/29/2019, 1:03:21 PM · Difficulty 10.9853 · 3,414,849 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
73b3abde46c06c5475002611bad749923113dc1f9c0f50e6bcf3f30bb1900709

Height

#3,411,517

Difficulty

10.985266

Transactions

2

Size

540 B

Version

2

Bits

0afc3a66

Nonce

625,945,678

Timestamp

10/29/2019, 1:03:21 PM

Confirmations

3,414,849

Merkle Root

23361739d055dbe8068fed4592702d69b39ceb9a20440acb60c1b1226afe982a
Transactions (2)
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.474 × 10⁹³(94-digit number)
64740796630991631438…58466392960399922621
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.474 × 10⁹³(94-digit number)
64740796630991631438…58466392960399922621
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.294 × 10⁹⁴(95-digit number)
12948159326198326287…16932785920799845241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.589 × 10⁹⁴(95-digit number)
25896318652396652575…33865571841599690481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.179 × 10⁹⁴(95-digit number)
51792637304793305151…67731143683199380961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.035 × 10⁹⁵(96-digit number)
10358527460958661030…35462287366398761921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.071 × 10⁹⁵(96-digit number)
20717054921917322060…70924574732797523841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.143 × 10⁹⁵(96-digit number)
41434109843834644120…41849149465595047681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.286 × 10⁹⁵(96-digit number)
82868219687669288241…83698298931190095361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.657 × 10⁹⁶(97-digit number)
16573643937533857648…67396597862380190721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.314 × 10⁹⁶(97-digit number)
33147287875067715296…34793195724760381441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.629 × 10⁹⁶(97-digit number)
66294575750135430593…69586391449520762881
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,855,072 XPM·at block #6,826,365 · 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