Block #1,349,855

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/1/2015, 2:07:05 PM · Difficulty 10.8057 · 5,476,448 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e0ad4a303077f3ebe01867ff3c740c2f926d19f088a3f5b1f44a6dbfac8b114b

Height

#1,349,855

Difficulty

10.805732

Transactions

2

Size

834 B

Version

2

Bits

0ace4475

Nonce

1,718,421,880

Timestamp

12/1/2015, 2:07:05 PM

Confirmations

5,476,448

Merkle Root

10d45c607d236296087181b004f20e1654ee555a545298a9ae204473ebbc41e0
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.564 × 10⁹⁵(96-digit number)
15644709091895093197…30214160489495678241
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.564 × 10⁹⁵(96-digit number)
15644709091895093197…30214160489495678241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.128 × 10⁹⁵(96-digit number)
31289418183790186394…60428320978991356481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.257 × 10⁹⁵(96-digit number)
62578836367580372789…20856641957982712961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.251 × 10⁹⁶(97-digit number)
12515767273516074557…41713283915965425921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.503 × 10⁹⁶(97-digit number)
25031534547032149115…83426567831930851841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.006 × 10⁹⁶(97-digit number)
50063069094064298231…66853135663861703681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.001 × 10⁹⁷(98-digit number)
10012613818812859646…33706271327723407361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.002 × 10⁹⁷(98-digit number)
20025227637625719292…67412542655446814721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.005 × 10⁹⁷(98-digit number)
40050455275251438585…34825085310893629441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.010 × 10⁹⁷(98-digit number)
80100910550502877170…69650170621787258881
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,854,563 XPM·at block #6,826,302 · 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