Block #3,049,169

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/12/2019, 2:26:03 AM · Difficulty 10.9961 · 3,791,663 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e4e8bfb8689fefa1cddab55cf3a25bc6b52c1f590af57e5dca95f991e5a2b899

Height

#3,049,169

Difficulty

10.996090

Transactions

9

Size

2.50 KB

Version

2

Bits

0afeffc3

Nonce

511,934,710

Timestamp

2/12/2019, 2:26:03 AM

Confirmations

3,791,663

Merkle Root

6bcec8475774602368fcd4dcfff3f638e1bfd905e59cbf8621052d86dc42bb5f
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.

6.080 × 10⁹³(94-digit number)
60807257117042374169…99407986904156660239
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
6.080 × 10⁹³(94-digit number)
60807257117042374169…99407986904156660239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.216 × 10⁹⁴(95-digit number)
12161451423408474833…98815973808313320479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.432 × 10⁹⁴(95-digit number)
24322902846816949667…97631947616626640959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.864 × 10⁹⁴(95-digit number)
48645805693633899335…95263895233253281919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.729 × 10⁹⁴(95-digit number)
97291611387267798670…90527790466506563839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.945 × 10⁹⁵(96-digit number)
19458322277453559734…81055580933013127679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.891 × 10⁹⁵(96-digit number)
38916644554907119468…62111161866026255359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.783 × 10⁹⁵(96-digit number)
77833289109814238936…24222323732052510719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.556 × 10⁹⁶(97-digit number)
15566657821962847787…48444647464105021439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.113 × 10⁹⁶(97-digit number)
31133315643925695574…96889294928210042879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.226 × 10⁹⁶(97-digit number)
62266631287851391149…93778589856420085759
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,971,002 XPM·at block #6,840,831 · 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