Block #503,711

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/21/2014, 6:45:14 AM · Difficulty 10.8092 · 6,312,790 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5e8c33e8f35ce1d7ee2758d113e861a2231f5fb8c03a48e2e6e47249a2b03eba

Height

#503,711

Difficulty

10.809234

Transactions

5

Size

1.55 KB

Version

2

Bits

0acf29f8

Nonce

699,886,290

Timestamp

4/21/2014, 6:45:14 AM

Confirmations

6,312,790

Merkle Root

07bf8e28de0a33dcc72eed6683f9b74fa28fbe6d6a9bb82e591be7308e3a4e1a
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.862 × 10⁹⁸(99-digit number)
88625871582458383455…56498671120280163201
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.862 × 10⁹⁸(99-digit number)
88625871582458383455…56498671120280163201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.772 × 10⁹⁹(100-digit number)
17725174316491676691…12997342240560326401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.545 × 10⁹⁹(100-digit number)
35450348632983353382…25994684481120652801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.090 × 10⁹⁹(100-digit number)
70900697265966706764…51989368962241305601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.418 × 10¹⁰⁰(101-digit number)
14180139453193341352…03978737924482611201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.836 × 10¹⁰⁰(101-digit number)
28360278906386682705…07957475848965222401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.672 × 10¹⁰⁰(101-digit number)
56720557812773365411…15914951697930444801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.134 × 10¹⁰¹(102-digit number)
11344111562554673082…31829903395860889601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.268 × 10¹⁰¹(102-digit number)
22688223125109346164…63659806791721779201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.537 × 10¹⁰¹(102-digit number)
45376446250218692328…27319613583443558401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.075 × 10¹⁰¹(102-digit number)
90752892500437384657…54639227166887116801
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,776,137 XPM·at block #6,816,500 · 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