Block #487,202

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/12/2014, 12:30:19 AM · Difficulty 10.6381 · 6,323,897 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
66ee4c403bb1b6983c4b51271e6182d736ad91930a9bcf9a92fc1fafe2ba5a5c

Height

#487,202

Difficulty

10.638105

Transactions

9

Size

3.29 KB

Version

2

Bits

0aa35ad6

Nonce

223,670,375

Timestamp

4/12/2014, 12:30:19 AM

Confirmations

6,323,897

Merkle Root

777878178528714e68456982744713f9ce130389c8811c3f35693a5a4f7237ab
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.

2.440 × 10⁹⁹(100-digit number)
24406338037578321386…03285378874212244479
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
2.440 × 10⁹⁹(100-digit number)
24406338037578321386…03285378874212244479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.881 × 10⁹⁹(100-digit number)
48812676075156642772…06570757748424488959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.762 × 10⁹⁹(100-digit number)
97625352150313285544…13141515496848977919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.952 × 10¹⁰⁰(101-digit number)
19525070430062657108…26283030993697955839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.905 × 10¹⁰⁰(101-digit number)
39050140860125314217…52566061987395911679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.810 × 10¹⁰⁰(101-digit number)
78100281720250628435…05132123974791823359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.562 × 10¹⁰¹(102-digit number)
15620056344050125687…10264247949583646719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.124 × 10¹⁰¹(102-digit number)
31240112688100251374…20528495899167293439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.248 × 10¹⁰¹(102-digit number)
62480225376200502748…41056991798334586879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.249 × 10¹⁰²(103-digit number)
12496045075240100549…82113983596669173759
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,732,900 XPM·at block #6,811,098 · 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