Block #1,074,564

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/25/2015, 3:06:57 AM · Difficulty 10.7439 · 5,730,982 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b2182bbb4a474f3f9af2ebe04a7a520146521f06a1ffb89495c4eb1bdfa4658a

Height

#1,074,564

Difficulty

10.743892

Transactions

4

Size

77.63 KB

Version

2

Bits

0abe6fad

Nonce

1,668,644,202

Timestamp

5/25/2015, 3:06:57 AM

Confirmations

5,730,982

Merkle Root

b82f6c1f57d8e2e27478f335659e40fe1a4c14a54351533380d452f7b7079fef
Transactions (4)
1 in → 1 out9.4600 XPM116 B
31 in → 1 out119.9900 XPM4.51 KB
252 in → 1 out999.9900 XPM36.44 KB
252 in → 1 out999.9900 XPM36.48 KB
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.

8.475 × 10⁹⁶(97-digit number)
84752946523712836735…89948318352783749759
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
8.475 × 10⁹⁶(97-digit number)
84752946523712836735…89948318352783749759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.695 × 10⁹⁷(98-digit number)
16950589304742567347…79896636705567499519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.390 × 10⁹⁷(98-digit number)
33901178609485134694…59793273411134999039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.780 × 10⁹⁷(98-digit number)
67802357218970269388…19586546822269998079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.356 × 10⁹⁸(99-digit number)
13560471443794053877…39173093644539996159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.712 × 10⁹⁸(99-digit number)
27120942887588107755…78346187289079992319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.424 × 10⁹⁸(99-digit number)
54241885775176215510…56692374578159984639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.084 × 10⁹⁹(100-digit number)
10848377155035243102…13384749156319969279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.169 × 10⁹⁹(100-digit number)
21696754310070486204…26769498312639938559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.339 × 10⁹⁹(100-digit number)
43393508620140972408…53538996625279877119
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 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
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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,688,445 XPM·at block #6,805,545 · 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.