Block #3,429,728

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/12/2019, 6:38:44 AM · Difficulty 10.9805 · 3,377,102 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4ecc0724e16572c05f0480677215c4d096b734f0ab2752e6171759294960cce5

Height

#3,429,728

Difficulty

10.980532

Transactions

15

Size

3.32 KB

Version

2

Bits

0afb0423

Nonce

1,220,026,461

Timestamp

11/12/2019, 6:38:44 AM

Confirmations

3,377,102

Merkle Root

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

7.022 × 10⁹⁴(95-digit number)
70224318532593866434…85997720155364499519
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
7.022 × 10⁹⁴(95-digit number)
70224318532593866434…85997720155364499519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.404 × 10⁹⁵(96-digit number)
14044863706518773286…71995440310728999039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.808 × 10⁹⁵(96-digit number)
28089727413037546573…43990880621457998079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.617 × 10⁹⁵(96-digit number)
56179454826075093147…87981761242915996159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.123 × 10⁹⁶(97-digit number)
11235890965215018629…75963522485831992319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.247 × 10⁹⁶(97-digit number)
22471781930430037259…51927044971663984639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.494 × 10⁹⁶(97-digit number)
44943563860860074518…03854089943327969279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.988 × 10⁹⁶(97-digit number)
89887127721720149036…07708179886655938559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.797 × 10⁹⁷(98-digit number)
17977425544344029807…15416359773311877119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.595 × 10⁹⁷(98-digit number)
35954851088688059614…30832719546623754239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.190 × 10⁹⁷(98-digit number)
71909702177376119228…61665439093247508479
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,698,743 XPM·at block #6,806,829 · 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