Block #3,266,402

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/14/2019, 6:43:04 AM · Difficulty 10.9958 · 3,544,311 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
447c07369152ff0808b8dfccee05c2501224a74425ecd7a5d44f7f97c3885e93

Height

#3,266,402

Difficulty

10.995847

Transactions

8

Size

3.04 KB

Version

2

Bits

0afeefd4

Nonce

997,635,408

Timestamp

7/14/2019, 6:43:04 AM

Confirmations

3,544,311

Merkle Root

c0f42393ead3195926c72e74a746172ee6b745901b5c4c9baae63215beaa8d3a
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.

3.708 × 10⁹⁵(96-digit number)
37086182893190289909…61128478814518308799
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
3.708 × 10⁹⁵(96-digit number)
37086182893190289909…61128478814518308799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.417 × 10⁹⁵(96-digit number)
74172365786380579819…22256957629036617599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.483 × 10⁹⁶(97-digit number)
14834473157276115963…44513915258073235199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.966 × 10⁹⁶(97-digit number)
29668946314552231927…89027830516146470399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.933 × 10⁹⁶(97-digit number)
59337892629104463855…78055661032292940799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.186 × 10⁹⁷(98-digit number)
11867578525820892771…56111322064585881599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.373 × 10⁹⁷(98-digit number)
23735157051641785542…12222644129171763199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.747 × 10⁹⁷(98-digit number)
47470314103283571084…24445288258343526399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.494 × 10⁹⁷(98-digit number)
94940628206567142169…48890576516687052799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.898 × 10⁹⁸(99-digit number)
18988125641313428433…97781153033374105599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.797 × 10⁹⁸(99-digit number)
37976251282626856867…95562306066748211199
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,729,791 XPM·at block #6,810,712 · 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.

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