Block #235,934

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/31/2013, 5:35:37 AM · Difficulty 9.9464 · 6,594,612 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
adbea10e5ec556215d7af7b7ee1ee5743cb3e0f62a0a92ab6b2da15f0e22db08

Height

#235,934

Difficulty

9.946352

Transactions

4

Size

2.75 KB

Version

2

Bits

09f24425

Nonce

117,713

Timestamp

10/31/2013, 5:35:37 AM

Confirmations

6,594,612

Merkle Root

ec082deb7723f690cb2d242d870cc21474892559a98517d6ee80a47b2516db8f
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.158 × 10⁹¹(92-digit number)
41586314549789417852…37689719028434550639
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.158 × 10⁹¹(92-digit number)
41586314549789417852…37689719028434550639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.317 × 10⁹¹(92-digit number)
83172629099578835705…75379438056869101279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.663 × 10⁹²(93-digit number)
16634525819915767141…50758876113738202559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.326 × 10⁹²(93-digit number)
33269051639831534282…01517752227476405119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.653 × 10⁹²(93-digit number)
66538103279663068564…03035504454952810239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.330 × 10⁹³(94-digit number)
13307620655932613712…06071008909905620479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.661 × 10⁹³(94-digit number)
26615241311865227425…12142017819811240959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.323 × 10⁹³(94-digit number)
53230482623730454851…24284035639622481919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.064 × 10⁹⁴(95-digit number)
10646096524746090970…48568071279244963839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.129 × 10⁹⁴(95-digit number)
21292193049492181940…97136142558489927679
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,888,617 XPM·at block #6,830,545 · 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