Block #3,464,359

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/6/2019, 7:24:35 PM · Difficulty 10.9787 · 3,378,424 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fa9daae39ce53019da1a36bec7b7a1b52d1c5a8a705e97ee350454cbb2975661

Height

#3,464,359

Difficulty

10.978733

Transactions

3

Size

585 B

Version

2

Bits

0afa8e3c

Nonce

46,525,595

Timestamp

12/6/2019, 7:24:35 PM

Confirmations

3,378,424

Merkle Root

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

5.024 × 10⁹⁴(95-digit number)
50248008531065770170…34962862007665414719
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
5.024 × 10⁹⁴(95-digit number)
50248008531065770170…34962862007665414719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.004 × 10⁹⁵(96-digit number)
10049601706213154034…69925724015330829439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.009 × 10⁹⁵(96-digit number)
20099203412426308068…39851448030661658879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.019 × 10⁹⁵(96-digit number)
40198406824852616136…79702896061323317759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.039 × 10⁹⁵(96-digit number)
80396813649705232273…59405792122646635519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.607 × 10⁹⁶(97-digit number)
16079362729941046454…18811584245293271039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.215 × 10⁹⁶(97-digit number)
32158725459882092909…37623168490586542079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.431 × 10⁹⁶(97-digit number)
64317450919764185818…75246336981173084159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.286 × 10⁹⁷(98-digit number)
12863490183952837163…50492673962346168319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.572 × 10⁹⁷(98-digit number)
25726980367905674327…00985347924692336639
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,986,604 XPM·at block #6,842,782 · 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