Block #3,353,471

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/13/2019, 5:13:24 PM · Difficulty 10.9961 · 3,454,706 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6b5ba74bb2bddafd0e34b940f6fdc7cc3b0901386343fae4a320a76681792629

Height

#3,353,471

Difficulty

10.996070

Transactions

20

Size

6.10 KB

Version

2

Bits

0afefe6f

Nonce

333,102,463

Timestamp

9/13/2019, 5:13:24 PM

Confirmations

3,454,706

Merkle Root

d76765590607f08e6ebdc8a6d9e4628c17b498bc8228ef7a5b310afa40daa90f
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.221 × 10⁹⁶(97-digit number)
12216522198591989477…53024598403605652479
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.221 × 10⁹⁶(97-digit number)
12216522198591989477…53024598403605652479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.443 × 10⁹⁶(97-digit number)
24433044397183978954…06049196807211304959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.886 × 10⁹⁶(97-digit number)
48866088794367957909…12098393614422609919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.773 × 10⁹⁶(97-digit number)
97732177588735915818…24196787228845219839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.954 × 10⁹⁷(98-digit number)
19546435517747183163…48393574457690439679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.909 × 10⁹⁷(98-digit number)
39092871035494366327…96787148915380879359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.818 × 10⁹⁷(98-digit number)
78185742070988732654…93574297830761758719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.563 × 10⁹⁸(99-digit number)
15637148414197746530…87148595661523517439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.127 × 10⁹⁸(99-digit number)
31274296828395493061…74297191323047034879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.254 × 10⁹⁸(99-digit number)
62548593656790986123…48594382646094069759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.250 × 10⁹⁹(100-digit number)
12509718731358197224…97188765292188139519
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,709,464 XPM·at block #6,808,176 · 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