Block #1,687,309

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/24/2016, 12:07:15 PM · Difficulty 10.7100 · 5,138,128 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
672f12feeda0c18fd655179a95f29c4c24af2b21e45b7a5da706aa72b91e0f99

Height

#1,687,309

Difficulty

10.710046

Transactions

2

Size

981 B

Version

2

Bits

0ab5c592

Nonce

905,025,761

Timestamp

7/24/2016, 12:07:15 PM

Confirmations

5,138,128

Merkle Root

f67322b18871ba523e2a9b59d5183cb444aa26725ed3f2890dea2d79e18b6318
Transactions (2)
1 in → 1 out8.7100 XPM110 B
5 in → 1 out188.4178 XPM781 B
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.101 × 10⁹⁴(95-digit number)
11015317551502832146…04417641878784033281
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.101 × 10⁹⁴(95-digit number)
11015317551502832146…04417641878784033281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.203 × 10⁹⁴(95-digit number)
22030635103005664293…08835283757568066561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.406 × 10⁹⁴(95-digit number)
44061270206011328587…17670567515136133121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.812 × 10⁹⁴(95-digit number)
88122540412022657174…35341135030272266241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.762 × 10⁹⁵(96-digit number)
17624508082404531434…70682270060544532481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.524 × 10⁹⁵(96-digit number)
35249016164809062869…41364540121089064961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.049 × 10⁹⁵(96-digit number)
70498032329618125739…82729080242178129921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.409 × 10⁹⁶(97-digit number)
14099606465923625147…65458160484356259841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.819 × 10⁹⁶(97-digit number)
28199212931847250295…30916320968712519681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.639 × 10⁹⁶(97-digit number)
56398425863694500591…61832641937425039361
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,847,599 XPM·at block #6,825,436 · 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