Block #3,237,430

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/23/2019, 12:10:55 PM · Difficulty 10.9960 · 3,605,466 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6bc11519d917fab37f475611e3836598a7a957064265cccc15506e2b73ae33a9

Height

#3,237,430

Difficulty

10.996030

Transactions

42

Size

9.82 KB

Version

2

Bits

0afefbd7

Nonce

1,674,725,578

Timestamp

6/23/2019, 12:10:55 PM

Confirmations

3,605,466

Merkle Root

d52e804937f219a57a5cfec8d892259663ac281e007d33e0765182132bbe6c0a
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.105 × 10⁹⁴(95-digit number)
21057607675921407481…61568191705976016239
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.105 × 10⁹⁴(95-digit number)
21057607675921407481…61568191705976016239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.211 × 10⁹⁴(95-digit number)
42115215351842814963…23136383411952032479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.423 × 10⁹⁴(95-digit number)
84230430703685629926…46272766823904064959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.684 × 10⁹⁵(96-digit number)
16846086140737125985…92545533647808129919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.369 × 10⁹⁵(96-digit number)
33692172281474251970…85091067295616259839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.738 × 10⁹⁵(96-digit number)
67384344562948503940…70182134591232519679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.347 × 10⁹⁶(97-digit number)
13476868912589700788…40364269182465039359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.695 × 10⁹⁶(97-digit number)
26953737825179401576…80728538364930078719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.390 × 10⁹⁶(97-digit number)
53907475650358803152…61457076729860157439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.078 × 10⁹⁷(98-digit number)
10781495130071760630…22914153459720314879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.156 × 10⁹⁷(98-digit number)
21562990260143521261…45828306919440629759
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,987,516 XPM·at block #6,842,895 · 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