Block #444,658

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/15/2014, 9:46:50 AM · Difficulty 10.3476 · 6,365,417 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f494686d3a346e6a5cd69c1ff1e31850a0031341dd25e6348e95bdcf84516da2

Height

#444,658

Difficulty

10.347601

Transactions

3

Size

2.51 KB

Version

2

Bits

0a58fc60

Nonce

83,664

Timestamp

3/15/2014, 9:46:50 AM

Confirmations

6,365,417

Merkle Root

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

9.964 × 10⁹⁹(100-digit number)
99644408274709959331…44634320656357247999
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
9.964 × 10⁹⁹(100-digit number)
99644408274709959331…44634320656357247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.992 × 10¹⁰⁰(101-digit number)
19928881654941991866…89268641312714495999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.985 × 10¹⁰⁰(101-digit number)
39857763309883983732…78537282625428991999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.971 × 10¹⁰⁰(101-digit number)
79715526619767967465…57074565250857983999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.594 × 10¹⁰¹(102-digit number)
15943105323953593493…14149130501715967999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.188 × 10¹⁰¹(102-digit number)
31886210647907186986…28298261003431935999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.377 × 10¹⁰¹(102-digit number)
63772421295814373972…56596522006863871999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.275 × 10¹⁰²(103-digit number)
12754484259162874794…13193044013727743999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.550 × 10¹⁰²(103-digit number)
25508968518325749588…26386088027455487999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.101 × 10¹⁰²(103-digit number)
51017937036651499177…52772176054910975999
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,724,671 XPM·at block #6,810,074 · 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