Block #434,297

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/8/2014, 4:51:55 AM · Difficulty 10.3425 · 6,381,629 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ac2cd9bb802e2c8293a1f86cd240f501e614ebedb6bcf5bcb901a29549ef032f

Height

#434,297

Difficulty

10.342549

Transactions

2

Size

1.14 KB

Version

2

Bits

0a57b14f

Nonce

9,648

Timestamp

3/8/2014, 4:51:55 AM

Confirmations

6,381,629

Merkle Root

af88c49bd4dc8deb33e05cea83c3dd72e0829ac7466d7bc23bf0157bba9c161b
Transactions (2)
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.

1.335 × 10⁹⁹(100-digit number)
13352233658950491232…09037733124665279999
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
1.335 × 10⁹⁹(100-digit number)
13352233658950491232…09037733124665279999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.670 × 10⁹⁹(100-digit number)
26704467317900982464…18075466249330559999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.340 × 10⁹⁹(100-digit number)
53408934635801964928…36150932498661119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.068 × 10¹⁰⁰(101-digit number)
10681786927160392985…72301864997322239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.136 × 10¹⁰⁰(101-digit number)
21363573854320785971…44603729994644479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.272 × 10¹⁰⁰(101-digit number)
42727147708641571942…89207459989288959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.545 × 10¹⁰⁰(101-digit number)
85454295417283143884…78414919978577919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.709 × 10¹⁰¹(102-digit number)
17090859083456628776…56829839957155839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.418 × 10¹⁰¹(102-digit number)
34181718166913257553…13659679914311679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.836 × 10¹⁰¹(102-digit number)
68363436333826515107…27319359828623359999
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,771,520 XPM·at block #6,815,925 · 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