Block #540,917

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/13/2014, 7:48:33 AM · Difficulty 10.9364 · 6,271,561 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0d0be20b27a5a97bde4c0904eb30115686deb2d20dd44653e994f92fd7094ce6

Height

#540,917

Difficulty

10.936403

Transactions

3

Size

957 B

Version

2

Bits

0aefb81a

Nonce

24,716,629

Timestamp

5/13/2014, 7:48:33 AM

Confirmations

6,271,561

Merkle Root

4c7faaf5b07330c2fe4b61fe850a54292e95f38a7046077c6e4953111ab0816a
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.

2.767 × 10⁹⁹(100-digit number)
27670082122947657714…01063781397529630719
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
2.767 × 10⁹⁹(100-digit number)
27670082122947657714…01063781397529630719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.534 × 10⁹⁹(100-digit number)
55340164245895315429…02127562795059261439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.106 × 10¹⁰⁰(101-digit number)
11068032849179063085…04255125590118522879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.213 × 10¹⁰⁰(101-digit number)
22136065698358126171…08510251180237045759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.427 × 10¹⁰⁰(101-digit number)
44272131396716252343…17020502360474091519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.854 × 10¹⁰⁰(101-digit number)
88544262793432504687…34041004720948183039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.770 × 10¹⁰¹(102-digit number)
17708852558686500937…68082009441896366079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.541 × 10¹⁰¹(102-digit number)
35417705117373001874…36164018883792732159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.083 × 10¹⁰¹(102-digit number)
70835410234746003749…72328037767585464319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.416 × 10¹⁰²(103-digit number)
14167082046949200749…44656075535170928639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.833 × 10¹⁰²(103-digit number)
28334164093898401499…89312151070341857279
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,743,852 XPM·at block #6,812,477 · 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