Block #3,491,509

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/28/2019, 4:20:04 AM · Difficulty 10.9579 · 3,350,826 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
63068aa774a9470ca103ec4c16c49c79324e2b91bd2dc40a93d8c6493f371d80

Height

#3,491,509

Difficulty

10.957896

Transactions

7

Size

3.35 KB

Version

2

Bits

0af538b3

Nonce

1,505,798,028

Timestamp

12/28/2019, 4:20:04 AM

Confirmations

3,350,826

Merkle Root

d11cf49524167595dc0c918f972756253a0191e829c2f60ed35d5c1fdfc5c731
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.471 × 10⁹⁴(95-digit number)
24718624976476854683…43277574097340027049
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.471 × 10⁹⁴(95-digit number)
24718624976476854683…43277574097340027049
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.943 × 10⁹⁴(95-digit number)
49437249952953709367…86555148194680054099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.887 × 10⁹⁴(95-digit number)
98874499905907418734…73110296389360108199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.977 × 10⁹⁵(96-digit number)
19774899981181483746…46220592778720216399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.954 × 10⁹⁵(96-digit number)
39549799962362967493…92441185557440432799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.909 × 10⁹⁵(96-digit number)
79099599924725934987…84882371114880865599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.581 × 10⁹⁶(97-digit number)
15819919984945186997…69764742229761731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.163 × 10⁹⁶(97-digit number)
31639839969890373995…39529484459523462399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.327 × 10⁹⁶(97-digit number)
63279679939780747990…79058968919046924799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.265 × 10⁹⁷(98-digit number)
12655935987956149598…58117937838093849599
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 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
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 1CC formula:

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