Block #273,167

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/25/2013, 4:05:57 PM · Difficulty 9.9542 · 6,543,773 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cac04aeb57ac695133f8f135e0335bc1a4061e9a0920c658605f39e361c1fd7b

Height

#273,167

Difficulty

9.954227

Transactions

2

Size

1.28 KB

Version

2

Bits

09f4483b

Nonce

97,704

Timestamp

11/25/2013, 4:05:57 PM

Confirmations

6,543,773

Merkle Root

38d9641b2e24bfd58f98ed5769a70a3555009773ff848fe9609a49594629402c
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.

2.635 × 10⁹⁵(96-digit number)
26355405746047422224…66592957480186480599
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
2.635 × 10⁹⁵(96-digit number)
26355405746047422224…66592957480186480599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.271 × 10⁹⁵(96-digit number)
52710811492094844449…33185914960372961199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.054 × 10⁹⁶(97-digit number)
10542162298418968889…66371829920745922399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.108 × 10⁹⁶(97-digit number)
21084324596837937779…32743659841491844799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.216 × 10⁹⁶(97-digit number)
42168649193675875559…65487319682983689599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.433 × 10⁹⁶(97-digit number)
84337298387351751119…30974639365967379199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.686 × 10⁹⁷(98-digit number)
16867459677470350223…61949278731934758399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.373 × 10⁹⁷(98-digit number)
33734919354940700447…23898557463869516799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.746 × 10⁹⁷(98-digit number)
67469838709881400895…47797114927739033599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.349 × 10⁹⁸(99-digit number)
13493967741976280179…95594229855478067199
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,779,562 XPM·at block #6,816,939 · 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