Block #3,225,396

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/14/2019, 8:37:27 PM · Difficulty 11.0075 · 3,611,198 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
63a51263d5a05c15aaf312e912832ce237a7aca3426505d6afe1c49555aaa208

Height

#3,225,396

Difficulty

11.007527

Transactions

6

Size

3.79 KB

Version

2

Bits

0b01ed51

Nonce

1,658,960,860

Timestamp

6/14/2019, 8:37:27 PM

Confirmations

3,611,198

Merkle Root

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

6.945 × 10⁹³(94-digit number)
69455950531076782232…50993119405881052881
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
6.945 × 10⁹³(94-digit number)
69455950531076782232…50993119405881052881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.389 × 10⁹⁴(95-digit number)
13891190106215356446…01986238811762105761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.778 × 10⁹⁴(95-digit number)
27782380212430712892…03972477623524211521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.556 × 10⁹⁴(95-digit number)
55564760424861425785…07944955247048423041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.111 × 10⁹⁵(96-digit number)
11112952084972285157…15889910494096846081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.222 × 10⁹⁵(96-digit number)
22225904169944570314…31779820988193692161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.445 × 10⁹⁵(96-digit number)
44451808339889140628…63559641976387384321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.890 × 10⁹⁵(96-digit number)
88903616679778281257…27119283952774768641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.778 × 10⁹⁶(97-digit number)
17780723335955656251…54238567905549537281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.556 × 10⁹⁶(97-digit number)
35561446671911312502…08477135811099074561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.112 × 10⁹⁶(97-digit number)
71122893343822625005…16954271622198149121
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,937,022 XPM·at block #6,836,593 · 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