Block #3,284,985

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/28/2019, 8:50:47 AM · Difficulty 10.9948 · 3,547,721 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cfe0ca842c69562f0de8e42ef9620ca54d580bb536222fb50415b22317f16e67

Height

#3,284,985

Difficulty

10.994810

Transactions

3

Size

584 B

Version

2

Bits

0afeabd9

Nonce

914,828,105

Timestamp

7/28/2019, 8:50:47 AM

Confirmations

3,547,721

Merkle Root

1e7082344c2cc822c20664b83e23486d9572c52624814728e3dc409df269ea2d
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.419 × 10⁹⁷(98-digit number)
14193516196970071470…92334937539936573439
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.419 × 10⁹⁷(98-digit number)
14193516196970071470…92334937539936573439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.838 × 10⁹⁷(98-digit number)
28387032393940142940…84669875079873146879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.677 × 10⁹⁷(98-digit number)
56774064787880285880…69339750159746293759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.135 × 10⁹⁸(99-digit number)
11354812957576057176…38679500319492587519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.270 × 10⁹⁸(99-digit number)
22709625915152114352…77359000638985175039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.541 × 10⁹⁸(99-digit number)
45419251830304228704…54718001277970350079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.083 × 10⁹⁸(99-digit number)
90838503660608457409…09436002555940700159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.816 × 10⁹⁹(100-digit number)
18167700732121691481…18872005111881400319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.633 × 10⁹⁹(100-digit number)
36335401464243382963…37744010223762800639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.267 × 10⁹⁹(100-digit number)
72670802928486765927…75488020447525601279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.453 × 10¹⁰⁰(101-digit number)
14534160585697353185…50976040895051202559
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,905,806 XPM·at block #6,832,705 · 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