Block #1,680,929

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/20/2016, 1:15:40 AM · Difficulty 10.7115 · 5,155,424 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6d732f311809602be2d9e4635c1fc47ef308d4260757754fb29f44d4d4185a5f

Height

#1,680,929

Difficulty

10.711540

Transactions

2

Size

869 B

Version

2

Bits

0ab62775

Nonce

185,131,942

Timestamp

7/20/2016, 1:15:40 AM

Confirmations

5,155,424

Merkle Root

8ac5a58dfe586e2ac9b8003f0de5e8ead32f68f698d21d80faba6ed2097ce687
Transactions (2)
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.865 × 10⁹⁴(95-digit number)
88659926616185444312…00182619073437772159
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.865 × 10⁹⁴(95-digit number)
88659926616185444312…00182619073437772159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.773 × 10⁹⁵(96-digit number)
17731985323237088862…00365238146875544319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.546 × 10⁹⁵(96-digit number)
35463970646474177724…00730476293751088639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.092 × 10⁹⁵(96-digit number)
70927941292948355449…01460952587502177279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.418 × 10⁹⁶(97-digit number)
14185588258589671089…02921905175004354559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.837 × 10⁹⁶(97-digit number)
28371176517179342179…05843810350008709119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.674 × 10⁹⁶(97-digit number)
56742353034358684359…11687620700017418239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.134 × 10⁹⁷(98-digit number)
11348470606871736871…23375241400034836479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.269 × 10⁹⁷(98-digit number)
22696941213743473743…46750482800069672959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.539 × 10⁹⁷(98-digit number)
45393882427486947487…93500965600139345919
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,935,084 XPM·at block #6,836,352 · 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