Block #3,239,320

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/24/2019, 7:21:52 PM · Difficulty 11.0014 · 3,604,267 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4e004537416d920000c0107a4360bd9ce669cb701133c9af3cdd82c058b5915e

Height

#3,239,320

Difficulty

11.001424

Transactions

6

Size

2.31 KB

Version

2

Bits

0b005d4f

Nonce

1,509,661,687

Timestamp

6/24/2019, 7:21:52 PM

Confirmations

3,604,267

Merkle Root

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

5.127 × 10⁹³(94-digit number)
51272317526505931208…49840183942654129979
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
5.127 × 10⁹³(94-digit number)
51272317526505931208…49840183942654129979
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.025 × 10⁹⁴(95-digit number)
10254463505301186241…99680367885308259959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.050 × 10⁹⁴(95-digit number)
20508927010602372483…99360735770616519919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.101 × 10⁹⁴(95-digit number)
41017854021204744966…98721471541233039839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.203 × 10⁹⁴(95-digit number)
82035708042409489933…97442943082466079679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.640 × 10⁹⁵(96-digit number)
16407141608481897986…94885886164932159359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.281 × 10⁹⁵(96-digit number)
32814283216963795973…89771772329864318719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.562 × 10⁹⁵(96-digit number)
65628566433927591946…79543544659728637439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.312 × 10⁹⁶(97-digit number)
13125713286785518389…59087089319457274879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.625 × 10⁹⁶(97-digit number)
26251426573571036778…18174178638914549759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.250 × 10⁹⁶(97-digit number)
52502853147142073557…36348357277829099519
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,993,056 XPM·at block #6,843,586 · 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