Block #1,712,590

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/11/2016, 7:22:13 PM · Difficulty 10.6424 · 5,093,941 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ba2912fc902fb7c19543659a38d02205c9188a37a2006bc69410f7b81211908f

Height

#1,712,590

Difficulty

10.642364

Transactions

5

Size

7.73 KB

Version

2

Bits

0aa471f4

Nonce

610,676,581

Timestamp

8/11/2016, 7:22:13 PM

Confirmations

5,093,941

Merkle Root

11ae60204e44cfe6624a50a78df72c6a056710f34a448e339a6e5de2fdf6a354
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.347 × 10⁹³(94-digit number)
83478303370353563341…79755571646085555159
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.347 × 10⁹³(94-digit number)
83478303370353563341…79755571646085555159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.669 × 10⁹⁴(95-digit number)
16695660674070712668…59511143292171110319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.339 × 10⁹⁴(95-digit number)
33391321348141425336…19022286584342220639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.678 × 10⁹⁴(95-digit number)
66782642696282850673…38044573168684441279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.335 × 10⁹⁵(96-digit number)
13356528539256570134…76089146337368882559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.671 × 10⁹⁵(96-digit number)
26713057078513140269…52178292674737765119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.342 × 10⁹⁵(96-digit number)
53426114157026280538…04356585349475530239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.068 × 10⁹⁶(97-digit number)
10685222831405256107…08713170698951060479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.137 × 10⁹⁶(97-digit number)
21370445662810512215…17426341397902120959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.274 × 10⁹⁶(97-digit number)
42740891325621024430…34852682795804241919
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,696,347 XPM·at block #6,806,530 · 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.

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