Block #1,780,927

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/26/2016, 7:40:37 PM · Difficulty 10.7652 · 5,035,420 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ba98cb92d573b960614fdcf06b91d9e50f097777e29beb21db5f0e9d6d76595c

Height

#1,780,927

Difficulty

10.765169

Transactions

3

Size

3.59 KB

Version

2

Bits

0ac3e222

Nonce

1,788,663,154

Timestamp

9/26/2016, 7:40:37 PM

Confirmations

5,035,420

Merkle Root

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

3.074 × 10⁹⁴(95-digit number)
30748461803005603060…68674936334997072959
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
3.074 × 10⁹⁴(95-digit number)
30748461803005603060…68674936334997072959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.149 × 10⁹⁴(95-digit number)
61496923606011206120…37349872669994145919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.229 × 10⁹⁵(96-digit number)
12299384721202241224…74699745339988291839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.459 × 10⁹⁵(96-digit number)
24598769442404482448…49399490679976583679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.919 × 10⁹⁵(96-digit number)
49197538884808964896…98798981359953167359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.839 × 10⁹⁵(96-digit number)
98395077769617929792…97597962719906334719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.967 × 10⁹⁶(97-digit number)
19679015553923585958…95195925439812669439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.935 × 10⁹⁶(97-digit number)
39358031107847171916…90391850879625338879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.871 × 10⁹⁶(97-digit number)
78716062215694343833…80783701759250677759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.574 × 10⁹⁷(98-digit number)
15743212443138868766…61567403518501355519
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,774,900 XPM·at block #6,816,346 · 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