Block #273,131

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/25/2013, 3:36:55 PM · Difficulty 9.9542 · 6,536,830 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1a6b60b990f70e3b1b371c7be68c8d7f86d840db04e443489ed237b926c8aeaf

Height

#273,131

Difficulty

9.954177

Transactions

5

Size

1.12 KB

Version

2

Bits

09f444f8

Nonce

52,533

Timestamp

11/25/2013, 3:36:55 PM

Confirmations

6,536,830

Merkle Root

4fa1324c67d0c81ce67440d11e4f47f212483776a11873e12a505f86eac460ab
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.190 × 10⁹⁵(96-digit number)
11909911821807000039…20791262259103333241
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.190 × 10⁹⁵(96-digit number)
11909911821807000039…20791262259103333241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.381 × 10⁹⁵(96-digit number)
23819823643614000079…41582524518206666481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.763 × 10⁹⁵(96-digit number)
47639647287228000159…83165049036413332961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.527 × 10⁹⁵(96-digit number)
95279294574456000319…66330098072826665921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.905 × 10⁹⁶(97-digit number)
19055858914891200063…32660196145653331841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.811 × 10⁹⁶(97-digit number)
38111717829782400127…65320392291306663681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.622 × 10⁹⁶(97-digit number)
76223435659564800255…30640784582613327361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.524 × 10⁹⁷(98-digit number)
15244687131912960051…61281569165226654721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.048 × 10⁹⁷(98-digit number)
30489374263825920102…22563138330453309441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.097 × 10⁹⁷(98-digit number)
60978748527651840204…45126276660906618881
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,723,760 XPM·at block #6,809,960 · 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