Block #503,055

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 8:23:11 PM · Difficulty 10.8079 · 6,324,154 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
04836af6506937345a2aa9740ffaa1cf939675c42fb6fd4820c63f291b5ceb17

Height

#503,055

Difficulty

10.807913

Transactions

1

Size

834 B

Version

2

Bits

0aced35e

Nonce

226,854

Timestamp

4/20/2014, 8:23:11 PM

Confirmations

6,324,154

Merkle Root

9fac463260d6701f49b213dbba8e8879aec09b3f166a182eeecfe17908436341
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.

1.744 × 10⁹⁷(98-digit number)
17441705193721747620…41166707991080857401
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
1.744 × 10⁹⁷(98-digit number)
17441705193721747620…41166707991080857401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.488 × 10⁹⁷(98-digit number)
34883410387443495241…82333415982161714801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.976 × 10⁹⁷(98-digit number)
69766820774886990483…64666831964323429601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.395 × 10⁹⁸(99-digit number)
13953364154977398096…29333663928646859201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.790 × 10⁹⁸(99-digit number)
27906728309954796193…58667327857293718401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.581 × 10⁹⁸(99-digit number)
55813456619909592386…17334655714587436801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.116 × 10⁹⁹(100-digit number)
11162691323981918477…34669311429174873601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.232 × 10⁹⁹(100-digit number)
22325382647963836954…69338622858349747201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.465 × 10⁹⁹(100-digit number)
44650765295927673909…38677245716699494401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.930 × 10⁹⁹(100-digit number)
89301530591855347818…77354491433398988801
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,861,770 XPM·at block #6,827,208 · 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