Block #569,462

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/31/2014, 4:15:30 AM · Difficulty 10.9646 · 6,236,809 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7b2331f4eefd127fb524d22594e8dd356d0a15f37fada692e9eeb9e0fd453a37

Height

#569,462

Difficulty

10.964637

Transactions

9

Size

2.98 KB

Version

2

Bits

0af6f26b

Nonce

291,448,828

Timestamp

5/31/2014, 4:15:30 AM

Confirmations

6,236,809

Merkle Root

9344df2f9d0270e1832377d245ddf3038b0d71db853fd09ee1d0deb71f459e2f
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.726 × 10⁹⁹(100-digit number)
57263741197444923025…47661548836325580801
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.726 × 10⁹⁹(100-digit number)
57263741197444923025…47661548836325580801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.145 × 10¹⁰⁰(101-digit number)
11452748239488984605…95323097672651161601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.290 × 10¹⁰⁰(101-digit number)
22905496478977969210…90646195345302323201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.581 × 10¹⁰⁰(101-digit number)
45810992957955938420…81292390690604646401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.162 × 10¹⁰⁰(101-digit number)
91621985915911876841…62584781381209292801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.832 × 10¹⁰¹(102-digit number)
18324397183182375368…25169562762418585601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.664 × 10¹⁰¹(102-digit number)
36648794366364750736…50339125524837171201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.329 × 10¹⁰¹(102-digit number)
73297588732729501473…00678251049674342401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.465 × 10¹⁰²(103-digit number)
14659517746545900294…01356502099348684801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.931 × 10¹⁰²(103-digit number)
29319035493091800589…02713004198697369601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.863 × 10¹⁰²(103-digit number)
58638070986183601178…05426008397394739201
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,694,254 XPM·at block #6,806,270 · 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.

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