Block #227,821

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/26/2013, 3:03:16 AM · Difficulty 9.9372 · 6,580,142 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c6bb32484cc8e0eff8fc49e37c5d0c524fccc2c4f60aef15f6709232310130de

Height

#227,821

Difficulty

9.937177

Transactions

3

Size

1.55 KB

Version

2

Bits

09efead9

Nonce

70,028

Timestamp

10/26/2013, 3:03:16 AM

Confirmations

6,580,142

Merkle Root

3e0858c539fdd3fc74c93b46763266cf29997522324ea64f1cc18ac6c57ebd17
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.

7.689 × 10⁹⁶(97-digit number)
76890799103137252880…30285667098651046401
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
7.689 × 10⁹⁶(97-digit number)
76890799103137252880…30285667098651046401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.537 × 10⁹⁷(98-digit number)
15378159820627450576…60571334197302092801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.075 × 10⁹⁷(98-digit number)
30756319641254901152…21142668394604185601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.151 × 10⁹⁷(98-digit number)
61512639282509802304…42285336789208371201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.230 × 10⁹⁸(99-digit number)
12302527856501960460…84570673578416742401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.460 × 10⁹⁸(99-digit number)
24605055713003920921…69141347156833484801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.921 × 10⁹⁸(99-digit number)
49210111426007841843…38282694313666969601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.842 × 10⁹⁸(99-digit number)
98420222852015683687…76565388627333939201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.968 × 10⁹⁹(100-digit number)
19684044570403136737…53130777254667878401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.936 × 10⁹⁹(100-digit number)
39368089140806273475…06261554509335756801
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,707,747 XPM·at block #6,807,962 · 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