Block #1,710,639

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/10/2016, 11:56:19 AM · Difficulty 10.6376 · 5,130,784 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fa2bf21c97749c4720cf8276ebaac3eea68a60ef58dfbf7461184349ac0fda3c

Height

#1,710,639

Difficulty

10.637550

Transactions

2

Size

1.91 KB

Version

2

Bits

0aa3367f

Nonce

501,429,769

Timestamp

8/10/2016, 11:56:19 AM

Confirmations

5,130,784

Merkle Root

6ca22bfc3aed0bf5f54096df36606df50d19346111d78a3aa610915166e7f013
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.361 × 10⁹⁵(96-digit number)
13610000623694078918…72113731288746414639
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.361 × 10⁹⁵(96-digit number)
13610000623694078918…72113731288746414639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.722 × 10⁹⁵(96-digit number)
27220001247388157837…44227462577492829279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.444 × 10⁹⁵(96-digit number)
54440002494776315675…88454925154985658559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.088 × 10⁹⁶(97-digit number)
10888000498955263135…76909850309971317119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.177 × 10⁹⁶(97-digit number)
21776000997910526270…53819700619942634239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.355 × 10⁹⁶(97-digit number)
43552001995821052540…07639401239885268479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.710 × 10⁹⁶(97-digit number)
87104003991642105081…15278802479770536959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.742 × 10⁹⁷(98-digit number)
17420800798328421016…30557604959541073919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.484 × 10⁹⁷(98-digit number)
34841601596656842032…61115209919082147839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.968 × 10⁹⁷(98-digit number)
69683203193313684064…22230419838164295679
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,975,760 XPM·at block #6,841,422 · 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