Block #435,965

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/9/2014, 7:11:28 AM · Difficulty 10.3548 · 6,380,987 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bc3cade0f5d75043c4dae218ddf626d0d82dec23fc86d62ed195aa4854900112

Height

#435,965

Difficulty

10.354778

Transactions

4

Size

3.92 KB

Version

2

Bits

0a5ad2bf

Nonce

15,119

Timestamp

3/9/2014, 7:11:28 AM

Confirmations

6,380,987

Merkle Root

cf794c6866e9c5073fee2ad9b871e39a925f33f922993c7dc1652cf83bd16210
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.611 × 10⁹⁶(97-digit number)
66119877826894951427…49935993025908901039
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.611 × 10⁹⁶(97-digit number)
66119877826894951427…49935993025908901039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.322 × 10⁹⁷(98-digit number)
13223975565378990285…99871986051817802079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.644 × 10⁹⁷(98-digit number)
26447951130757980571…99743972103635604159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.289 × 10⁹⁷(98-digit number)
52895902261515961142…99487944207271208319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.057 × 10⁹⁸(99-digit number)
10579180452303192228…98975888414542416639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.115 × 10⁹⁸(99-digit number)
21158360904606384456…97951776829084833279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.231 × 10⁹⁸(99-digit number)
42316721809212768913…95903553658169666559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.463 × 10⁹⁸(99-digit number)
84633443618425537827…91807107316339333119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.692 × 10⁹⁹(100-digit number)
16926688723685107565…83614214632678666239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.385 × 10⁹⁹(100-digit number)
33853377447370215131…67228429265357332479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.770 × 10⁹⁹(100-digit number)
67706754894740430262…34456858530714664959
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,779,660 XPM·at block #6,816,951 · 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