Block #3,251,036

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/3/2019, 12:14:06 AM · Difficulty 10.9961 · 3,582,761 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1a7f6e53a5566bf314243ce85389dbc5c0a299ed67836bb9a9b9201f3ae6d1ae

Height

#3,251,036

Difficulty

10.996088

Transactions

26

Size

7.45 KB

Version

2

Bits

0afeff9e

Nonce

2,055,436,724

Timestamp

7/3/2019, 12:14:06 AM

Confirmations

3,582,761

Merkle Root

d3dcdffbf63ac6148c55a2635bebb4946e43151e2467d2aa01827d87dfb7b046
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.116 × 10⁹³(94-digit number)
11164696257505713162…86795973286113471999
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.116 × 10⁹³(94-digit number)
11164696257505713162…86795973286113471999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.232 × 10⁹³(94-digit number)
22329392515011426325…73591946572226943999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.465 × 10⁹³(94-digit number)
44658785030022852651…47183893144453887999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.931 × 10⁹³(94-digit number)
89317570060045705303…94367786288907775999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.786 × 10⁹⁴(95-digit number)
17863514012009141060…88735572577815551999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.572 × 10⁹⁴(95-digit number)
35727028024018282121…77471145155631103999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.145 × 10⁹⁴(95-digit number)
71454056048036564242…54942290311262207999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.429 × 10⁹⁵(96-digit number)
14290811209607312848…09884580622524415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.858 × 10⁹⁵(96-digit number)
28581622419214625697…19769161245048831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.716 × 10⁹⁵(96-digit number)
57163244838429251394…39538322490097663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.143 × 10⁹⁶(97-digit number)
11432648967685850278…79076644980195327999
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,914,598 XPM·at block #6,833,796 · 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