Block #276,423

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/27/2013, 4:25:24 AM · Difficulty 9.9631 · 6,550,498 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c2c7ced674931d2f80af012ccfdd0ccd93c0c8521f85aceed572c3b42cf4b546

Height

#276,423

Difficulty

9.963127

Transactions

6

Size

4.58 KB

Version

2

Bits

09f68f86

Nonce

6,679

Timestamp

11/27/2013, 4:25:24 AM

Confirmations

6,550,498

Merkle Root

34a557ed0edf98bd06f05edc9d8ef91ab3e3211eb6de52810c7b0941f01d0c01
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.

6.182 × 10¹⁰²(103-digit number)
61826951930011641478…12974340533511357209
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
6.182 × 10¹⁰²(103-digit number)
61826951930011641478…12974340533511357209
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.236 × 10¹⁰³(104-digit number)
12365390386002328295…25948681067022714419
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.473 × 10¹⁰³(104-digit number)
24730780772004656591…51897362134045428839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.946 × 10¹⁰³(104-digit number)
49461561544009313182…03794724268090857679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.892 × 10¹⁰³(104-digit number)
98923123088018626365…07589448536181715359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.978 × 10¹⁰⁴(105-digit number)
19784624617603725273…15178897072363430719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.956 × 10¹⁰⁴(105-digit number)
39569249235207450546…30357794144726861439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.913 × 10¹⁰⁴(105-digit number)
79138498470414901092…60715588289453722879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.582 × 10¹⁰⁵(106-digit number)
15827699694082980218…21431176578907445759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.165 × 10¹⁰⁵(106-digit number)
31655399388165960436…42862353157814891519
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,859,539 XPM·at block #6,826,920 · 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