Block #1,775,503

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/23/2016, 3:30:26 AM · Difficulty 10.7586 · 5,038,559 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
538cef5b7b5c21b1b813fedf9a69cfbb70434686780c8c5d795fed653b1fb23a

Height

#1,775,503

Difficulty

10.758583

Transactions

2

Size

1.28 KB

Version

2

Bits

0ac23277

Nonce

727,679,581

Timestamp

9/23/2016, 3:30:26 AM

Confirmations

5,038,559

Merkle Root

73ac67c3dcd57335a63ec417b2da8a5ed7f069f269d270a8ea1035f755721a73
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.

6.020 × 10⁹⁴(95-digit number)
60206041468017978022…55899497554821703679
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
6.020 × 10⁹⁴(95-digit number)
60206041468017978022…55899497554821703679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.204 × 10⁹⁵(96-digit number)
12041208293603595604…11798995109643407359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.408 × 10⁹⁵(96-digit number)
24082416587207191208…23597990219286814719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.816 × 10⁹⁵(96-digit number)
48164833174414382417…47195980438573629439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.632 × 10⁹⁵(96-digit number)
96329666348828764835…94391960877147258879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.926 × 10⁹⁶(97-digit number)
19265933269765752967…88783921754294517759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.853 × 10⁹⁶(97-digit number)
38531866539531505934…77567843508589035519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.706 × 10⁹⁶(97-digit number)
77063733079063011868…55135687017178071039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.541 × 10⁹⁷(98-digit number)
15412746615812602373…10271374034356142079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.082 × 10⁹⁷(98-digit number)
30825493231625204747…20542748068712284159
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,756,573 XPM·at block #6,814,061 · 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