Block #269,919

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/23/2013, 1:50:57 PM · Difficulty 9.9519 · 6,544,936 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5f8a40e67bb311816b585094b7b32e6bf6f0188cfacd4463c74588311db2f97d

Height

#269,919

Difficulty

9.951939

Transactions

3

Size

2.80 KB

Version

2

Bits

09f3b244

Nonce

36,062

Timestamp

11/23/2013, 1:50:57 PM

Confirmations

6,544,936

Merkle Root

092944e2d2cbeca1c3683d45a0640a40aca97765736b1f43b568f2407d06a835
Transactions (3)
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.833 × 10⁹⁷(98-digit number)
38330705291390553252…65024475856224778239
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.833 × 10⁹⁷(98-digit number)
38330705291390553252…65024475856224778239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.666 × 10⁹⁷(98-digit number)
76661410582781106504…30048951712449556479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.533 × 10⁹⁸(99-digit number)
15332282116556221300…60097903424899112959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.066 × 10⁹⁸(99-digit number)
30664564233112442601…20195806849798225919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.132 × 10⁹⁸(99-digit number)
61329128466224885203…40391613699596451839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.226 × 10⁹⁹(100-digit number)
12265825693244977040…80783227399192903679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.453 × 10⁹⁹(100-digit number)
24531651386489954081…61566454798385807359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.906 × 10⁹⁹(100-digit number)
49063302772979908163…23132909596771614719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.812 × 10⁹⁹(100-digit number)
98126605545959816326…46265819193543229439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.962 × 10¹⁰⁰(101-digit number)
19625321109191963265…92531638387086458879
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,762,923 XPM·at block #6,814,854 · 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