Block #376,631

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/26/2014, 1:06:46 PM · Difficulty 10.4252 · 6,448,719 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
34113366839c74e9fb4dec42c7fd4aedbaf1ddb64cb9dd37bc30e53bda936fcf

Height

#376,631

Difficulty

10.425224

Transactions

5

Size

1.23 KB

Version

2

Bits

0a6cdb7b

Nonce

225,504

Timestamp

1/26/2014, 1:06:46 PM

Confirmations

6,448,719

Merkle Root

1b230632355d8c3cc69a8ce2df0339f63ee37961441edfc61d72078b9300aff0
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.715 × 10¹⁰²(103-digit number)
47158454393491500264…26979670630636841371
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.715 × 10¹⁰²(103-digit number)
47158454393491500264…26979670630636841371
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.431 × 10¹⁰²(103-digit number)
94316908786983000528…53959341261273682741
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.886 × 10¹⁰³(104-digit number)
18863381757396600105…07918682522547365481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.772 × 10¹⁰³(104-digit number)
37726763514793200211…15837365045094730961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.545 × 10¹⁰³(104-digit number)
75453527029586400423…31674730090189461921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.509 × 10¹⁰⁴(105-digit number)
15090705405917280084…63349460180378923841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.018 × 10¹⁰⁴(105-digit number)
30181410811834560169…26698920360757847681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.036 × 10¹⁰⁴(105-digit number)
60362821623669120338…53397840721515695361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.207 × 10¹⁰⁵(106-digit number)
12072564324733824067…06795681443031390721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.414 × 10¹⁰⁵(106-digit number)
24145128649467648135…13591362886062781441
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,846,906 XPM·at block #6,825,349 · 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