Block #1,681,603

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/20/2016, 11:07:37 AM · Difficulty 10.7163 · 5,149,857 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
697d6c3dda0d18ca8e21bf5a894db9db74ad9c4159af1e956dd6aabe4e9fee92

Height

#1,681,603

Difficulty

10.716263

Transactions

2

Size

573 B

Version

2

Bits

0ab75cff

Nonce

65,302,763

Timestamp

7/20/2016, 11:07:37 AM

Confirmations

5,149,857

Merkle Root

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

1.572 × 10⁹⁵(96-digit number)
15723914617857094374…34745638352480888641
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.572 × 10⁹⁵(96-digit number)
15723914617857094374…34745638352480888641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.144 × 10⁹⁵(96-digit number)
31447829235714188749…69491276704961777281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.289 × 10⁹⁵(96-digit number)
62895658471428377499…38982553409923554561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.257 × 10⁹⁶(97-digit number)
12579131694285675499…77965106819847109121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.515 × 10⁹⁶(97-digit number)
25158263388571350999…55930213639694218241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.031 × 10⁹⁶(97-digit number)
50316526777142701999…11860427279388436481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.006 × 10⁹⁷(98-digit number)
10063305355428540399…23720854558776872961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.012 × 10⁹⁷(98-digit number)
20126610710857080799…47441709117553745921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.025 × 10⁹⁷(98-digit number)
40253221421714161599…94883418235107491841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.050 × 10⁹⁷(98-digit number)
80506442843428323198…89766836470214983681
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,895,771 XPM·at block #6,831,459 · 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