Block #280,355

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/28/2013, 3:58:48 PM · Difficulty 9.9743 · 6,527,102 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3fd890633eeb16c54c4e0074431f5842a502d7f26ba4807488c2f7e70a724ef5

Height

#280,355

Difficulty

9.974305

Transactions

4

Size

3.78 KB

Version

2

Bits

09f96c10

Nonce

4,411

Timestamp

11/28/2013, 3:58:48 PM

Confirmations

6,527,102

Merkle Root

bf9312dd42533d5a5d9e55160ce86cf5b5a884b9344b64cd794506f58f4b8618
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.298 × 10⁹⁹(100-digit number)
32981321851459887065…15215658867962406899
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.298 × 10⁹⁹(100-digit number)
32981321851459887065…15215658867962406899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.596 × 10⁹⁹(100-digit number)
65962643702919774130…30431317735924813799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.319 × 10¹⁰⁰(101-digit number)
13192528740583954826…60862635471849627599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.638 × 10¹⁰⁰(101-digit number)
26385057481167909652…21725270943699255199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.277 × 10¹⁰⁰(101-digit number)
52770114962335819304…43450541887398510399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.055 × 10¹⁰¹(102-digit number)
10554022992467163860…86901083774797020799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.110 × 10¹⁰¹(102-digit number)
21108045984934327721…73802167549594041599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.221 × 10¹⁰¹(102-digit number)
42216091969868655443…47604335099188083199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.443 × 10¹⁰¹(102-digit number)
84432183939737310886…95208670198376166399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.688 × 10¹⁰²(103-digit number)
16886436787947462177…90417340396752332799
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,703,680 XPM·at block #6,807,456 · 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