Block #484,532

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/10/2014, 2:30:39 PM · Difficulty 10.5893 · 6,342,288 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cfee1ed1ee6befedca06f24d42e59d7454713d66a252a6c964a89e9941c22d4a

Height

#484,532

Difficulty

10.589255

Transactions

6

Size

2.03 KB

Version

2

Bits

0a96d96e

Nonce

305,776,941

Timestamp

4/10/2014, 2:30:39 PM

Confirmations

6,342,288

Merkle Root

87ed922c1377a0e2e12429fe2c5618878207a3185e3fea45eda3cf5ad1b4c268
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.191 × 10⁹⁸(99-digit number)
11916031373411992934…06967235298193210641
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.191 × 10⁹⁸(99-digit number)
11916031373411992934…06967235298193210641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.383 × 10⁹⁸(99-digit number)
23832062746823985868…13934470596386421281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.766 × 10⁹⁸(99-digit number)
47664125493647971736…27868941192772842561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.532 × 10⁹⁸(99-digit number)
95328250987295943472…55737882385545685121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.906 × 10⁹⁹(100-digit number)
19065650197459188694…11475764771091370241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.813 × 10⁹⁹(100-digit number)
38131300394918377388…22951529542182740481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.626 × 10⁹⁹(100-digit number)
76262600789836754777…45903059084365480961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.525 × 10¹⁰⁰(101-digit number)
15252520157967350955…91806118168730961921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.050 × 10¹⁰⁰(101-digit number)
30505040315934701911…83612236337461923841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.101 × 10¹⁰⁰(101-digit number)
61010080631869403822…67224472674923847681
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,858,724 XPM·at block #6,826,819 · 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