Block #1,208,985

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/26/2015, 7:47:24 AM · Difficulty 10.7657 · 5,608,696 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f79d26f4e647968fe1635dd8732cb8f69d9c91c093b71abaeae1791a81a55092

Height

#1,208,985

Difficulty

10.765711

Transactions

2

Size

1.72 KB

Version

2

Bits

0ac405a5

Nonce

518,108,148

Timestamp

8/26/2015, 7:47:24 AM

Confirmations

5,608,696

Merkle Root

0f73d242076a13de30c9fc9635b3659e0bebdf692290062dc62ad86cd976ebf8
Transactions (2)
1 in → 1 out8.6300 XPM110 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.

4.801 × 10⁹¹(92-digit number)
48017729641769585216…08033386210566390399
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
4.801 × 10⁹¹(92-digit number)
48017729641769585216…08033386210566390399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.603 × 10⁹¹(92-digit number)
96035459283539170432…16066772421132780799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.920 × 10⁹²(93-digit number)
19207091856707834086…32133544842265561599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.841 × 10⁹²(93-digit number)
38414183713415668172…64267089684531123199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.682 × 10⁹²(93-digit number)
76828367426831336345…28534179369062246399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.536 × 10⁹³(94-digit number)
15365673485366267269…57068358738124492799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.073 × 10⁹³(94-digit number)
30731346970732534538…14136717476248985599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.146 × 10⁹³(94-digit number)
61462693941465069076…28273434952497971199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.229 × 10⁹⁴(95-digit number)
12292538788293013815…56546869904995942399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.458 × 10⁹⁴(95-digit number)
24585077576586027630…13093739809991884799
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,785,505 XPM·at block #6,817,680 · 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