Block #265,380

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/19/2013, 12:36:59 PM · Difficulty 9.9627 · 6,546,730 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f6a1acce4099a768aa5a5a626a877bfe22e1880154926952a1fee5e81dcdf4a8

Height

#265,380

Difficulty

9.962689

Transactions

1

Size

2.14 KB

Version

2

Bits

09f672c7

Nonce

1,167,211

Timestamp

11/19/2013, 12:36:59 PM

Confirmations

6,546,730

Merkle Root

d0e52a5e189f6debc9d6497f37c0767f746181ddbbebe73839382d97f6bdf70c
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.451 × 10⁹³(94-digit number)
44512007195624279562…12478971441042573439
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.451 × 10⁹³(94-digit number)
44512007195624279562…12478971441042573439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.902 × 10⁹³(94-digit number)
89024014391248559125…24957942882085146879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.780 × 10⁹⁴(95-digit number)
17804802878249711825…49915885764170293759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.560 × 10⁹⁴(95-digit number)
35609605756499423650…99831771528340587519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.121 × 10⁹⁴(95-digit number)
71219211512998847300…99663543056681175039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.424 × 10⁹⁵(96-digit number)
14243842302599769460…99327086113362350079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.848 × 10⁹⁵(96-digit number)
28487684605199538920…98654172226724700159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.697 × 10⁹⁵(96-digit number)
56975369210399077840…97308344453449400319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.139 × 10⁹⁶(97-digit number)
11395073842079815568…94616688906898800639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.279 × 10⁹⁶(97-digit number)
22790147684159631136…89233377813797601279
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,740,984 XPM·at block #6,812,109 · 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