Block #3,433,306

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/14/2019, 9:30:56 PM · Difficulty 10.9799 · 3,409,530 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
72028da550ec6cdae3371414bfee71a79074de14734999af397d795eeedf336b

Height

#3,433,306

Difficulty

10.979868

Transactions

2

Size

1.53 KB

Version

2

Bits

0afad89a

Nonce

671,451,180

Timestamp

11/14/2019, 9:30:56 PM

Confirmations

3,409,530

Merkle Root

af87442a17af5a58d5549358f9a64791ff1fd7df67b37d1799ac9cb5f763941a
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.281 × 10⁹⁴(95-digit number)
12812219096593837334…29665176385156897299
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.281 × 10⁹⁴(95-digit number)
12812219096593837334…29665176385156897299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.562 × 10⁹⁴(95-digit number)
25624438193187674669…59330352770313794599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.124 × 10⁹⁴(95-digit number)
51248876386375349338…18660705540627589199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.024 × 10⁹⁵(96-digit number)
10249775277275069867…37321411081255178399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.049 × 10⁹⁵(96-digit number)
20499550554550139735…74642822162510356799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.099 × 10⁹⁵(96-digit number)
40999101109100279470…49285644325020713599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.199 × 10⁹⁵(96-digit number)
81998202218200558941…98571288650041427199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.639 × 10⁹⁶(97-digit number)
16399640443640111788…97142577300082854399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.279 × 10⁹⁶(97-digit number)
32799280887280223576…94285154600165708799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.559 × 10⁹⁶(97-digit number)
65598561774560447153…88570309200331417599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.311 × 10⁹⁷(98-digit number)
13119712354912089430…77140618400662835199
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,032 XPM·at block #6,842,835 · 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