Block #363,757

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2014, 3:24:42 PM · Difficulty 10.4150 · 6,443,059 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bf85f54ba2869686270244368f3f672b35f24e6fa05f420eefdb59fb215127f3

Height

#363,757

Difficulty

10.415012

Transactions

5

Size

1.39 KB

Version

2

Bits

0a6a3e33

Nonce

115,773

Timestamp

1/17/2014, 3:24:42 PM

Confirmations

6,443,059

Merkle Root

827785d921bee609898dfa6efff52edb40246b8d030cc2ac57085b0b8b1d4753
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.

3.738 × 10⁹⁵(96-digit number)
37383229423647251291…08368051418919948881
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
3.738 × 10⁹⁵(96-digit number)
37383229423647251291…08368051418919948881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.476 × 10⁹⁵(96-digit number)
74766458847294502583…16736102837839897761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.495 × 10⁹⁶(97-digit number)
14953291769458900516…33472205675679795521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.990 × 10⁹⁶(97-digit number)
29906583538917801033…66944411351359591041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.981 × 10⁹⁶(97-digit number)
59813167077835602066…33888822702719182081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.196 × 10⁹⁷(98-digit number)
11962633415567120413…67777645405438364161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.392 × 10⁹⁷(98-digit number)
23925266831134240826…35555290810876728321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.785 × 10⁹⁷(98-digit number)
47850533662268481653…71110581621753456641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.570 × 10⁹⁷(98-digit number)
95701067324536963306…42221163243506913281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.914 × 10⁹⁸(99-digit number)
19140213464907392661…84442326487013826561
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,698,629 XPM·at block #6,806,815 · 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