Block #414,447

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/22/2014, 12:36:08 AM · Difficulty 10.4030 · 6,401,878 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5aad2a5db1f34da39953671406f410ef93c8bff2cca6188ecf9ae101410451fb

Height

#414,447

Difficulty

10.402992

Transactions

4

Size

886 B

Version

2

Bits

0a672a82

Nonce

57,261

Timestamp

2/22/2014, 12:36:08 AM

Confirmations

6,401,878

Merkle Root

708d45c578b2d1a2e72ed1e4f141d1b48fd6c331f36bf6b064d626743aee0452
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.

8.859 × 10⁹⁹(100-digit number)
88593960774910496721…94442172180800340481
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
8.859 × 10⁹⁹(100-digit number)
88593960774910496721…94442172180800340481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.771 × 10¹⁰⁰(101-digit number)
17718792154982099344…88884344361600680961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.543 × 10¹⁰⁰(101-digit number)
35437584309964198688…77768688723201361921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.087 × 10¹⁰⁰(101-digit number)
70875168619928397377…55537377446402723841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.417 × 10¹⁰¹(102-digit number)
14175033723985679475…11074754892805447681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.835 × 10¹⁰¹(102-digit number)
28350067447971358950…22149509785610895361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.670 × 10¹⁰¹(102-digit number)
56700134895942717901…44299019571221790721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.134 × 10¹⁰²(103-digit number)
11340026979188543580…88598039142443581441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.268 × 10¹⁰²(103-digit number)
22680053958377087160…77196078284887162881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.536 × 10¹⁰²(103-digit number)
45360107916754174321…54392156569774325761
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,774,721 XPM·at block #6,816,324 · 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